Improving Actor-Critic Reinforcement Learning via Hamiltonian Monte Carlo Method
Not on the map. Why?
Abstract (arXiv)
The actor-critic RL is widely used in various robotic control tasks. By viewing the actor-critic RL from the perspective of variational inference (VI), the policy network is trained to obtain the approximate posterior of actions given the optimality criteria. However, in practice, the actor-critic RL may yield suboptimal policy estimates due to the amortization gap and insufficient exploration. In this work, inspired by the previous use of Hamiltonian Monte Carlo (HMC) in VI, we propose to integrate the policy network of actor-critic RL with HMC, which is termed as it Hamiltonian Policy. As such we propose to evolve actions from the base policy according to HMC, and our proposed method has many benefits. First, HMC can improve the policy distribution to better approximate the posterior and hence reduce the amortization gap. Second, HMC can also guide the exploration more to the regions of action spaces with higher Q values, enhancing the exploration efficiency. Further, instead of directly applying HMC into RL, we propose a new leapfrog operator to simulate the Hamiltonian dynamics. Finally, in safe RL problems, we find that the proposed method can not only improve the achieved return, but also reduce safety constraint violations by discarding potentially unsafe actions. With comprehensive empirical experiments on continuous control baselines, including MuJoCo and PyBullet Roboschool, we show that the proposed approach is a data-efficient and easy-to-implement improvement over previous actor-critic methods.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 46 references that are in the map. First posted on arXiv 22 Mar 2021.
Builds on
28 of 46 references.
References · 28
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2015Trust Region Policy Optimizationcited by 2,503
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
- 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,327
- 2018Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Modelscited by 748
- 2018QT-Opt: Scalable Deep Reinforcement Learning for Vision-Based Robotic Manipulationcited by 730
- 2017Reinforcement Learning with Deep Energy-Based Policiescited by 659
- 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 636
- 2018Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Reviewcited by 466
- 2018Reward Constrained Policy Optimizationcited by 397
16 more
- 2017Neural Network Dynamics for Model-Based Deep Reinforcement Learning with Model-Free Fine-Tuningcited by 288
- 2018A Lyapunov-based Approach to Safe Reinforcement Learningcited by 278
- 2017Advances in Variational Inferencecited by 236
- 2019Lyapunov-based Safe Policy Optimization for Continuous Controlcited by 140
- 2018Inference Suboptimality in Variational Autoencoderscited by 131
- 2015Taming the Noise in Reinforcement Learning via Soft Updatescited by 125
- 2014Neural Variational Inference and Learning in Belief Networkscited by 116
- 2019Better Exploration with Optimistic Actor-Criticcited by 88
- 2018Semi-Amortized Variational Autoencoderscited by 83
- 2018Latent Space Policies for Hierarchical Reinforcement Learningcited by 66
- 2019Leveraging exploration in off-policy algorithms via normalizing flowscited by 45
- 2018Hamiltonian Variational Auto-Encodercited by 41
- 2020Model-Predictive Control via Cross-Entropy and Gradient-Based Optimizationcited by 32
- 2016Variational Inference with Hamiltonian Monte Carlocited by 17
- 2020Iterative Amortized Policy Optimizationcited by 13
- 2018Boosting Trust Region Policy Optimization by Normalizing Flows Policycited by 11
Built on by
Citing papers per year: 2022: 1; 2023: 1.
2 papers.