Model-Based Epistemic Variance of Values for Risk-Aware Policy Optimization
원문 초록
We consider the problem of quantifying uncertainty over expected cumulative rewards in model-based reinforcement learning. In particular, we focus on characterizing the variance over values induced by a distribution over Markov decision processes (MDPs). Previous work upper bounds the posterior variance over values by solving a so-called uncertainty Bellman equation (UBE), but the over-approximation may result in inefficient exploration. We propose a new UBE whose solution converges to the true posterior variance over values and leads to lower regret in tabular exploration problems. We identify challenges to apply the UBE theory beyond tabular problems and propose a suitable approximation. Based on this approximation, we introduce a general-purpose policy optimization algorithm, Q-Uncertainty Soft Actor-Critic (QU-SAC), that can be applied for either risk-seeking or risk-averse policy optimization with minimal changes. Experiments in both online and offline RL demonstrate improved performance compared to other uncertainty estimation methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Bayes Adaptive Monte Carlo Tree Search for Offline Model-based Reinforcement Learning
Generating Code World Models with Large Language Models Guided by Monte Carlo Tree Search
Enhancing Offline Model-Based RL via Active Model Selection: A Bayesian Optimization Perspective
Offline Model-Based Reinforcement Learning with Anti-Exploration
Model-based RL as a Minimalist Approach to Horizon-Free and Second-Order Bounds
BECAUSE: Bilinear Causal Representation for Generalizable Offline Model-based Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.