arXiv (All)
open access
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 \(β\neq 0\), assuming access to a generative model of the MDP. We provide a refined analysis of model-based
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Risk-Aware General-Utility Markov Decision Processes#361468
- Risk-aware Markov decision processes using cumulative prospect theory#1066580
- Learning Chance-Constrained MDPs with Bellman Distributional Certificates#1105415
- Learning Infinite-Horizon Average-Reward CMDPs via State Augmentation#1144060
- Policy Gradients for Cumulative Prospect Theory in Reinforcement Learning#974163
Record · ID 1216013
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive