Metric Non-Collapse in Learned World Models for Control: Approximation Theory, Finite-Sample Geometric Guarantees, and Deterministic Planning Transfer
Abstract
We develop a three-part mathematical theory for metrically faithful learned world models for nonlinear deterministic control systems. First, on the approximation-theoretic side, we construct smooth exact latent realizations and verify the required finite-capacity $C^{1,1}$ approximation property for norm-constrained tensor-product B-spline classes with capacity-independent regularity budgets. Second, on the finite-sample geometric side, we introduce an encoder-only local--global metric hinge whose directional and separated-pair terms prevent infinitesimal collapse and global folding. Although the prediction loss is observation-based, evaluation of this penalty uses state-metric supervision through observable-state distances and tangent directions. Under a regular observable-factor assumption, lower-Ahlfors coverage, and uniform $C^{1,1}$ budgets, provided the explicit finite-sample deviation lies below the metric-margin threshold, every approximate empirical minimizer above a computable one-sided regularization threshold is pointwise co-Lipschitz and satisfies a uniform approximate controlled-semiconjugacy estimate, with approximation, statistical, and training-optimization errors kept separate. The $L^2$-to-$L^\infty$ exponent used in this step is sharp under Lipschitz regularity. Third, for deterministic planning transfer, metric non-collapse induces compatible Lipschitz latent costs, while semiconjugacy gives uniform trajectory and finite-horizon cost bounds and an optimizer-transfer guarantee; learned latent cost heads enter through explicit compatibility errors. Numerical experiments use bounded latent ranges, archived fixed metric samples, a finite-capacity coefficient-box spline proxy motivated by the theorem, and latent model-predictive control on a controlled pendulum.
Disclosure
“ult is therefore the complete objective-to-geometry-to-dynamics-to-control implication, not a broad priority claim about the importance of latent geometry for planning. Declaration on the use of AI tools AI tools were used for language editing, code review, and manuscript organization. The authors assume responsibility for all content. References [1] R. S. Sutton. Dyna, an integrated architecture for”
PDF page 71
- Classification
- Code generation, completion, or debugging
- Multiplier
- 2
- Verified
Structural counts
Count notes
- Source counts use the expanded primary TeX file main.tex.
- Appendix pages include the first PDF page with an explicit Appendix heading through the final page.