arXiv (All)
open access
Achieving an $O(1/N)$ Optimality Gap in Average-Reward Weakly-Coupled MDPs
We study average-reward weakly-coupled Markov decision processes (WCMDPs), where a WCMDP consists of $N$ smaller MDPs, called arms, that share multiple per-step budget constraints. We consider the setting where the arms have identical model parameters, multiple actions, and state- and action-depende
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
- Achieving an $O(1/N)$ Optimality Gap in Average-Reward Weakly-Coupled MDPs#1122282
- Optimal Multi-Reward Reinforcement Learning#1131328
- LLMs as a Jury: Cross-Model Consensus Can Outperform Process Reward Models for LLM Reasoning#615092
- LLMs as a Jury: Cross-Model Consensus Can Outperform Process Reward Models for LLM Reasoning#614125
- Wherefore BIC = DIC?#1062123
Record · ID 1142427
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