Transverse Synchrony Training
Implementation & benchmark of arXiv:2608.17652 — On the behavior assignment problem
Source paper: On the behavior assignment problem arXiv:2608.17652 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Pair a neural latent dynamical system with a reference latent system driven by the same external input, and train a coupling or controller so that a synchrony residual converges to zero. The target is transverse stabilization of a behavior-equivalence manifold rather than pointwise tracking of one selected trajectory or equilibrium.
Formulas
Mathematical statement
The plant is $\dot{x}=f(x,u,t)$ with output $y=h(x,t)$ and the reference is $\dot{x}^{\star}=f^{\star}(x^{\star},v,t)$ with output $y^{\star}=h^{\star}(x^{\star},t)$. In the paper's normal-form construction, $\epsilon=(\epsilon_1,\ldots,\epsilon_r)$ is a synchrony coordinate measuring the difference between plant and reference coordinates, and the desired manifold is $\mathcal{B}=\{(z,\zeta,\xi,\epsilon,\eta):\epsilon=0\}$. The theorem gives behavior assignment when this manifold is asymptotically stable. For a neural implementation, $J_{\perp}$ is the Jacobian of the closed-loop dynamics with respect to perturbations transverse to $\mathcal{B}$, and the largest transverse Lyapunov exponent must satisfy $\lambda_{\perp}<0$. This predicts local exponential decay $\|\epsilon(t)\|\leq C\exp(\lambda_{\perp}t)\|\epsilon(0)\|$.
Implementation notes
1. Integration point: use a continuous-time latent RNN, neural ODE, or discrete state-space model as the plant, with latent state $z_t$ and dynamics $z_{t+1}=F_\theta(z_t,u_t,v_t)$. Use a fixed or separately trained reference model $\zeta_{t+1}=F_{\mathrm{ref}}(\zeta_t,v_t)$. A controller produces $u_t=\pi_\phi(z_t,\zeta_t,v_t)$, and a synchrony residual is defined as $\epsilon_t=P(z_t)-P_\star(\zeta_t)$ for matched projections $P$ and $P_\star$. 2. Pseudocode: initialize $z_0$ and $\zeta_0$ independently; for each input $v_t$, compute $\zeta_{t+1}=F_{\mathrm{ref}}(\zeta_t,v_t)$, compute $\epsilon_t=P(z_t)-P_\star(\zeta_t)$, set $u_t=\pi_\phi(z_t,\zeta_t,v_t)$, and update $z_{t+1}=F_\theta(z_t,u_t,v_t)$. Optimize $L=L_{\mathrm{task}}+\alpha\sum_t\|\epsilon_t\|^2+\beta\sum_t\max(0,\widehat\lambda_{\perp,t}+\gamma)^2$, where $\gamma>0$ is a desired stability margin. 3. The paper supplies the invariant-manifold criterion $\epsilon=0$ and the requirement of asymptotic stability. Compute $\widehat\lambda_\perp$ empirically using automatic-differentiation Jacobian-vector products along the rollout, QR reorthogonalization, and perturbations restricted to the residual coordinates. 4. First cheap experiment: train a GRU or neural ODE on randomly forced Duffing or pendulum trajectories, comparing ordinary MSE with synchrony training. Initialize replicas near different equilibria and sweep coupling gain. The prediction is a sharp transition: when $\widehat\lambda_\perp>0$, residuals persist or diverge; when $\widehat\lambda_\perp<0$, residuals decay exponentially, with measured log-residual slope approximately equal to $\widehat\lambda_\perp$. Verify the predicted boundary within 20 percent by locating the gain where the exponent crosses zero.
Verification
Stage 1 · Toy mechanism gate: Passed ✓
Stage 2 · Mechanism transferred to benchmark: Not reproduced ✗
Stage 2 · Practical benchmark result: Inconclusive
Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works
Stage 1 — Mechanism check agent confidence 9/10
Built and ran a deterministic transverse-synchrony toy system with shared forcing, analytic transverse multiplier a-k, numerical exponent fitting, parameter sweeps, and a small torch controller comparison. The predicted stability boundary k*=a-1=0.15 was observed at 0.14875 (error 0.00125), stability classification agreement was 100%, and measured log-residual slopes matched the analytic transverse exponent with maximum absolute error 0.00076. The mechanism manifested clearly, but the synchrony-trained controller did not beat the task-only baseline because this toy task loss is itself the synchrony residual.
- Agent confidence
- 9/10
- Baseline
- final k=0.28862; test tail MSE=2.2581e-7
- Idea
- final k=0.28862; test tail MSE=2.2581e-7; identical task performance
- Mechanism checks
- boundary predicted 0.15 vs observed 0.14875; classification agreement 1.0; maximum exponent-slope error 0.00076; gain multipliers exactly matched at k=0.2, 0.3, 0.4, 0.5
Limitations: The experiment is a scalar linear discrete-time system rather than a nonlinear GRU/neural ODE or Duffing/pendulum model. It does not test behavior equivalence beyond shared-input state synchronization, learned transverse Jacobian penalties, continuous-time QR Lyapunov estimation, noise robustness, or a meaningful task objective distinct from synchrony.
How to run: python3 transverse_sync_experiment.py
Stage 2 — Benchmark vs. tuned baseline (arXiv:2608.17652)
Ahead of the baseline (−30.0%) but not statistically significant (p=0.1057, wins 7 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.0034
- Idea mean
- 0.0024
- Effect (Δ)
- -0.001 (−30.0%; negative = idea better)
- Wins
- 7 / 8 paired seeds
- p-value
- 0.1057 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±35.1%
- Mechanism
- Not confirmed ✗
- Practical effect
- Inconclusive
- Baseline tuning
- swept over 3 configs
The prescribed README path was absent, although the bench package and registered dynamics track were available. The experiment used 10 epochs, 400 training samples, one recurrent architecture, and an MVP fixed reference latent system; it did not compute a full QR transverse Lyapunov exponent.
How to run: python3 stage2_bench.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
Transverse Synchrony Training was evaluated on the registered actuated-pendulum dynamics track using matched rnn_small systems, a tuned baseline sweep, and a three-setting idea sweep. The idea reduced mean test MSE from 0.00341626 to 0.00239230 and won 7 of 8 pairs, but the paired permutation p-value was 0.1057, so there was no significant win. The scalar stability check passed, while the trained-model residual signature was not confirmed because the residual ratio was 2.5987 rather than below 1.
- Baseline
- lr=0.01, epochs=10; mean test MSE=0.003416259671212174
- Comparison
- delta_mean=-0.0010239568437100388; idea_wins=7/8; p_value=0.1057; verdict=no significant win
- Idea
- lr=0.01, k=0.2, epochs=10; mean test MSE=0.002392302827502135
Benchmark result
Ahead of the baseline (−30.0%) but not statistically significant (p=0.1057, wins 7 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.0034
- Idea mean
- 0.0024
- Effect (Δ)
- -0.001 (−30.0%; negative = idea better)
- Wins
- 7 / 8 paired seeds
- p-value
- 0.1057 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±35.1%
- Mechanism
- Not confirmed ✗
- Practical effect
- Inconclusive
- Baseline tuning
- swept over 3 configs
The prescribed README path was absent, although the bench package and registered dynamics track were available. The experiment used 10 epochs, 400 training samples, one recurrent architecture, and an MVP fixed reference latent system; it did not compute a full QR transverse Lyapunov exponent.
How to run: python3 stage2_bench.py
Artifacts
- bench_report.json 6.5 KB View Raw
- report.md 1.6 KB View
- report_bench_2026-09-01T163825.md 7.3 KB View
- results.json 38.5 KB View Raw
- stage2_bench.py 5.9 KB View Raw
- transverse_sync_experiment.py 5.7 KB View Raw