paper-with-me

Papers

An Offline Risk-aware Policy Selection Method for Bayesian Markov Decision Processes

2021-05-27 · Giorgio Angelotti, Nicolas Drougard, Caroline Ponzoni Carvalho Chanel

In Offline Model Learning for Planning and in Offline Reinforcement Learning, the limited data set hinders the estimate of the Value function of the relative Markov Decision Process (MDP). Consequently, the performance of the obtained policy in the real world is bounded and possibly risky, especially when the deployment of a wrong policy can lead to catastrophic consequences. For this reason, several pathways are being followed with the scope of reducing the model error (or the distributional shift between the learned model and the true one) and, more broadly, obtaining risk-aware solutions with respect to model uncertainty. But when it comes to the final application which baseline should a practitioner choose? In an offline context where computational time is not an issue and robustness is the priority we propose Exploitation vs Caution (EvC), a paradigm that (1) elegantly incorporates model uncertainty abiding by the Bayesian formalism, and (2) selects the policy that maximizes a risk-aware objective over the Bayesian posterior between a fixed set of candidate policies provided, for instance, by the current baselines. We validate EvC with state-of-the-art approaches in different discrete, yet simple, environments offering a fair variety of MDP classes. In the tested scenarios EvC manages to select robust policies and hence stands out as a useful tool for practitioners that aim to apply offline planning and reinforcement learning solvers in the real world.

📄 PDF Abstract BibTeX arXiv:2105.13431

Code (1)

giorgioangel/evc 공식 구현

Tasks

reinforcement-learning

Similar Papers 제목 키워드 기반

Reward Model Routing in Alignment

2025-10-03 · Xinle Wu, Yao Lu arxiv

Reinforcement learning from human or AI feedback (RLHF / RLAIF) has become the standard paradigm for aligning large language models (LLMs). However, most pipelines rely on a single reward model (RM), limiting alignment q…

Reinforcement Learning

Diffusion Policy with Bayesian Expert Selection for Active Multi-Target Tracking

2026-04-03 · Haotian Xiang, Qin Lu, Yaakov Bar-Shalom arxiv

Active multi-target tracking requires a mobile robot to balance exploration for undetected targets with exploitation of uncertain tracked ones. Diffusion policies have emerged as a powerful approach for capturing diverse…

Enhancing Offline Model-Based RL via Active Model Selection: A Bayesian Optimization Perspective

2025-02-17 · Yu-Wei Yang, Yun-Ming Chan, Wei Hung, Xi Liu 외

Offline model-based reinforcement learning (MBRL) serves as a competitive framework that can learn well-performing policies solely from pre-collected data with the help of learned dynamics models. To fully unleash the po…

Bayesian OptimizationmodelModel-based Reinforcement LearningModel Selection+2

Pessimistic Risk-Aware Policy Learning in Contextual Bandits

2026-05-15 · Yilong Wan, Yuqiang Li, Xianyi Wu arxiv

We study risk-aware offline policy learning, aiming to learn a decision rule from logged data that is optimal under general risk criteria. This problem is crucial in high-stakes domains where online interaction is infeas…

Support-aware offline policy selection for advertising marketplaces

2026-05-20 · Prashant Shekhar, Caroline Howard arxiv

Logged advertising auctions make offline reserve-price evaluation attractive but risky. Replay tables can identify policies with large apparent yield gains, yet they can also hide weak threshold support, multiple-compari…