The reviewed record of science sign in
Pith

arxiv: 2402.09388 · v1 · pith:3YSLD3Y2 · submitted 2024-02-14 · cs.AI

Entropy-regularized Point-based Value Iteration

Reviewed by Pithpith:3YSLD3Y2open to challenge →

classification cs.AI
keywords entropy-regularizedinferenceobjectiveduringmodel-basedpoliciesuncertaintyhigher
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Think Fast and Far: Long-Horizon Online POMDP Planning via Rapid State Sampling

    cs.RO 2026-06 unverdicted novelty 6.0

    ROP-RAS3 approximates long-horizon POMDP policies by sampling macro actions from state space via fast motion planners, scaling with sample count rather than action-space size and outperforming prior methods in success rate.