cd /news/machine-learning/when-do-conservation-laws-survive-le… · home topics machine-learning article
[ARTICLE · art-38812] src=arxiv.org ↗ pub= topic=machine-learning verified=true sentiment=· neutral

When Do Conservation Laws Survive Learned Representations? Certified Horizons for Latent World Models

Researchers at arXiv propose a method to certify conservation laws in learned latent world models by decoding physical invariants from latent states. They derive shell-horizon certificates that decompose into representation, readout, and latent-dynamics defects, and test them on conservative systems. The approach shows that conservation certificates can survive learned representations, but geometric priors like symplectic structure do not transfer across learned charts, while soft Lipschitz-aligned invariants perform better.

read1 min views1 publishedJun 25, 2026

arXiv:2606.24945v1 Announce Type: new Abstract: We ask a representation-learning question about physical world models: when does a conservation law remain certifiable after a model learns a latent representation? A certified horizon bounds -- in advance, from measurable model defects -- how many steps a rollout provably stays on a physical invariant's level set. The key design choice is what is certified: not a learned latent Hamiltonian or a learned scalar witness (a model can conserve either while drifting in true energy), but the decoded physical invariant obtained by decoding the latent state and evaluating the known invariant. Around this object we derive shell-horizon certificates whose budget decomposes into representation, readout, and latent-dynamics defects, with a monotone alignment bridge through which a soft learned witness yields a certified horizon for the decoded invariant, and test them across state, learned-lift, and pixel observations on conservative systems. Conservation certificates can survive learned representation, but not all geometric priors survive equally: hard canonical symplectic structure yields the longest horizons in known phase coordinates yet does not cross a learned chart, whereas a controlled-Lipschitz-aligned soft invariant survives in the learned-representation settings we test; pixel certification is recovered on a readout-stable sub-tube; and the Kepler problem exposes a geometric boundary. The central object is therefore not a latent Hamiltonian, but a decoded physical invariant whose robustness to representation learning can be measured, certified, and falsified.

── more in #machine-learning 4 stories · sorted by recency
── more on @arxiv 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/when-do-conservation…] indexed:0 read:1min 2026-06-25 ·