Skip to content
AI News HubLIVE
Original source2 min read

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

Summary

This research explores when conservation laws remain certifiable after a physical world model learns a latent representation. The authors introduce 'certified horizons' that bound how many rollout steps provably stay on an invariant's level set. Instead of certifying learned latent Hamiltonians, they certify decoded physical invariants. The framework decomposes certification budgets into representation, readout, and latent-dynamics defects, using a monotone alignment bridge for soft witnesses. Results show hard symplectic structure provides long horizons in known coordinates but fails across learned charts, while controlled-Lipschitz soft invariants survive representation learning. Pixel certification is recovered on readout-stable sub-tubes.

SourcearXiv Machine LearningAuthor: Hongbo Wang
When Do Conservation Laws Survive Learned Representations? Certified Horizons for Latent World Models
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

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

[Submitted on 23 Jun 2026]

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

View a PDF of the paper titled When Do Conservation Laws Survive Learned Representations? Certified Horizons for Latent World Models, by Hongbo Wang

View PDF HTML (experimental)

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.

Comments: 15 pages, including appendices. Code: this https URL

Subjects:

Machine Learning (cs.LG); Robotics (cs.RO)

Cite as: arXiv:2606.24945 [cs.LG]

(or arXiv:2606.24945v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2606.24945

arXiv-issued DOI via DataCite

Submission history

From: Hongbo Wang [view email] [v1] Tue, 23 Jun 2026 06:44:02 UTC (878 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled When Do Conservation Laws Survive Learned Representations? Certified Horizons for Latent World Models, by Hongbo Wang

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.LG

new | recent | 2026-06

Change to browse by:

cs cs.RO

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Introduces 'certified horizons' for guaranteeing conservation law preservation in latent world models
  • Certifies decoded physical invariants rather than learned latent quantities
  • Finds hard symplectic structure excels in known coordinates but fails with learned charts; soft invariants perform better under representation learning
  • Pixel certification is possible under certain conditions; Kepler problem reveals geometric boundaries

Highlights and analysis are generated automatically and may contain errors. Check the original source.