Disentangling Linear Quadratic Control with Untrusted ML Predictions
Tongxin Li, Hao Liu, Yisong Yue
Abstract
Uncertain perturbations in dynamical systems often arise from diverse resources, represented by latent components. The predictions for these components, typically generated by “black-box” machine learning tools, are prone to inaccuracies. To tackle this challenge, we introduce D ISC , a novel policy that learns a confidence parameter online to harness the potential of accurate predictions while also mitigating the impact of erroneous forecasts. When predictions are precise, D ISC leverages this information to achieve near-optimal performance. Conversely, in the case of significant prediction errors, it still has a worst-case competitive ratio guarantee. We provide competitive ratio bounds for D ISC under both linear mixing of latent variables as well as a broader class of mixing functions. Our results highlight a first-of-its-kind “best-of-both-worlds” integration of machine-learned predictions, thus lead to a near-optimal consistency and robustness tradeoff, which provably improves what can be obtained without learning the confidence parameter. We validate the applicability of D ISC across a spectrum of practical scenarios.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d01d9b5f-c77f-43ba-97ad-80c7d1f43c67Builds on19
- Naive Exploration is Optimal for Online LQRMax Simchowitz, Dylan J. FosterICML 2020 · 209 citations
- The Primal-Dual method for Learning Augmented AlgorithmsÉtienne Bamas, Andreas Maggiori, Ola SvenssonNeurIPS 2020 · 171 citations
- Online metric algorithms with untrusted predictionsAntonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak et al.ICML 2020 · 170 citations
- Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online AlgorithmsAlexander Wei, Fred ZhangNeurIPS 2020 · 129 citations
- Invariant Causal Representation Learning for Out-of-Distribution GeneralizationChaochao Lu, Yuhuai Wu, José Miguel Hernández-Lobato, Bernhard SchölkopfICLR 2022 · 119 citations
Related papers
- Applied Online Algorithms with Heterogeneous PredictorsJessica Maghakian, Russell Lee, Mohammad Hajiesmaili, Jian Li et al.ICML 2023 · 7 citations
- Learning Augmented Energy Minimization via Speed ScalingÉtienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola SvenssonNeurIPS 2020 · 84 citations
- Pausing Policy Learning in Non-stationary Reinforcement LearningHyunin Lee, Ming Jin, Javad Lavaei, Somayeh SojoudiICML 2024 · 4 citations
- Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value PredictionsTongxin Li, Yiheng Lin, Shaolei Ren, Adam WiermanNeurIPS 2023 · 14 citations
- Robust and Consistent Ski Rental with Distributional AdviceJihwan Kim, Chenglin FanICML 2026 · 1 citation
