aiqbench analysis
This research provides a rigorous theoretical framework for training State-Space Models (SSMs) by mapping their optimization dynamics to an ensemble optimal control problem. By establishing conditions for relative convexity and uniqueness of minimizers, the study offers critical mathematical insights into the convergence guarantees of these architectures. Such foundational work is essential for advancing the stability and efficiency of next-generation sequential modeling systems.
State-space models through the lens of ensemble control
arXiv:2603.13587v2 Announce Type: replace-cross Abstract: State-space models (SSMs) are effective architectures for sequential modeling, but a rigorous theoretical understanding of their training dynamics is still lacking. We formulate continuous-time SSM parameter-path optimization as an ensemble optimal control problem: each input sequence generates a corresponding state trajectory in the ensemble, while the trainable parameter path forms a common control shared by all trajectories. Within this formulation, model evaluation is represented by the forward state equation and backward sensitivity propagation by the corresponding adjoint equation. We show that the Hamiltonian gradient with respect to the control variable represents the negative first-variation density of the reduced ensemble objective. Using this representation, we analyze a Bregman mirror-descent scheme for the continuous-time ensemble objective; in Euclidean geometry this reduces to functional projected gradient descent. State-adjoint and Hamiltonian-gradient stability yield two-sided relative curvature of the reduced objective and relative convexity under sufficient regularization. We further show that in the relatively convex regime the optimal-control problem admits a minimizer, which is unique under relative strong convexity. For SSMs, the explicit stability-generated defect $\kappa_{\mathrm{stab}}^{\mathrm{SSM}}$ gives an $O(1/k)$ objective rate at $\tau=\kappa_{\mathrm{stab}}^{\mathrm{SSM}}$ and geometric convergence to the unique minimizer for $\tau>\kappa_{\mathrm{stab}}^{\mathrm{SSM}}$, under the stated stepsize condition.
Abstract:State-space models (SSMs) are effective architectures for sequential modeling, but a rigorous theoretical understanding of their training dynamics is still lacking. We formulate continuous-time SSM parameter-path optimization as an ensemble optimal control problem: each input sequence generates a corresponding state trajectory in the ensemble, while the trainable parameter path forms a common control shared by all trajectories. Within this formulation, model evaluation is represented by the forward state equation and backward sensitivity propagation by the corresponding adjoint equation. We show that the Hamiltonian gradient with respect to the control variable represents the negative first-variation density of the reduced ensemble objective. Using this representation, we analyze a Bregman mirror-descent scheme for the continuous-time ensemble objective; in Euclidean geometry this reduces to functional projected gradient descent. State-adjoint and Hamiltonian-gradient stability yield two-sided relative curvature of the reduced objective and relative convexity under sufficient regularization. We further show that in the relatively convex regime the optimal-control problem admits a minimizer, which is unique under relative strong convexity. For SSMs, the explicit stability-generated defect $\kappa_{\mathrm{stab}}^{\mathrm{SSM}}$ gives an $O(1/k)$ objective rate at $\tau=\kappa_{\mathrm{stab}}^{\mathrm{SSM}}$ and geometric convergence to the unique minimizer for $\tau>\kappa_{\mathrm{stab}}^{\mathrm{SSM}}$, under the stated stepsize condition.
Optimization and Control (math.OC); Machine Learning (cs.LG)
arXiv:2603.13587 [math.OC]
(or arXiv:2603.13587v2 [math.OC] for this version)
https://doi.org/10.48550/arXiv.2603.13587 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 288 words
Related coverage
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · Sep 18, 2026
Links #5: 2026/07
LessWrong · Jul 31, 2026

Chaotic quantum system learns data with simple controls
Quantum Zeitgeist · Oct 13, 2026

Game-Theoretic Disempowerment: Loss of Control to Agencyless AI
LessWrong · Sep 27, 2026