04:00
2026-10-07
arxiv.org
machine-learning
Near-Optimal Sample Complexity for Recursive Entropic Risk Reinforcement Learning with a Generative Model
A new arXiv paper (2610.06931v1) derives (ε,δ)-PAC guarantees for model-based risk-sensitive Q-value iteration (MB-RS-QVI) in finite discounted Markov decision processes under recursive entropic risk …