Some remarks on gradient dominance and LQR policy optimization
Eduardo D. Sontag

TL;DR
This paper investigates gradient dominance conditions in policy optimization for LQR problems, highlighting differences between continuous and discrete time, and explores stability and convergence issues in neural network feedback control.
Contribution
It introduces generalized Polyak-Łojasiewicz conditions for LQR and neural networks, analyzing their impact on convergence and stability in control and reinforcement learning.
Findings
Global exponential convergence in discrete-time LQR
Mixed linear/exponential convergence in continuous-time LQR
Input-to-state stability analysis of gradient errors
Abstract
Solutions of optimization problems, including policy optimization in reinforcement learning, typically rely upon some variant of gradient descent. There has been much recent work in the machine learning, control, and optimization communities applying the Polyak-{\L}ojasiewicz Inequality (PLI) to such problems in order to establish an exponential rate of convergence (a.k.a. ``linear convergence'' in the local-iteration language of numerical analysis) of loss functions to their minima under the gradient flow. Often, as is the case of policy iteration for the continuous-time LQR problem, this rate vanishes for large initial conditions, resulting in a mixed globally linear / locally exponential behavior. This is in sharp contrast with the discrete-time LQR problem, where there is global exponential convergence. That gap between CT and DT behaviors motivates the search for various…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsEarly Stopping
