On the Hardness of Learning to Stabilize Linear Systems

Xiong Zeng, Zexiang Liu, Zhe Du, Necmiye Ozay, Mario Sznaier
11/18/2023
eess.SYcs.LGstat.ML

No confident code implementation found for this paper.

Abstract

Inspired by the work of Tsiamis et al. \cite{tsiamis2022learning}, in this paper we study the statistical hardness of learning to stabilize linear time-invariant systems. Hardness is measured by the number of samples required to achieve a learning task with a given probability. The work in \cite{tsiamis2022learning} shows that there exist system classes that are hard to learn to stabilize with the core reason being the hardness of identification. Here we present a class of systems that can be easy to identify, thanks to a non-degenerate noise process that excites all modes, but the sample complexity of stabilization still increases exponentially with the system dimension. We tie this result to the hardness of co-stabilizability for this class of systems using ideas from robust control.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zeng2023hardness,
  title  = {On the Hardness of Learning to Stabilize Linear Systems},
  author = {Xiong Zeng and Zexiang Liu and Zhe Du and Necmiye Ozay and Mario Sznaier},
  year   = {2023},
  eprint = {2311.11151},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.11151v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.11151.svg)](https://codeofpaper.com/paper/2311.11151)

Discussion