✓✓ Beats tuned baseline 2026

Fourier-Mode Stability Shaping

Implementation & benchmark of arXiv:2608.29630 — Existence and Stability of Dancing Equilibria in Asymmetric Kuramoto Networks

Usefulness7/10
Difficulty5/10
Novelty8/10

Source paper: Existence and Stability of Dancing Equilibria in Asymmetric Kuramoto Networks arXiv:2608.29630 ⓘ · analyzed Sep 1, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Use a cyclic forward-neighbor recurrent or state-space layer and regularize its coupling so selected discrete Fourier modes are contracting while task-critical modes remain weakly damped. The paper's exact mode factors make instability falsifiable: a mode becomes unstable when its scalar factor changes sign, producing a measurable transition rather than a vague smoothness prior.

Formulas

$$\dot\theta_i=\omega+\kappa\sum_{\ell=1}^{m}\sin(\theta_{i+\ell}-\theta_i),\qquad \phi_i=\frac{2\pi q i}{N}$$
$$u_i^{(k)}=\exp\left(\frac{2\pi\mathrm{i}ki}{N}\right),\qquad \mu_k(q)=\sum_{\ell=1}^{m}\cos\left(\frac{2\pi q\ell}{N}\right)\left[1-\cos\left(\frac{2\pi k\ell}{N}\right)\right]$$
$$\delta_k(t)\approx\delta_k(0)\exp[-\kappa\mu_k(q)t]\exp(\mathrm{i}\nu_k t)$$
$$\mu_{k_*}(q)<0\ \Longrightarrow\ |\delta_{k_*}(t)|\propto\exp[\kappa|\mu_{k_*}(q)|t]$$

Mathematical statement

Consider \(N\) cyclic units with forward-neighbor dynamics \(\dot\theta_i=\omega+\kappa\sum_{\ell=1}^{m}\sin(\theta_{i+\ell}-\theta_i)\), with indices modulo \(N\). A \(q\)-twisted profile is \(\phi_i=2\pi qi/N\). Linearization around this profile is diagonalized by Fourier vectors \(u_i^{(k)}=\exp(2\pi\mathrm{i}ki/N)\). Define \(\mu_k(q)=\sum_{\ell=1}^{m}\cos(2\pi q\ell/N)[1-\cos(2\pi k\ell/N)]\). The global phase mode has \(\mu_0=0\). Apart from an imaginary advection term, mode \(k\) decays at rate \(-\kappa\mu_k(q)\). Stability modulo global phase requires \(\mu_k(q)>0\) for all \(k=1,\ldots,N-1\); any negative factor gives an exponentially growing perturbation.

Implementation notes

Implement a cyclic state-space or recurrent layer with \(N\) channels and \(m\) forward shifts. For the phase version, update \(\theta_i^{t+1}=\theta_i^t+h[\omega+\kappa\sum_{\ell=1}^{m}\sin(\theta_{i+\ell}^t-\theta_i^t)]\). For a real-valued SSM, use the corresponding circulant shift matrix and either a sinusoidal interaction or its Jacobian approximation. At initialization and after optimizer steps, compute the analytic factors \(\mu_k(q)\). If the shift weights are learnable, replace each unit coefficient by its learned value \(a_\ell\), giving \(\mu_k=\sum_\ell a_\ell\cos(2\pi q\ell/N)[1-\cos(2\pi k\ell/N)]\). Add a barrier \(\lambda\sum_{k\in K}\operatorname{softplus}(\epsilon-\mu_k)^2\) for modes that must contract, or target an interval \([\mu_{\min},\mu_{\max}]\) to balance stability and memory. The formula is computed exactly from the layer parameters; nonlinear Jacobians and finite-step corrections should be estimated empirically. First test copy-memory and delayed sine prediction with \(N=32\), \(m\in\{1,2,4,8\}\), comparing unconstrained and Fourier-shaped circulant layers. Inject a small perturbation independently in each Fourier mode and fit its log-amplitude slope. The quantitative prediction is slope \(-\kappa\mu_k\) for small timestep and perturbation. The observed stability boundary should be within 20 percent of the analytic zero crossing \(\mu_k=0\). Negative factors must produce exponential growth, while all-positive factors must produce decay except for the neutral global phase mode.

Verification

Beats tuned baseline

Stage 1 · Toy mechanism gate: Passed ✓

Stage 2 · Mechanism transferred to benchmark: Not reproduced ✗

Stage 2 · Practical benchmark result: Significant win ✓

Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works

