arXiv (All)
open access
Learning Infinite-Horizon Average-Reward CMDPs via State Augmentation
We study infinite-horizon average-reward constrained Markov decision processes (CMDPs) under the weakly communicating assumption. Existing high-probability guarantees for this setting either require computationally inefficient algorithms or have suboptimal dependence on the number of interactions $T
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
- Soft $Q(λ)$: A multi-step off-policy method for entropy regularised reinforcement learning using eligibility traces#14071
- Solving Robust POMDPs with Omega-regular Objectives via Partially Observable Stochastic Games#1141632
- Near-Optimal Primal-Dual Algorithm for Learning Linear Mixture CMDPs with Adversarial Rewards#1034717
- Le Critique: Privileged Value Functions for LLM Reinforcement Learning#625298
- Le Critique: Privileged Value Functions for LLM Reinforcement Learning#623025
Record · ID 1144060
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