Near-Optimal Sample Complexity for Recursive Entropic Risk Reinforcement Learning with a Generative Model
DGX agentarXiv:2610.06931v1 Announce Type: new Abstract: In this paper, we study the sample complexities of value and policy learning in finite discounted Markov decision processes (MDPs) under recursive entro