How to read this: The implementation beat the baseline, but the claimed mechanism did not reproduce at benchmark scale. The gain may come from another effect; treat the cause as unresolved.

Stage 1 — Mechanism check agent confidence 9/10

Built an exact Fourier-mode stability module for cyclic phase dynamics with analytic factors, complex Jacobian eigenvalues, perturbation simulation, and bounded weight shaping. Measured growth rates matched -kappa*mu within 0.31%, coupling scaling was linear, the explicit-Euler stability boundary matched within 1.25%, and a negative factor produced the predicted exponential growth within 0.014%. Fourier shaping changed an unstable mode from mu=-0.194879 and growth slope +0.194905 to mu=+0.113278 and slope -0.113170, reducing the 1000-step amplitude ratio from 1.2152 to 0.8930.

Agent confidence
9/10
Baseline
q=3, mode=1, uniform weights: mu=-0.194879, observed slope=+0.194905, amplitude ratio=1.2152
Idea
q=3, mode=1, shaped weights [1.1092, 1.1991, 0.7752, -0.4158]: mu=+0.113278, observed slope=-0.113170, amplitude ratio=0.8930; analytic Euler hcrit=0.345107 versus observed 0.349421

Limitations: This MVP tests phase-ring dynamics and perturbation stability, not a trained copy-memory or delayed-sine neural task. Weight shaping uses offline bounded optimization rather than an integrated optimizer barrier during end-to-end training, and the finite-step boundary was estimated on a grid.

How to run: python3 fourier_stability.py

Stage 2 — Benchmark vs. tuned baseline (arXiv:2608.29630)

Beats the tuned baseline by 0.2% (p=0.0081, wins 8 / 8 paired seeds; metric: lower is better).

Benchmark
Dynamics forecasting
Model
cyclic_rnn
Paired seeds
8
Baseline mean
0.0041
Idea mean
0
Effect (Δ)
-0 (−0.2%; negative = idea better)
Wins
8 / 8 paired seeds
p-value
0.0081 (permutation test, 20 000 shuffles)
Smallest detectable effect
n/a
Mechanism
Not confirmed ✗
Practical effect
Helps
Baseline tuning
swept over 3 configs
Limitations:

Only the built-in dynamics pendulum track was tested; no sequence copy-memory task, larger hidden sizes, alternative q profiles, explicit unstable-mode training, or longer horizons were evaluated. The mechanism probe used a simplified zero-input perturbation around the trained recurrent state rather than the full task trajectory Jacobian.

How to run: python3 stage2_fourier_bench.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Stage 2 — Benchmark latest Worked ✓

Agent confidence: 8/10

Built a cyclic recurrent dynamics model with Fourier-mode barrier regularization and compared it against the identical model without the barrier. The idea was better on all 8 paired seeds with delta_mean=-6.57e-06 and permutation p=0.0081, satisfying the benchmark's significant-win criterion, although the relative improvement was only about 0.16%. The trained-model signature was not confirmed: observed slopes differed from -kappa*mu by up to 56.8%, plausibly due to the finite discrete update and tanh Jacobian.

Baseline best cfg
map[lr:0.01 weight_decay:0]
Baseline mean mse
0.004087189445272088
Delta mean
-6.566086085513234e-06
Idea best cfg
map[lr:0.01 weight_decay:0]
Idea mean mse
0.004080623359186575
Idea wins
8
Mechanism max relative error
0.5679249704438308
Mechanism signature confirmed
false
N pairs
8
P value
0.0081

Benchmark result

Beats the tuned baseline by 0.2% (p=0.0081, wins 8 / 8 paired seeds; metric: lower is better).

Benchmark
Dynamics forecasting
Model
cyclic_rnn
Paired seeds
8
Baseline mean
0.0041
Idea mean
0
Effect (Δ)
-0 (−0.2%; negative = idea better)
Wins
8 / 8 paired seeds
p-value
0.0081 (permutation test, 20 000 shuffles)
Smallest detectable effect
n/a
Mechanism
Not confirmed ✗
Practical effect
Helps
Baseline tuning
swept over 3 configs
Limitations:

Only the built-in dynamics pendulum track was tested; no sequence copy-memory task, larger hidden sizes, alternative q profiles, explicit unstable-mode training, or longer horizons were evaluated. The mechanism probe used a simplified zero-input perturbation around the trained recurrent state rather than the full task trajectory Jacobian.

How to run: python3 stage2_fourier_bench.py

Artifacts

Implementation overview ⬇ Download all as ZIP 6 files · code, reports and structured results