ResearchTrend.AI
Regret Bounds for Markov Decision Processes with Recursive Optimized Certainty Equivalents

Regret Bounds for Markov Decision Processes with Recursive Optimized Certainty Equivalents

Wenkun Xu
Xuefeng Gao
X. He
ArXivPDFHTML

Papers citing "Regret Bounds for Markov Decision Processes with Recursive Optimized Certainty Equivalents"

4 / 4 papers shown
Title
Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model
Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model
Zilong Deng
Simon Khan
Shaofeng Zou
54
0
0
11 Mar 2025
Planning and Learning in Risk-Aware Restless Multi-Arm Bandit Problem
Planning and Learning in Risk-Aware Restless Multi-Arm Bandit Problem
Nima Akbarzadeh
Erick Delage
Yossiri Adulyasak
32
0
0
30 Oct 2024
Provable Risk-Sensitive Distributional Reinforcement Learning with General Function Approximation
Provable Risk-Sensitive Distributional Reinforcement Learning with General Function Approximation
Yu Chen
Xiangcheng Zhang
Siwei Wang
Longbo Huang
34
3
0
28 Feb 2024
Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learning
Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learning
Yingjie Fei
Zhuoran Yang
Yudong Chen
Zhaoran Wang
36
46
0
06 Nov 2021