Near-Optimal Sample Complexity for Recursive Entropic Risk Reinforcement Learning with a Generative Model

Amirparsa Bahrami, Oliver Mortensen, Mohammad Sadegh Talebi

In this paper, we study the sample complexities of value and policy learning in finite discounted Markov decision processes (MDPs) under recursive entropic risk preferences with ri…