Training Dynamics and Induced Preconditioning of ReLU Policy Gradient for Scalar LQR
math.OC, cs.SY, eess.SY
Submitted: 2026-04-24
Updated: 2026-09-25
License: http://creativecommons.org/licenses/by/4.0/
The gist: Policy gradient is not invariant to reparameterization; the training dynamics of the weights of a neural controller differ from those of the induced gains.
Terminology
Abstract
Policy gradient is not invariant to reparameterization; the training dynamics of the weights of a neural controller differ from those of the induced gains. We make that difference exact for deterministic scalar discounted linear-quadratic regulation with bias-free one-hidden-layer ReLU policies. We show that policy gradient on the weights induces preconditioning on the gains' dynamics, alongside an explicit quadratic finite-step correction and an activation-group error. Moreover, we identify explicit conditions on the step sizes and initialization parameters that guarantee that the sequence of generated controllers remains stabilizing throughout training and converges to the optimal gains with high probability. For a given system and cost parameters, the sufficient step-size conditions imply contraction bounds independent of the network width. Numerical analysis illustrates how the neural realization changes the induced gain dynamics while maintaining stability across training.
Sources
- Sample-Efficient Model-Free Policy Gradient Methods for Stochastic LQR via Robust Linear Regression
- Policy Gradient Adaptive Control for the LQR: Indirect and Direct Approaches
Related papers
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
- Incremental Learning in Mirror Flows
- Second-Order Optimization with Asynchronous Curvature
- Online Control via Counterfactual Tracking
- Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability