TSR Desk · physics · 16 September 2026, 01:00 UTC
Diagnosing Faults in Reinforcement Learning Simulators and World Models with Canonical
- What
- Diagnosing Faults in Reinforcement Learning Simulators and World Models with Canonical Polynomial Invariants
- Who
- arxiv.org
- When
- 15 September 2026, 04:00 UTC
- Category
- Physics
- Primary source
- https://arxiv.org/abs/2609.13194
- What is not known
- This brief does not claim independent replication. Claims that appear only on X and not in the primary source stay unknown.
We test that premise using exact polynomial invariants recovered from trajectories and canonicalised as reduced Gr\"obner bases over $\mathbb{Q}$. It comes from a paper posted to arXiv on 15 September 2026. A large literature builds physical structure into learned dynamics on the premise that models respecting the underlying physics predict better. On Acrobot, exactness provides little benefit for prediction: a consistency regulariser reduces algebraic residual while leaving rollout fidelity essentially unchanged, and a shaping potential recovered from a system with a 100% mass error accelerates learning as effectively as the correct potential. Exact canonical invariants instead prove valuable for diagnosis. We develop two procedures: screening, which identifies the violated physical constraint, and attribution, which recovers the faulty invariant and identifies the responsible physical parameter. To enable this, we introduce normal-form deflation and quotient-space recovery. Across fifteen injected faults, screening localises every broken constraint with no false alarms, whereas observation-space baselines do not localise any; attribution recovers the responsible parameter on all seven parameter faults. Paired difference tests detect all faults, showing that the advantage is localisation rather than detection. Perturbing reference generators by $10^{-4}$ preserves 14--15/15 localisations, showing that screening does not require exactness, whereas ideal-equality decisions distinguish perturbations of only $10^{-12}$, showing that exactness is required for algebraic comparison. Applied to 350 release pairs across eleven RL environments, the diagnostic finds no evidence of changed simulator dynamics, instead revealing properties of the benchmark implementations themselves.
Why it counts
We test that premise using exact polynomial invariants recovered from trajectories and canonicalised as reduced Gr\"obner bases over $\mathbb{Q}$. On Acrobot, exactness provides little benefit for prediction: a consistency regulariser reduces algebraic residual while leaving rollout fidelity essentially unchanged, and a shaping potential recovered from a system with a 100% mass error accelerates learning as effectively as the correct potential.
Sources
Primary source: primary source
What is not known
This brief does not claim independent replication. Claims that appear only on X and not in the primary source stay unknown.
No clip. The article still stands.