Learning the Linear Quadratic Regulator from Nonlinear Observations
Zakaria Mhammedi, Dylan J. Foster, Max Simchowitz, Dipendra Misra, Wen Sun, Akshay Krishnamurthy, Alexander Rakhlin, John Langford
Abstract
We introduce a new problem setting for continuous control called the LQR with Rich Observations, or RichLQR. In our setting, the environment is summarized by a low-dimensional continuous latent state with linear dynamics and quadratic costs, but the agent operates on high-dimensional, nonlinear observations such as images from a camera. To enable sample-efficient learning, we assume that the learner has access to a class of decoder functions (e.g., neural networks) that is flexible enough to capture the mapping from observations to latent states. We introduce a new algorithm, RichID, which learns a near-optimal policy for the RichLQR with sample complexity scaling only with the dimension of the latent state space and the capacity of the decoder function class. RichID is oracle-efficient and accesses the decoder class only through calls to a least-squares regression oracle. Our results constitute the first provable sample complexity guarantee for continuous control with an unknown nonlinearity in the system model and general function approximation.
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 4a39ade9-7333-4f0a-8697-00c69b7e381cCited by top-tier papers10
- Online Control of Unknown Time-Varying Dynamical SystemsEdgar Minasyan, Paula Gradu, Max Simchowitz, Elad HazanNeurIPS 2021 · 38 citations
- Inverse Dynamics Pretraining Learns Good Representations for Multitask ImitationDavid Brandfonbrener, Ofir Nachum, Joan BrunaNeurIPS 2023 · 38 citations
- Model-based RL with Optimistic Posterior Sampling: Structural Conditions and Sample ComplexityAlekh Agarwal, Tong ZhangNeurIPS 2022 · 29 citations
- Representation Learning with Multi-Step Inverse Kinematics: An Efficient and Optimal Approach to Rich-Observation RLZakaria Mhammedi, Dylan J. Foster, Alexander RakhlinICML 2023 · 23 citations
- Learning Mixtures of Linear Dynamical SystemsYanxi Chen, H. Vincent PoorICML 2022 · 22 citations
Builds on5
- Kinematic State Abstraction and Provably Efficient Rich-Observation Reinforcement LearningDipendra Misra, Mikael Henaff, Akshay Krishnamurthy, John LangfordICML 2020 · 158 citations
- Logarithmic Regret Bound in Partially Observable Linear Dynamical SystemsSahin Lale, Kamyar Azizzadenesheli, Babak Hassibi, Anima AnandkumarNeurIPS 2020 · 106 citations
- Prediction, Consistency, Curvature: Representation Learning for Locally-Linear ControlNir Levine, Yinlam Chow, Rui Shu, Ang Li et al.ICLR 2020 · 35 citations
- Predictive Coding for Locally-Linear ControlRui Shu, Tung Nguyen, Yinlam Chow, Tuan Pham et al.ICML 2020 · 28 citations
- Extracting Latent State Representations with Linear Dynamics from Rich ObservationsAbraham Frandsen, Rong Ge, Holden LeeICML 2022 · 1 citation
Related papers
- Rich-Observation Reinforcement Learning with Continuous Latent DynamicsYuda Song, Lili Wu, Dylan J. Foster, Akshay KrishnamurthyICML 2024 · 2 citations
- Stochastic Latent Actor-Critic: Deep Reinforcement Learning with a Latent Variable ModelAlex X. Lee, Anusha Nagabandi, Pieter Abbeel, Sergey LevineNeurIPS 2020 · 437 citations
- Provably sample-efficient RL with side information about latent dynamicsYao Liu, Dipendra Misra, Miro Dudík, Robert E. SchapireNeurIPS 2022 · 2 citations
- Reinforcement Learning Under Latent Dynamics: Toward Statistical and Algorithmic ModularityPhilip Amortila, Dylan J. Foster, Nan Jiang, Akshay Krishnamurthy et al.NeurIPS 2024 · 6 citations
- Information Theoretic Regret Bounds for Online Nonlinear ControlSham M. Kakade, Akshay Krishnamurthy, Kendall Lowrey, Motoya Ohnishi et al.NeurIPS 2020 · 137 citations
