Relative Entropy Pathwise Policy Optimization
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
Score-function based methods for policy learning, such as REINFORCE and PPO, have delivered strong results in game-playing and robotics, yet their high variance often undermines training stability. Using pathwise policy gradients, i.e. computing a derivative by differentiating the objective function, alleviates the variance issues. However, they require an accurate action-conditioned value function, which is notoriously hard to learn without relying on replay buffers for reusing past off-policy data. We present an on-policy algorithm that trains Q-value models purely from on-policy trajectories, unlocking the possibility of using pathwise policy updates in the context of on-policy learning. We show how to combine stochastic policies for exploration with constrained updates for stable training, and evaluate important architectural components that stabilize value function learning. The result, Relative Entropy Pathwise Policy Optimization (REPPO), is an efficient on-policy algorithm that combines the stability of pathwise policy gradients with the simplicity and minimal memory footprint of standard on-policy learning. Compared to state-of-the-art on two standard GPU-parallelized benchmarks, REPPO provides strong empirical performance at superior sample efficiency, wall-clock time, memory footprint, and hyperparameter robustness.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 81 of its 114 references that are in the map. First posted on arXiv 15 Jul 2025.
Builds on
81 of 114 references.
Closest ancestors · 4
Same direction, newest first
- 2024Adaptive Horizon Actor-Critic for Policy Learning in Contact-Rich Differentiable Simulation28 May
- 2024Policy Gradient with Active Importance Sampling9 May
- 2024Overestimation, Overfitting, and Plasticity in Actor-Critic: the Bitter Lesson of Reinforcement Learning1 Mar
- 2024Simple Policy Optimization29 Jan
Other references · 77
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2016Layer Normalizationcited by 5,669
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Continuous control with deep reinforcement learningcited by 3,407
- 2023Diffusion Policy: Visuomotor Policy Learning via Action Diffusioncited by 2,838
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2015Trust Region Policy Optimizationcited by 2,580
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,417
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
38 more
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,240
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2022Scaling Laws for Reward Model Overoptimizationcited by 1,095
- 2020Mastering Atari with Discrete World Modelscited by 1,007
- 2021Isaac Gym: High Performance GPU-Based Physics Simulation For Robot Learningcited by 998
- 2021Deep Reinforcement Learning at the Edge of the Statistical Precipicecited by 807
- 2017A Distributional Perspective on Reinforcement Learningcited by 765
- 2021Learning to Walk in Minutes Using Massively Parallel Deep Reinforcement Learningcited by 512
- 2023TD-MPC2: Scalable, Robust World Models for Continuous Controlcited by 512
- 2018Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Reviewcited by 482
- 2016Reinforcement Learning with Unsupervised Auxiliary Taskscited by 404
- 2023Efficient Online Reinforcement Learning with Offline Datacited by 363
- 2018Maximum a Posteriori Policy Optimisationcited by 328
- 2020Data-Efficient Reinforcement Learning with Self-Predictive Representationscited by 318
- 2019Monte Carlo Gradient Estimation in Machine Learningcited by 283
- 2022The Primacy Bias in Deep Reinforcement Learningcited by 247
- 2024ManiSkill3: GPU Parallelized Robotics Simulation and Rendering for Generalizable Embodied AIcited by 229
- 2023Real-World Humanoid Locomotion with Reinforcement Learningcited by 187
- 2020Revisiting Fundamentals of Experience Replaycited by 175
- 2019Soft Actor-Critic for Discrete Action Settingscited by 174
- 2023Understanding plasticity in neural networkscited by 174
- 2015Learning Continuous Control Policies by Stochastic Value Gradientscited by 162
- 2023Bigger, Better, Faster: Human-level Atari with human-level efficiencycited by 147
- 2024Stop Regressing: Training Value Functions via Classification for Scalable Deep RLcited by 144
- 2020Implicit Under-Parameterization Inhibits Data-Efficient Deep Reinforcement Learningcited by 134
- 2020Phasic Policy Gradientcited by 123
- 2023Loss of Plasticity in Continual Deep Reinforcement Learningcited by 121
- 2024Bigger, Regularized, Optimistic: scaling for compute and sample-efficient continuous controlcited by 108
- 2020Mirror Descent Policy Optimizationcited by 106
- 2022Accelerated Policy Learning with Parallel Differentiable Simulationcited by 104
- 2022Discovered Policy Optimisationcited by 104
- 2015An Emphatic Approach to the Problem of Off-policy Temporal-Difference Learningcited by 103
- 2022Do Differentiable Simulators Give Better Policy Gradients?cited by 89
- 2021Gradients are Not All You Needcited by 86
- 2024Disentangling the Causes of Plasticity Loss in Neural Networkscited by 86
- 2019V-MPO: On-Policy Maximum a Posteriori Policy Optimization for Discrete and Continuous Controlcited by 85
- 2024Simplifying Deep Temporal Difference Learningcited by 78
- 2024SimBa: Simplicity Bias for Scaling Up Parameters in Deep Reinforcement Learningcited by 76
50 most cited of 77 All 77 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 6.
7 papers.
- 2026FlashSAC: Fast and Stable Off-Policy Reinforcement Learning for High-Dimensional Robot Controlcited by 5
- 2026Scalable Maximum Entropy Reinforcement Learning for Diffusion Policies via Adjoint Matchingcited by 5
- 2025Diffusion-Augmented Markov Decision Processes for Maximum Entropy Reinforcement Learningcited by 3
- 2026R^3: Replay, Reflection, and Ranking Rewards for LLM Reinforcement Learningcited by 2
- 2026Non-Myopic Active Feature Acquisition via Pathwise Policy Gradientscited by 1
- 2026FERPO: Forward Entropy-Regularized Policy Optimizationcited by 0
- 2026Reinforcement Learning via Fixed-point Flow Matchingcited by 0
- 2026Reinforcement Learning via Fixed-point Flow Matching9 Oct 2026
- 2026FERPO: Forward Entropy-Regularized Policy Optimization1 Oct 2026
- 2026Scalable Maximum Entropy Reinforcement Learning for Diffusion Policies via Adjoint Matching21 Jun 2026
- 2026Non-Myopic Active Feature Acquisition via Pathwise Policy Gradients6 May 2026
- 2026FlashSAC: Fast and Stable Off-Policy Reinforcement Learning for High-Dimensional Robot Control6 Apr 2026
- 2026R^3: Replay, Reflection, and Ranking Rewards for LLM Reinforcement Learning27 Jan 2026
- 2025Diffusion-Augmented Markov Decision Processes for Maximum Entropy Reinforcement Learning1 Dec 2025
Similar, not cited
Close in wording, no citation either way
- 2026Revisiting Regularized Policy Optimization for Stable and Efficient Reinforcement Learning in Two-Player Games
- 2024Exploration-Driven Policy Optimization in RLHF: Theoretical Insights on Efficient Data Utilization
- 2025Revisiting Group Relative Policy Optimization: Insights into On-Policy and Off-Policy Training
- 2025RePO: Replay-Enhanced Policy Optimization
- 2025Learning Without Critics? Revisiting GRPO in Classical Reinforcement Learning Environments
- 2026Optimistic Policy Regularization
- 2023Reparameterized Policy Learning for Multimodal Trajectory Optimization
- 2025Stabilizing Reinforcement Learning with LLMs: Formulation and Practices