The Fragility of Learning LQG Controllers
Bruce D. Lee, Anastasios Tsiamis, Nikolai Matni, Manfred Morari, John Lygeros

TL;DR
This paper establishes fundamental lower bounds on the sample complexity for learning LQG controllers from data in partially observed systems, highlighting the challenges posed by system fragility.
Contribution
It derives information-theoretic lower bounds for offline learning of LQG controllers, linking system fragility to high sample complexity in partially observed control.
Findings
Fragile robust control problems require many samples to learn effectively.
Certainty-equivalent methods are asymptotically optimal under certain conditions.
System fragility impacts the difficulty of data-driven control in classical examples.
Abstract
Learning methods are increasingly used to synthesize controllers from data, yet existing sample-complexity characterizations for continuous control are sharp only in the fully observed setting. This paper studies the partially observed case by deriving information-theoretic lower bounds for learning Linear Quadratic Gaussian (LQG) controllers from offline trajectories generated by a (linear) exploration policy. We prove an -local minimax excess-cost lower bound that applies to any algorithm mapping the offline dataset to a stabilizing linear controller. The bound is expressed in terms of the Hessian of the LQG cost with respect to model parameters and the inverse Fisher Information induced by the exploration policy. We further provide system-theoretic characterizations of these objects, enabling transparent construction of hard instances. Instantiating the bound on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
