A PAC-Bayes Approach for Controlling Unknown Linear Discrete-time Systems
Not on the map. Why?
Abstract (arXiv)
This paper presents a PAC-Bayes framework for learning controllers for unknown stochastic linear discrete-time systems, where the system parameters are drawn from a fixed but unknown distribution. We derive a data-dependent high probability bound on the performance of any learned (stochastic) controller, and propose novel efficient learning algorithms with theoretical guarantees, which can be implemented for both finite and infinite controller spaces. Compared to prior work, our bound holds for unbounded quadratic cost. In the special case where LQG is optimal, our numerical results suggest that the learned controllers achieve comparable performance to LQG.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 24 references that are in the map. First posted on arXiv 11 May 2026.
Builds on
7 of 24 references.
References · 7
- 2021Safe Learning in Robotics: From Learning-Based Control to Safe Reinforcement Learningcited by 371
- 2021User-friendly introduction to PAC-Bayes boundscited by 239
- 2018Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulatorcited by 86
- 2024Formal Verification and Control with Conformal Predictioncited by 26
- 2024A PAC-Bayesian Framework for Optimal Control with Stability Guaranteescited by 7
- 2022Learning Latent Representations to Co-Adapt to Humanscited by 5
- 2023Learning Robust Data-based LQG Controllers from Noisy Datacited by 3
Built on by
Not cited yet.