arXiv Machine Learning

Finite-Sample Metric Non-Collapse for Geometrically Supervised Latent World Models in Control

The paper presents a finite‑sample learning‑to‑control framework for geometrically supervised latent models of nonlinear deterministic systems. It introduces an encoder‑only local–global metric hinge that ensures directional resolution and state discrimination, and proves that any approximate empirical minimizer is pointwise co‑Lipschitz and uniformly approximately semiconjugate to the true dynamics under regularity assumptions. The results provide explicit bounds on approximation, sampling, and optimization errors, and demonstrate through controlled experiments that restoring metric resolution improves control performance.

arXiv Machine Learning
Jul 14

A Control Theory of Predictability in Latent World Models

arXiv:2607. 10362v1 Announce Type: new Abstract: Latent world models are trained to predict future states in a learned representation and are then deployed inside a planner that selects actions by simulating them forward.

By Hanzhe You, Yonggang Zhang, Maohao Ran, Zhiqin Yang, Zhenyuan Zhang, Wei Xue, Jun Song, Xinmei Tian, Yike Guo
arXiv Machine Learning
Jun 2

Graph Transfer Learning via Shared Latent Geometry: Theory and Applications

arXiv:2606. 00716v1 Announce Type: new Abstract: Inference and control in engineered physical systems pay a heavy physics cost at deployment: state estimators, inverse-problem solvers, model-predictive controllers, schedulers, and observers are often not closed-form and must re-solve a numerical optimization per instance, with the operator re-supplied each time.

By Tong Wu, Andrew Campbell, Anna Scaglione
arXiv Machine Learning
Jul 27

On the Identifiability of Controlled World Models

arXiv:2607. 22430v1 Announce Type: new Abstract: Learning world models that infer environment dynamics from high-dimensional observations and predict outcomes under candidate actions is central to planning and control.

By Xiangteng Zhang, Yang Guan, Bo Zhang, Ya-Qin Zhang, Shengbo Eben Li
arXiv Machine Learning
Jun 29

PAC-Bayesian Certificates for Quadratic Closed-Loop Control

arXiv:2606. 28281v1 Announce Type: cross Abstract: PAC-Bayesian bounds provide finite-sample guarantees for data-dependent randomized predictors, but applying them to learning-based control is difficult because the natural objective is a quadratic trajectory cost.

By Domagoj Herceg