Infinite-Horizon Sparse Optimal Control: Solution through a Finite-Horizon Subproblem and Its Receding-Horizon Implementation
arXiv:2608.17464
2026
Dynamics
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper gives a constructive reduction of an infinite-horizon L1 sparse-control problem to a finite-horizon problem. Its key mechanism is spectral separation: after the anti-stable component has been eliminated, the remaining stable state decays without further input, so an optimal control has finite support. This can transfer to adaptive-depth recurrent or iterative neural modules by learning sparse residual corrections only while unstable hidden-state components remain. The engineering value is a stopping rule tied to an estimated Jacobian spectrum rather than an arbitrary maximum depth.
Ideas from this paper
Unverified
2026
Represent an iterative neural computation as a controlled dynamical system and learn sparse residual corrections that are active only for a finite prefix of iterations. Estimate local stable and anti-stable subspaces of the hidden-state Jacobian, increase the correction horizon only while the anti-stable component exceeds a tolerance, and force later controls to zero. This produces adaptive-depth inference with a quantitative stopping criterion.
Useful6/10
Difficulty6/10
Novelty7/10