Policy Gradient Methods for Discrete Time Linear Quadratic Regulator With Random Parameters
Not on the map. Why?
Abstract (arXiv)
This paper studies an infinite horizon optimal control problem for discrete-time linear system and quadratic criteria, both with random parameters which are independent and identically distributed with respect to time. In this general setting, we apply the policy gradient method, a reinforcement learning technique, to search for the optimal control without requiring knowledge of statistical information of the parameters. We investigate the sub-Gaussianity of the state process and establish global linear convergence guarantee for this approach based on assumptions that are weaker and easier to verify compared to existing results. Numerical experiments are presented to illustrate our result.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 19 references that are in the map. First posted on arXiv 29 Mar 2023.
Builds on
7 of 19 references.
References · 7
- 2018Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulatorcited by 211
- 2018Learning Without Mixing: Towards A Sharp Analysis of Linear System Identificationcited by 158
- 2017On the Sample Complexity of the Linear Quadratic Regulatorcited by 151
- 2020Policy Gradient Methods for the Noisy Linear Quadratic Regulator over a Finite Horizoncited by 43
- 2018The Gap Between Model-Based and Model-Free Methods on the Linear Quadratic Regulator: An Asymptotic Viewpointcited by 36
- 2020Model-free optimal control of discrete-time systems with additive and multiplicative noisescited by 5
- 2020A Q-learning algorithm for discrete-time linear-quadratic control with random parameters of unknown distribution: convergence and stabilizationcited by 2
Built on by
Not cited yet.