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

arXiv:2610.06931 · cs.LG, stat.ML · Submitted 2026-10-03 · Read on arXiv

cs.LG, stat.ML

Submitted: 2026-10-03

Updated: 2026-10-03

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Generative Model — 1× in this paper · explained in 2 episodes
• Reinforcement Learning — 1× in this paper · explained in 4 episodes
• Sample Complexity — 1× in this paper · explained in 20 episodes

Sources

• Efficient Risk-sensitive Planning via Entropic Risk Measures
• Mitigating optimistic bias in entropic risk estimation and optimization

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks