paper-with-me

홈 › Papers

Being Optimistic to Be Conservative: Quickly Learning a CVaR Policy

2019-11-05 · Ramtin Keramati, Christoph Dann, Alex Tamkin, Emma Brunskill

While maximizing expected return is the goal in most reinforcement learning approaches, risk-sensitive objectives such as conditional value at risk (CVaR) are more suitable for many high-stakes applications. However, relatively little is known about how to explore to quickly learn policies with good CVaR. In this paper, we present the first algorithm for sample-efficient learning of CVaR-optimal policies in Markov decision processes based on the optimism in the face of uncertainty principle. This method relies on a novel optimistic version of the distributional Bellman operator that moves probability mass from the lower to the upper tail of the return distribution. We prove asymptotic convergence and optimism of this operator for the tabular policy evaluation case. We further demonstrate that our algorithm finds CVaR-optimal policies substantially faster than existing baselines in several simulated environments with discrete and continuous state spaces.

📄 PDF Abstract BibTeX arXiv:1911.01546

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Risk-Sensitive RL with Optimized Certainty Equivalents via Reduction to Standard RL

2024-03-10 · Kaiwen Wang, Dawen Liang, Nathan Kallus, Wen Sun

We study Risk-Sensitive Reinforcement Learning (RSRL) with the Optimized Certainty Equivalent (OCE) risk, which generalizes Conditional Value-at-risk (CVaR), entropic risk and Markowitz's mean-variance. Using an augmente…

Distributional Reinforcement Learning for Risk-Sensitive Policies

2021-01-01 · Shiau Hong Lim, Ilyas Malik

We address the problem of learning a risk-sensitive policy based on the CVaR risk measure using distributional reinforcement learning. In particular, we show that applying the distributional Bellman optimality operator w…

Distributional Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Conservative Exploration in Reinforcement Learning

2020-02-08 · Evrard Garcelon, Mohammad Ghavamzadeh, Alessandro Lazaric, Matteo Pirotta

While learning in an unknown Markov Decision Process (MDP), an agent should trade off exploration to discover new information about the MDP, and exploitation of the current knowledge to maximize the reward. Although the …

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Considering pricing and uncertainty in designing a reverse logistics network

2019-09-17

Companies try to maximize their profits by recovering returned products of highly uncertain quality and quantity. In this paper, a reverse logistics network for an Original Equipment Manufacturer (OEM) is presented. Retu…

COPlanner: Plan to Roll Out Conservatively but to Explore Optimistically for Model-Based RL

2023-10-11 · Xiyao Wang, Ruijie Zheng, Yanchao Sun, Ruonan Jia 외

Dyna-style model-based reinforcement learning contains two phases: model rollouts to generate sample for policy learning and real environment exploration using current policy for dynamics model learning. However, due to …

continuous-controlContinuous ControlModel-based Reinforcement LearningModel Predictive Control