On the Gradient Domination of the LQG Problem
Organizations: The authors are with the Department of Electrical Engineering at Columbia University, New York, USA.
Abstract
We consider solutions to the linear quadratic Gaussian (LQG) regulator problem via policy gradient (PG) methods. Although PG methods have demonstrated strong theoretical guarantees in solving the linear quadratic regulator (LQR) problem, despite its nonconvex landscape, their theoretical understanding in the LQG setting remains limited. Notably, the LQG problem lacks gradient dominance in the classical parameterization, i.e., with a dynamic controller, which hinders global convergence guarantees. In this work, we study a PG method for the LQG problem by adopting an alternative parameterization of the set of stabilizing controllers and employing a lifting argument. We refer to this parameterization as a history representation of the control input as it is parameterized by past input and output data from the previous p time-steps. Under this parameterization, the infinite-history LQG optimization reduces to an equivalent static state-feedback LQR problem, allowing us to recover gradient dominance and smoothness. For finite history length p, we establish model-based and model-free convergence guarantees up to a geometrically decaying history-truncation error.
Figures & tables
| Work | Process noise | Meas. noise | Partial obs. | Param. | Per-iter. stability | Gradient dominance | PG conv. |
| Fazel et al. [ 2 ] ; follow-ups [ 21 , 4 ] | ✗ | ✗ | ✗ | standard | ✓ [ 2 ] | ✓ | ✓ |
| Mohammadi et al. [ 13 ] ; Tang et al. [ 15 ] | ✓ | ✓ | ✓ | standard | N/A | ✗ | ✗ |
| Zhao et al. [ 12 ] ; Xie & Ni [ 23 ] | ✗ | ✗ | ✓ | history representation | ✗ | ✓ | ✓ |
| This work | ✓ | ✓ | ✓ | lifted history | sufficiently small step size (Thm. 1 ) | ✓ on | ✓ under Assms. 2 and 4 |
Policy Gradient Methods
Policy gradient methods optimize stochastic policies by estimating how parameter changes affect expected reward.
See all 164 papers