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

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 risk parameter \(\beta\neq 0\), assuming access to a generative model of the MDP.