arXiv (All)
open access
Mixing Regularization for Average-Reward $Q$-Learning and $Q$-Planning
The average-reward setting for reinforcement learning is challenging because its Bellman operator is known to contract in span only when the underlying Markov chain is mixing. Whereas existing work typically assumes a contraction property, e.g., through environment mixing, we consider the setting wh
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
- Advanced Policies: A First-Principles Path from Policy Gradient to Q-Learning#1117185
- Q-learning#7267
- Soft Fitted Q-Iteration without Bellman Completeness: Occupancy Reweighting and Temperature Annealing#798711
- Soft Fitted Q-Iteration without Bellman Completeness: Occupancy Reweighting and Temperature Annealing#797297
- Redesigning Regularization for Effective Policy Smoothing#1343603
Record · ID 1325884
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