Orbital-Stable Dancing RNN
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
Construct a recurrent layer whose hidden states evolve as directed phase oscillators with a prescribed nonzero common frequency and fixed phase offsets. Train task-relevant dynamics in the quotient space that removes the global phase-shift direction, so a rotating latent representation is not incorrectly penalized as unstable.
Formulas
Mathematical statement
Let \(z_i=r_i e^{\mathrm{i}\theta_i}\) be the complex hidden unit for node \(i\), and let \(a_{ij}\geq 0\) be a directed coupling weight. The phase dynamics are \(\dot\theta_i=\Omega_i+\kappa\sum_j a_{ij}\sin(\theta_j-\theta_i)\). A dancing equilibrium is \(\theta_i(t)=\omega t+\phi_i\), where the phase offsets satisfy \(\omega=\Omega_i+\kappa\sum_j a_{ij}\sin(\phi_j-\phi_i)\) for every \(i\). The linearization has a neutral global-shift eigenvector \(\mathbf{1}\). If the graph is strongly connected and every active edge has \(|\phi_j-\phi_i|<\pi/2\), the transverse dynamics contract locally. More generally, orbital stability requires every nonzero Jacobian eigenvalue to have negative real part.
Implementation notes
Use this as a recurrent phase layer in an oscillatory RNN or latent world model. Represent each hidden channel by \(z_i=r_i\exp(\mathrm{i}\theta_i)\), keep amplitudes fixed initially, and update phases with Euler integration. At each step compute \(d_{ij}=\theta_j-\theta_i\), then \(v_i=\Omega_i+\kappa\sum_j a_{ij}\sin(d_{ij})\), and finally \(\theta_i\leftarrow\theta_i+h v_i\). Feed \([r_i\cos\theta_i,r_i\sin\theta_i]\) to the task head. Use a strongly connected directed ring with skip edges, parameterizing couplings as \(a_{ij}=\operatorname{softplus}(b_{ij})\). Penalize edge phase differences beyond \(\pi/2\), or initialize offsets \(\phi_i\) with all differences below \(\pi/3\). Estimate the rotating solution by averaging \(v_i\) over time. Compute the Jacobian from the displayed formula, remove its zero phase mode, and log the largest transverse real eigenvalue. The existence and angle condition come from the paper; the learned Jacobian and basin size are empirical. First test a 32-unit model on sequential MNIST and noisy sine-wave prediction against tanh and unconstrained complex RNNs. Sweep \(\kappa\) and timestep \(h\). The predicted signature is a stability boundary when an edge angle crosses \(\pi/2\) or the transverse spectral abscissa reaches zero. Below the boundary, perturbation norms should decay as \(\exp(\alpha t)\), where \(\alpha\) is the largest transverse real eigenvalue.
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.