Controlled SA-NODEs uniformly approximate trajectories of nonlinear controlled systems on compact sets and preserve approximate controllability, with error O(P^{-1/2} + Q^{-1/2}) under Sobolev and Barron regularity.
Constructive interpolation and generalization rates for neural ODEs: a control perspective
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
We study supervised regression with neural ODEs (NODEs) from a control-theoretic perspective to derive explicit population-risk bounds. We focus on a widely used class of non-autonomous models with constant parameters and explicit time dependence, which we call semi-autonomous NODEs (SA-NODEs). We constructively prove that SA-NODEs are capable of \emph{exact} interpolation of admissible finite datasets, and even satisfy a stronger property that we call \emph{simultaneous cell controllability} (SCC): their flows can map prescribed disjoint cells into arbitrarily small target balls. This property is the mechanism that upgrades interpolation into quantitative generalization, by allowing SA-NODEs to emulate piecewise-constant nonparametric estimators. Consequently, our risk bounds recover the rates of histogram and nearest-neighbor estimators, provided the network width satisfies a conservative scaling with the sample size. Numerical experiments show that trained SA-NODEs achieve competitive -- often lower -- test errors than these baselines. Finally, we show that the explicit time dependence is essential. Although two-layer autonomous NODEs can interpolate geometrically nondegenerate datasets, structural obstructions prevent them from achieving SCC. These limitations, further confirmed numerically, support the view that SA-NODEs provide a minimal effective architecture for learning.
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proves exponential turnpike and one-sided sparsity for L1-regularized optimal control of SA-NODEs, confirmed numerically on oscillators with 30x parameter reduction.
citing papers explorer
-
Approximation and Controllability of Nonlinear Control-Affine Systems via Semiautonomous Neural Ordinary Differential Equations
Controlled SA-NODEs uniformly approximate trajectories of nonlinear controlled systems on compact sets and preserve approximate controllability, with error O(P^{-1/2} + Q^{-1/2}) under Sobolev and Barron regularity.
-
Turnpike and Sparse Optimal Control for Semiautonomous Neural ODEs
Proves exponential turnpike and one-sided sparsity for L1-regularized optimal control of SA-NODEs, confirmed numerically on oscillators with 30x parameter reduction.