✗ Failed on benchmark 2026

Commutant-Gap Controlled Stochastic Training

Implementation & benchmark of arXiv:2608.11297 — Geometry of Noisy Quantum Many-Body Dynamics with Continuous Symmetries: Entanglement and Correlations

Usefulness7/10
Difficulty6/10
Novelty7/10

Source paper: Geometry of Noisy Quantum Many-Body Dynamics with Continuous Symmetries: Entanglement and Correlations arXiv:2608.11297 ⓘ · analyzed Sep 1, 2026

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

Idea description

Replace unconstrained parameter or hidden-state noise by Brownian perturbations generated by symmetry-preserving directions, then monitor the effective replica generator on k copies of the hidden representation. The smallest nonzero eigenvalue of this generator is a measurable relaxation gap: maintain it above a target to avoid frozen symmetry sectors, while reducing noise when the gap collapses. This transfers the paper's symmetry-controlled low-energy geometry into an optimizer and recurrent-network stability controller.

Formulas

$$H(t)=\sum_{\alpha}J_{\alpha}(t)h_{\alpha},\qquad \mathbb{E}[J_{\alpha}(t)J_{\beta}(t')]=2\kappa\,\delta_{\alpha\beta}\delta(t-t')$$
$$\overline{U(t)}=e^{-\kappa P t},\qquad P=\sum_{\alpha}h_{\alpha}^{2}\succeq 0$$
$$\mathcal{C}_k=\{X:[X,T_a^{(k)}]=0\ \forall a\},\qquad T_a^{(k)}=\sum_{r=1}^{k}I^{\otimes(r-1)}\otimes T_a\otimes I^{\otimes(k-r)}$$
$$\Delta_k=\lambda_{\min}^{+}\!\left(P_k\big|_{\mathcal{C}_k^{\perp}}\right),\qquad \|e^{-\kappa P_k t}(I-\Pi_k)\|_2\le e^{-\kappa\Delta_k t}$$

Mathematical statement

The paper models noisy dynamics as H(t)=sum_alpha J_alpha(t)h_alpha, with independent zero-mean white noises satisfying E[J_alpha(t)J_beta(t')]=2 kappa delta_alpha,beta delta(t-t'). Averaging gives Ubar(t)=exp(-kappa P t), where P=sum_alpha h_alpha squared is positive semidefinite. For neural-network hidden states z in R^d with continuous symmetry generators T_a, define the k-replica generator T_a^(k)=sum_r I tensor ... tensor T_a tensor ... tensor I. The k-commutant is C_k={X:[X,T_a^(k)]=0 for every a}. If P_k is the empirical replica noise generator and Pi_k projects onto C_k, define Delta_k=lambda_min^+(P_k restricted to C_k perpendicular). The non-commutant component then obeys the contraction bound ||exp(-kappa P_k t)(I-Pi_k)||_2 <= exp(-kappa Delta_k t). Thus Delta_k predicts the slowest symmetry-compatible relaxation rate.

Implementation notes

Use a residual RNN or linear state-space model with paired hidden coordinates and a known SO(2) rotation symmetry, for example z_{t+1}=z_t+eta f_theta(z_t,x_t). Parameterize stochastic perturbations as delta f=sum_alpha xi_alpha h_alpha(z), where each h_alpha commutes with the rotation generator T. Maintain k independent hidden replicas during training. At every M optimizer steps, estimate the covariance of replica feature increments and assemble an empirical positive-semidefinite generator P_k. Compute a null-space basis for matrices X satisfying [X,T_a^(k)]=0 using SVD, project P_k onto the orthogonal complement, and estimate Delta_k by the smallest positive eigenvalue. Sample xi_alpha from N(0,2 kappa Delta_t), and update theta with the ordinary gradient plus this symmetry-preserving perturbation. If Delta_k falls below a target, halve kappa and optionally reduce eta; otherwise slowly restore kappa. The paper supplies the Brownian averaging and gap mechanism; P_k and Delta_k are estimated from minibatch trajectories. First test a 32-unit equivariant residual RNN on sequential MNIST and a rotating-signal prediction task against SGD and fixed-noise SGD. The predicted signature is perturbation decay exp(-kappa Delta_k t), with fitted decay rate within 20% of kappa Delta_k; long-horizon error should increase sharply as Delta_k approaches zero.

Verification

Failed on benchmark

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 a reproducible commutant-gap experiment with exact SO(2) two-replica commutant projection, PSD generator construction, gap scaling sweeps, and a small symmetry-preserving noisy regression controller. The mechanism manifested: fitted decay rates matched kappa*Lambda within 2.1e-15 relative error, half-lives matched within 1.0%, and the Lambda=0 case showed no decay while commutant directions remained unchanged. In toy training, gap control reduced final loss versus fixed noise (0.0078646 vs 0.015729) but did not beat noiseless SGD (1.46e-31), so this validates the mechanism rather than demonstrating a general optimization win.

Agent confidence
9/10
Baseline
Noiseless SGD final 100-step mean loss = 1.46e-31; fixed symmetry-preserving noise = 0.015729
Idea
Gap-controlled noise final 100-step mean loss = 0.0078646; best loss = 1.02e-05; mean final kappa = 0.0125; math sweep rate relative error <= 2.1e-15 and half-life relative error <= 0.99%

Limitations: Only a low-dimensional analytic SO(2) toy and equivariant linear regression were tested; no sequential MNIST, nonlinear 32-unit RNN, minibatch empirical replica-generator estimation, CUDA run, or generalization evaluation was performed. The training controller uses a prescribed synthetic gap schedule rather than estimating Delta_k from trajectories.

How to run: python3 commutant_gap_experiment.py

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

Ahead of the baseline (−5.0%) but not statistically significant (p=0.9317, wins 3 / 8 paired seeds).

Benchmark
Dynamics forecasting
Model
rnn_small
Paired seeds
8
Baseline mean
0.0317
Idea mean
0.0301
Effect (Δ)
-0.0016 (−5.0%; negative = idea better)
Wins
3 / 8 paired seeds
p-value
0.9317 (permutation test, 20 000 shuffles)
Smallest detectable effect
n/a
Mechanism
Not confirmed ✗
Practical effect
Inconclusive
Baseline tuning
swept over 6 configs
Limitations:

The run used 3 epochs and 400 training/400 test examples to fit the runtime budget; the empirical gap was a lightweight covariance proxy rather than a full k-replica commutant SVD.

How to run: python3 bench_commutant_gap.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

The registered dynamics track was run with matched rnn_small systems, a tuned baseline sweep, three idea settings, and 8 paired seeds. The idea had a small lower MSE but no significant win: delta_mean=-0.0015709631 and permutation p_value=0.93175. The mechanism signature was confirmed, but the task-metric verdict remains no significant win.

Baseline
Full 8-seed mean MSE 0.0316817021; tuned lr=0.003, weight_decay=0.0
Idea
Best 8-seed mean MSE 0.0301107391 at lr=0.003, weight_decay=0.0, kappa=0.002; paired delta=-0.0015709631; p=0.93175

Benchmark result

Ahead of the baseline (−5.0%) but not statistically significant (p=0.9317, wins 3 / 8 paired seeds).

Benchmark
Dynamics forecasting
Model
rnn_small
Paired seeds
8
Baseline mean
0.0317
Idea mean
0.0301
Effect (Δ)
-0.0016 (−5.0%; negative = idea better)
Wins
3 / 8 paired seeds
p-value
0.9317 (permutation test, 20 000 shuffles)
Smallest detectable effect
n/a
Mechanism
Not confirmed ✗
Practical effect
Inconclusive
Baseline tuning
swept over 6 configs
Limitations:

The run used 3 epochs and 400 training/400 test examples to fit the runtime budget; the empirical gap was a lightweight covariance proxy rather than a full k-replica commutant SVD.

How to run: python3 bench_commutant_gap.py

Artifacts

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