Finite Sample Identification of Analytic Nonlinear Systems
arXiv:2608.29908
2026
Theory
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper's key mechanism is that real-analytic feature maps make passive, non-active exploration sufficient for finite-sample identification, whereas merely smooth or piecewise-affine features can remain indistinguishable on the visited region. The transferable asset is an identifiability certificate based on the feature Gram matrix: passive trajectories should eventually produce a nonsingular Gram matrix because a nonzero analytic feature combination cannot vanish on an open set without vanishing globally. For neural state-space models and world models, this suggests using analytic feature bases or analytic adapters together with a Gram-conditioning monitor and an exploration/data-collection schedule that stops only after the smallest Gram eigenvalue crosses a target threshold.
Ideas from this paper
Unverified
2026
Train a neural state-space model whose one-step dynamics are linear in a fixed analytic feature vector, and use the empirical feature Gram matrix to detect whether passive trajectories identify the dynamics. Add data collection or replay only when the Gram matrix is poorly conditioned; the analytic-feature assumption predicts that persistent excitation should emerge without deliberately visiting every operating mode.
Useful6/10
Difficulty5/10
Novelty7/10