arXiv (All)
open access
Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning
We study episodic reinforcement learning with fixed reward and transition functions, but with episode-dependent admissible action sets that are observed at the start of each episode. Performance is measured by cumulative regret against the episode-wise optimal value, $\sum_{k=1}^K [V^{*,M^k} - V^{π^
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
- PRICE the Action Chunks: Physical Relational Credit Assignment for Embodied Reinforcement Learning#1143491
- Official Review · ICLR 2026#787023
- MaPP: A Unified Marginalized Posterior-Predictive Framework for Data-Efficient RLVR#1129594
- Cliff: Learning Process Rewards from the First Mistake#924942
- Cliff: Learning Process Rewards from the First Mistake#920708
Record · ID 1142688
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