arXiv (All)
open access
Distributionally Robust Average-Reward Reinforcement Learning: Finite-Sample Guarantees under Weak Communication
We study distributionally robust reinforcement learning (DR-RL) in the average-reward setting under weak communication. Our main result provides finite-sample guarantees for estimating the robust optimal average reward and learning a near-optimal policy, covering both SA-rectangular and S-rectangula
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
- Designing Reinforcement Learning for Diffusion Models: A Unified Path-Space View#609600
- Designing Reinforcement Learning for Diffusion Models: A Unified Path-Space View#458271
- Large Language Models Hack Rewards, and Society#1129288
- Shrinking-Tube Concentration for Adaptive Markovian Stochastic Approximation#1077760
- Statistical analysis of Inverse Entropy-regularized Reinforcement Learning#998059
Record · ID 1117058
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