Hindsight Value Function for Variance Reduction in Stochastic Dynamic Environment
Not on the map. Why?
Abstract (arXiv)
Policy gradient methods are appealing in deep reinforcement learning but suffer from high variance of gradient estimate. To reduce the variance, the state value function is applied commonly. However, the effect of the state value function becomes limited in stochastic dynamic environments, where the unexpected state dynamics and rewards will increase the variance. In this paper, we propose to replace the state value function with a novel hindsight value function, which leverages the information from the future to reduce the variance of the gradient estimate for stochastic dynamic environments. Particularly, to obtain an ideally unbiased gradient estimate, we propose an information-theoretic approach, which optimizes the embeddings of the future to be independent of previous actions. In our experiments, we apply the proposed hindsight value function in stochastic dynamic environments, including discrete-action environments and continuous-action environments. Compared with the standard state value function, the proposed hindsight value function consistently reduces the variance, stabilizes the training, and improves the eventual policy.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 14 of its 26 references that are in the map. First posted on arXiv 26 Jul 2021.
Builds on
14 of 26 references.
References · 14
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2015Trust Region Policy Optimizationcited by 2,503
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
- 2016OpenAI Gymcited by 1,684
- 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
- 2015End-to-End Training of Deep Visuomotor Policiescited by 847
- 2019Dynamics-Aware Unsupervised Discovery of Skillscited by 308
- 2020CLUB: A Contrastive Log-ratio Upper Bound of Mutual Informationcited by 233
- 2016Q-Prop: Sample-Efficient Policy Gradient with An Off-Policy Criticcited by 77
- 2018Variance Reduction for Policy Gradient with Action-Dependent Factorized Baselinescited by 65
- 2018Unsupervised Multi-Target Domain Adaptation: An Information Theoretic Approachcited by 63
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 3.
7 papers.
- 2021Generalized Decision Transformer for Offline Hindsight Information Matchingcited by 105
- 2022Hindsight Learning for MDPs with Exogenous Inputscited by 25
- 2022Causality-driven Hierarchical Structure Discovery for Reinforcement Learningcited by 23
- 2023Context Shift Reduction for Offline Meta-Reinforcement Learningcited by 17
- 2023Conceptual Reinforcement Learning for Language-Conditioned Taskscited by 8
- 2023Contrastive Modules with Temporal Attention for Multi-Task Reinforcement Learningcited by 8
- 2022Object-Category Aware Reinforcement Learningcited by 6
- 2023Context Shift Reduction for Offline Meta-Reinforcement Learning7 Nov 2023
- 2023Contrastive Modules with Temporal Attention for Multi-Task Reinforcement Learning2 Nov 2023
- 2023Conceptual Reinforcement Learning for Language-Conditioned Tasks9 Mar 2023
- 2022Object-Category Aware Reinforcement Learning13 Oct 2022
- 2022Causality-driven Hierarchical Structure Discovery for Reinforcement Learning13 Oct 2022
- 2022Hindsight Learning for MDPs with Exogenous Inputs13 Jul 2022
- 2021Generalized Decision Transformer for Offline Hindsight Information Matching19 Nov 2021