OpenAlex ·
Minimal Experiments for Robust Stabilization: Information, Spectral Geometry, and Duration
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.02187
- Original
- Read it at the publisher
- Topics
Abstract
On broad classes of linear systems, the shortest experiments are almost as good as the best possible ones. For $n$ states and $m$ inputs, the shortest input sequences that support robust data-driven stabilization of every controllable plant have $mn+1$ steps with exact states and $m(n+1)$ with noisy states. We show that, when the spectral radius is bounded and the spectrum is well separated near the unit circle, these sequences tolerate a fixed fraction of the error level achievable by any experiment, even one designed with full plant knowledge and allowed to use any finite duration. This constant-factor comparison can fail for slowly actuated systems. For $A=I+hG$ with controllability depth $ν\ge2$, short experiments lose a factor of order $h^{ν-1}$, and duration of order $1/h$ is both necessary and sufficient to recover a fixed fraction of the optimal tolerance.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Systems & Control
Closed-Loop Refinement and Execution for Learned Driving Planners
Performance of Zero-determinant Strategies in Repeated Games without Discounting
Fully Online Decentralized Learning in Stochastic Games with Unknown Independent Chains
Self-Repairing Recurrent Ensembles for Real-Time Recovery from Distribution Shift
PROMO: Preference-conditioned Multi-Objective Reinforcement Learning for Quadrupedal Robots
Get the few papers worth your time in Systems & Control every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.