Skip to content
Preprint

Policy Gradient over History-Dependent Policy Classes for LQR with Domain Randomization

Sep 2026 · 0 citations · 29 references
Engineering Computer Science

TL;DR

This work first study PG of domain randomized LQR over history-dependent policy classes, such as finite impulse response controllers, as they can extend the possibilities of simultaneous stabilization, and proposes a curriculum learning based algorithm which gradually expands the memory of the controller.

Abstract

Domain Randomization (DR) has been widely used to overcome the sim-to-real gap by training a controller on a distribution of simulated environments via reinforcement learning. While DR can achieve robust performance simply using controllers synthesized via policy gradient (PG) methods, the optimization landscape is not well understood, even in the case of linear quadratic regulator (LQR) objectives. To this end, we first study PG of domain randomized LQR over history-dependent policy classes, such as finite impulse response controllers, as they can extend the possibilities of simultaneous stabilization. Second, to find such a stabilizing controller, we propose a curriculum learning based algorithm which gradually expands the memory of the controller. Finally, we show that PG with the proposed algorithm converges globally to the minimizer of a sample average approximation of the DR objective under suitable bounds on the heterogeneity of environments. Empirical results support our findings and highlight promising directions for future work, including nonlinear domain-randomized control.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Multi-Fidelity Policy Gradients Stabilize Data-Scarce Reinforcement Learning

Policy gradient methods for on-policy reinforcement learning (RL) can become unstable when expensive, scarce target-domain data yield noisy gradient estimates. We address this challenge by complementing limited high-fidelity (HF) target-domain data with abundant, cheap, but biased low-fidelity (LF) data, e.g., from a s...

Xin-Jie Liu, Rui-Han Zhao, A. Chaudhuri et al. · 0 citations
Preprint Sep 2026

Is One Step Enough for Offline Policy Improvement?

This work studies how policy improvement is composed through multi-step proximal policy improvement (MPI), which re-centers each proximal objective on the preceding policy, and identifies improvement composition as a design choice alongside regularization strength, with distinct effects from horizon subdivision and add...

Soohyun Choi, Seonvin Cho, Songnam Hong · 0 citations
#machine learning Preprint Sep 2026

Last-Iterate Guarantees for Online Reinforcement Learning in Structured Constrained MDPs

This work develops a general, statistically efficient framework for last-iterate convergence in structured Constrained MDPs (CMDPs), and validate the stabilising effect predicted by the theory on a synthetic linear CMDP: the regularised method exhibits stable last-iterate behaviour, whereas its unregularised counterpar...

Nam Phuong Tran, Trinh Ha Mai Huynh, T. P. Le et al. · 0 citations
#machine learning Preprint Sep 2026

Offline Policy Evaluation via Mixed Bellman Residuals and Adaptive Critic Representations

A convex combination of one-step and two-step residuals with a fixed mixing weight is considered to provide a natural bias--variance trade-off between approximation error under a restricted value-function class and the increased variance arising from multi-step importance weighting.

Amitakshar Biswas, Yu-Han Li, Ruo-Qing Zhu · 0 citations
#machine learning Preprint Sep 2026

Towards Better Training Signal: Advantage Clipped Policy Optimization

Reinforcement learning (RL) has become a cornerstone for improving the reasoning capabilities of large language models (LLMs), but the need for on-policy data substantially limits training efficiency. Reusing off-policy data through importance sampling (IS) can improve efficiency but introduce considerable instability....

Rui-Chuan Huang, Jing-Han Liu, Cong-Liang Chen · 0 citations
#machine learning Preprint Sep 2026

Local and Global Stability in Performative Reinforcement Learning

This work separates local mixed stability, an occupancy-weighted first-order relaxation that is equivalent to stationarity, from global mixed stability, which certifies against arbitrary deviating policies, and extends both notions to n-player performative Markov games, obtaining local stability with no assumption on t...

Debmalya Mandal · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.