arXiv CS
open access
Non-asymptotic Convergence of Average-reward Q-learning with Options
We study the finite-sample convergence of Q-learning algorithms for the average-reward formulation of Reinforcement Learning (RL) with options. While options allow temporarily extended and hierarchical actions, the average-reward formulation incorporates continual tasks beyond discounted and episodi
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
- Non-asymptotic Convergence of Average-reward Q-learning with Options#1355274
- From Policy Evaluation to Off-Policy Control: Provable Emergence of In-Context Q-Learning#1343251
- Fitted Q-Iteration with Continuous Actions and Adaptive Data: Smoothed Coverage and Minimax Rates#1342470
- Reinforcement Learning with Segment Reward Feedback under Linear Function Approximation#1218006
- CARM: Cancellation-Aware Response Masking for LLM Reinforcement Learning#1161044
Record · ID 1336021
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