Mollification Effects of Policy Gradient Methods
Not on the map. Why?
Abstract (arXiv)
Policy gradient methods have enabled deep reinforcement learning (RL) to approach challenging continuous control problems, even when the underlying systems involve highly nonlinear dynamics that generate complex non-smooth optimization landscapes. We develop a rigorous framework for understanding how policy gradient methods mollify non-smooth optimization landscapes to enable effective policy search, as well as the downside of it: while making the objective function smoother and easier to optimize, the stochastic objective deviates further from the original problem. We demonstrate the equivalence between policy gradient methods and solving backward heat equations. Following the ill-posedness of backward heat equations from PDE theory, we present a fundamental challenge to the use of policy gradient under stochasticity. Moreover, we make the connection between this limitation and the uncertainty principle in harmonic analysis to understand the effects of exploration with stochastic policies in RL. We also provide experimental results to illustrate both the positive and negative aspects of mollification effects in practice.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 30 of its 54 references that are in the map. First posted on arXiv 28 May 2024.
Builds on
30 of 54 references.
References · 30
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2015Trust Region Policy Optimizationcited by 2,503
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2016OpenAI Gymcited by 1,684
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
- 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 514
- 2018Is Q-learning Provably Efficient?cited by 485
- 2016Deep Reinforcement Learning for Robotic Manipulation with Asynchronous Off-Policy Updatescited by 342
18 more
- 2018Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulatorcited by 211
- 2019Provably Efficient Exploration in Policy Optimizationcited by 203
- 2020Neural Lyapunov Controlcited by 142
- 2022On the Convergence Rates of Policy Gradient Methodscited by 115
- 2019Optimism in Reinforcement Learning with Generalized Linear Function Approximationcited by 111
- 2015An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedbackcited by 105
- 2022Do Differentiable Simulators Give Better Policy Gradients?cited by 83
- 2021Gradients are Not All You Needcited by 82
- 2019PIPPS: Flexible Model-Based Policy Search Robust to the Curse of Chaoscited by 56
- 2020On Linear Convergence of Policy Gradient Methods for Finite MDPscited by 51
- 2022Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimizationcited by 40
- 2021Analysis of the Optimization Landscape of Linear Quadratic Gaussian (LQG) Controlcited by 23
- 2023Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimizationcited by 16
- 2021A unified view of likelihood ratio and reparameterization gradientscited by 12
- 2023Fractal Landscapes in Policy Optimizationcited by 8
- 2019Total stochastic gradient algorithms and applications in reinforcement learningcited by 7
- 2022Human Motion Control of Quadrupedal Robots using Deep Reinforcement Learningcited by 6
- 2023Connected Superlevel Set in (Deep) Reinforcement Learning and its Application to Minimax Theoremscited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.