Order-One Slow-Gate Reservoir
Implementation & benchmark of arXiv:2608.08074 — Low-frequency output fluctuations in an open exclusion process with particle pausing
Source paper: Low-frequency output fluctuations in an open exclusion process with particle pausing arXiv:2608.08074 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Augment an RNN or state-space layer with binary reversible gates: active units update normally, while paused units hold or weakly update their hidden state and temporarily suppress downstream activity. Tune the pause probability so that the expected number of paused units is near Np* ≈ 1.5, creating intermittent long-memory episodes without pausing the entire layer. The paper predicts that this regime should maximize low-frequency output variability and may improve tasks requiring rare, persistent events, while excessive pausing should reduce throughput and excessive unpausing should eliminate long memory.
Formulas
Mathematical statement
Let L be the number of recurrent units, zi(t) ∈ {0,1} the pause state of unit i, kp the active-to-paused rate, and ku the paused-to-active rate. Under independent birth-death gating, the mean paused population is Np = Lρp, with ρp = kp divided by (kp + ku), and in the rare-pause limit Np ≈ Lkp divided by ku. The transferred finite-size crossover is Np ≈ Np* ≈ 1.5, implying kp* ≈ 1.5ku divided by L. Use hidden dynamics hi(t+1) = (1 − zi(t))φi(h(t), x(t)) + zi(t)hi(t), or a soft differentiable version during training. If gate residence dominates the output dynamics, the predicted correlation time scales as τc proportional to 1 divided by ku, while the largest low-frequency Fano-like ratio should peak near Np ≈ 1.5, not necessarily near the largest mean pause count. The paper further indicates that output-noise amplitude is governed by fluctuations in the largest coherent cluster, so measure both paused-count variance and connected active or paused clusters rather than only the mean gate count.
Implementation notes
Integrate the mechanism into a small GRU, linear state-space model, or gated residual RNN. Maintain one binary or relaxed pause variable per hidden channel. At each sequence step, sample or update the gate with active-to-paused probability pp = 1 − exp(−kp Δt) and paused-to-active probability pu = 1 − exp(−ku Δt). Apply the recurrent transition only to active channels; paused channels retain their previous state, and optionally multiply their outgoing contribution by a learned blocking factor. For differentiable training, use a Binary-Concrete gate with straight-through sampling, but evaluate the final model with hard gates. The pseudocode is: compute pp and pu; update each zi using its two-state transition; compute hi_new = (1 − zi) φi(h, x) + zi hi; compute the readout y; then backpropagate through relaxed gates. The birth-death stationary relation and Np* ≈ 1.5 are taken from the paper; estimate the actual stationary Np, its variance, output autocorrelation, and cluster statistics empirically. First run a cheap copy-memory and adding-problem experiment with L in {32, 64, 128, 256}, comparing a vanilla GRU, independently paused gates, and a fixed-delay baseline at matched parameter count. Sweep kp while holding ku fixed. The quantitative prediction is that the low-frequency Fano-like statistic FT = Var(sum of yt) divided by E[sum of yt] peaks when Lkp divided by ku is approximately 1.5, and the peak location obeys kp* proportional to L raised to minus one within roughly 20 percent. The output correlation time should increase approximately as 1 divided by ku at fixed Np, while the peak should disappear when Np is much smaller than one or much larger than one. Test whether the peak coincides with improved long-delay accuracy rather than merely increased output variance.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.