Entropy-regularized Point-based Value Iteration
Not on the map. Why?
Abstract (arXiv)
Model-based planners for partially observable problems must accommodate both model uncertainty during planning and goal uncertainty during objective inference. However, model-based planners may be brittle under these types of uncertainty because they rely on an exact model and tend to commit to a single optimal behavior. Inspired by results in the model-free setting, we propose an entropy-regularized model-based planner for partially observable problems. Entropy regularization promotes policy robustness for planning and objective inference by encouraging policies to be no more committed to a single action than necessary. We evaluate the robustness and objective inference performance of entropy-regularized policies in three problem domains. Our results show that entropy-regularized policies outperform non-entropy-regularized baselines in terms of higher expected returns under modeling errors and higher accuracy during objective inference.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 8 of its 25 references that are in the map. First posted on arXiv 14 Feb 2024.
Builds on
8 of 25 references.
References · 8
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2019A Theory of Regularized Markov Decision Processescited by 279
- 2022Partially Observable Markov Decision Processes in Robotics: A Surveycited by 81
- 2022Task-Directed Exploration in Continuous POMDPs for Robotic Manipulation of Articulated Objectscited by 7
- 2021Entropy Maximization for Partially Observable Markov Decision Processescited by 3
- 2022Anderson Acceleration for Partially Observable Markov Decision Processes: A Maximum Entropy Approachcited by 3
- 2018Decomposition Methods with Deep Corrections for Reinforcement Learningcited by 1
- 2021Entropy-Regularized Partially Observed Markov Decision Processescited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.