Action-calibrated cycle-hopping RNN
Implementation & benchmark of arXiv:2608.19060 — Activated switching between coexisting limit cycles
Source paper: Activated switching between coexisting limit cycles arXiv:2608.19060 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Build a continuous-time RNN or neural state-space model whose latent dynamics possess two stable periodic attractors representing persistent sequence modes, then inject weak calibrated noise to induce rare transitions between them. Instead of treating mode switching as an arbitrary classifier event, estimate the minimum transition action and tune the noise level or an explicit control input so that the observed switching rate matches the desired rate. This should improve long-horizon multimodal prediction by preserving stable within-mode oscillations while allowing statistically correct mode changes.
Formulas
Mathematical statement
Let z(t) in R^d be the latent state, f_theta(z,t) the learned drift, B the noise matrix, D>0 the noise intensity, and W_t standard Brownian motion. The latent model is dz=f_theta(z,t)dt+sqrt(2D)B dW_t. For a candidate path phi(t) joining neighborhoods of two stable limit cycles C_1 and C_2 over duration T, define the Freidlin-Wentzell action S[phi]=(1/4) integral from 0 to T of (dot(phi)-f_theta(phi,t))^T (BB^T)^(-1)(dot(phi)-f_theta(phi,t)) dt, assuming BB^T is positive definite. The activation action Delta S_12 is the infimum of S over all such paths, with initial and final phases on the two cycles optimized. In the weak-noise regime, the transition rate satisfies k_12(D) approximately A_12 exp(-Delta S_12/D), where A_12 is a prefactor. Thus log k_12 is linear in 1/D with slope -Delta S_12, rather than being determined by a static energy barrier. Stability of each learned cycle is monitored from transverse Floquet multipliers of the deterministic discretized flow; every multiplier other than the neutral phase multiplier should have magnitude below one.
Implementation notes
1. Integration point: use a continuous-time latent RNN, Neural ODE, or diagonal state-space model with Euler updates z[n+1]=z[n]+dt f_theta(z[n],x[n])+sqrt(2D dt) B epsilon[n], where epsilon[n] is standard Gaussian noise. Decode observations with y[n]=g_theta(z[n]). First create two stable latent cycles using two learned periodic prototype trajectories or initialize the drift from two weakly coupled oscillators; train on sequences containing two recurring modes and occasional mode transitions. Add a regularizer penalizing positive transverse Floquet growth and optionally add an action-calibration loss when transition statistics are labeled. 2. Pseudocode: simulate a deterministic rollout to identify cycles C1 and C2; inject noise; count first-passage transitions between phase-invariant distance thresholds around C1 and C2; estimate k=N_transitions/total_time for each D. Estimate Delta S with a discretized minimum-action path. Initialize a path between closest phase points on C1 and C2, then optimize its coordinates using Adam on the discrete action sum dt/4 times the squared Mahalanobis norm of (phi[n+1]-phi[n])/dt-f_theta(phi[n]), reparameterizing the path by arc length after each optimization block. 3. Computed from the mechanism: the action functional, exponential rate law, and phase-invariant endpoint condition. Estimated empirically: cycle locations, Floquet multipliers, prefactor A, and finite-noise rates. 4. First cheap experiment: train a two-dimensional Neural ODE or GRU on a synthetic mixture of two noisy periodic signals, with each mode generated by a different stable oscillator and transitions occurring at a known hazard. Compare a standard GRU, a deterministic two-mode model, and the action-calibrated model at horizons ten times the training window. Sweep D over at least five values and fit log k versus 1/D. The falsifiable prediction is a clear linear Arrhenius regime whose fitted slope agrees with the minimum-action estimate within 20%; transverse Floquet multipliers should remain below one, and long-horizon within-mode phase error should grow more slowly than in an unconstrained noisy RNN. When D becomes large enough that typical noise displacement per cycle exceeds basin width, the linear rare-event law should fail and switching should become frequent.
Verification
Stage 1 · Toy mechanism gate: Passed ✓
Stage 2 · Mechanism transferred to benchmark: Not reproduced ✗
Stage 2 · Practical benchmark result: No measurable effect
Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works
Stage 1 — Mechanism check agent confidence 8/10
Built and numerically verified a two-cycle stochastic continuous-time latent system with action estimation, discrete minimum-action optimization, Floquet stability checks, and transition-rate sweeps. The action estimate agreed with the finite-endpoint integral within 0.07%, transverse Floquet multipliers were 0.0432 for both cycles, and the rare-noise Arrhenius slope was -0.01481 versus the predicted -0.015625 (5.2% error, R²=0.999). At high noise the fitted slope shifted to -0.0547, confirming breakdown of the rare-event law; this validates the mechanism in the toy setting, but not neural sequence prediction.
- Agent confidence
- 8/10
- Baseline
- No neural baseline was run; this experiment tests the mechanism directly. Predicted action barrier=0.015625, rare-regime fitted slope=-0.01481, R²=0.9992, Floquet multipliers=0.0432, predicted noise crossover D≈0.0199.
- Idea
- Discrete action estimate=0.01549 versus finite-endpoint integral=0.01548 (0.07% relative error); rare-regime rate slope agrees within 5.2%; high-noise slope=-0.0547 versus rare slope=-0.0148, demonstrating non-Arrhenius crossover.
Limitations: This is a low-dimensional radial toy system rather than a trained GRU, Neural ODE, or world model. It does not test long-horizon multimodal prediction, sample efficiency, learned action calibration, prefactor estimation, anisotropic noise, or comparison against a standard RNN. The transition estimator uses finite-step Euler simulation and a separatrix threshold, and the action optimization uses fixed duration and endpoints.
How to run: python3 experiment.py
Stage 2 — Benchmark vs. tuned baseline (arXiv:2608.19060)
No significant difference vs. the tuned baseline (0.0001 metric points, p=0.8233, wins 4 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0
- Idea mean
- 0.0014
- Effect (Δ)
- 0.0001 (n/a; negative = idea better)
- Wins
- 4 / 8 paired seeds
- p-value
- 0.8233 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- n/a
- Mechanism
- Not confirmed ✗
- Practical effect
- No effect
- Baseline tuning
- swept over 0 configs
The built-in dynamics task is an actuated damped-pendulum one-step-through-horizon regression, not a dataset with explicit multimodal recurring limit-cycle modes or labeled transition hazards. The implemented intervention is a local hidden-state contraction proxy rather than a learned Freidlin-Wentzell action estimator, explicit noise calibration, or long-horizon stochastic mode-switching objective; only 12 training epochs, one lambda value, and the standard 8-seed protocol were tested.
How to run: python3 bench_stage2.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Stage 2 — Benchmark latest Failed ✗
Agent confidence: 9/10
Implemented action-calibrated cycle-hopping-inspired recurrent stabilization as a hidden-state contraction regularizer on the structurally matched dynamics track. Across 8 paired seeds, the idea had higher test MSE than the tuned baseline (0.00144999 vs 0.00138748; delta +0.00006251) with permutation p=0.82325, and the trained-model mechanism signature was not confirmed because hidden gain increased slightly (0.56313 vs 0.56012).
- Baseline
- rnn_small dynamics, tuned lr=0.01 and weight_decay=0.0001; 8-seed test MSE mean=0.0013874755, std=0.000377963
- Delta mean
- +0.0000625129 MSE (idea worse; lower is better)
- Idea
- rnn_small plus recurrent contraction penalty lambda=0.02, best tested lr=0.01 and weight_decay=0.0001; 8-seed test MSE mean=0.0014499884, std=0.000625824
- Idea wins
- 4
- Mechanism signature
- map[baseline_hidden_gain:0.5601233 confirmed:false idea_hidden_gain:0.5631289 relative_gain_change:0.005366]
- N pairs
- 8
- Permutation p value
- 0.82325
Benchmark result
No significant difference vs. the tuned baseline (0.0001 metric points, p=0.8233, wins 4 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0
- Idea mean
- 0.0014
- Effect (Δ)
- 0.0001 (n/a; negative = idea better)
- Wins
- 4 / 8 paired seeds
- p-value
- 0.8233 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- n/a
- Mechanism
- Not confirmed ✗
- Practical effect
- No effect
- Baseline tuning
- swept over 0 configs
The built-in dynamics task is an actuated damped-pendulum one-step-through-horizon regression, not a dataset with explicit multimodal recurring limit-cycle modes or labeled transition hazards. The implemented intervention is a local hidden-state contraction proxy rather than a learned Freidlin-Wentzell action estimator, explicit noise calibration, or long-horizon stochastic mode-switching objective; only 12 training epochs, one lambda value, and the standard 8-seed protocol were tested.
How to run: python3 bench_stage2.py
Artifacts
- bench_report.json 5.0 KB View Raw
- bench_stage2.py 6.4 KB View Raw
- experiment.py 5.1 KB View Raw
- report.md 1.8 KB View
- report_bench_2026-09-01T174400.md 3.9 KB View
- results.json 2.7 KB View Raw