arXiv (All)
open access
Fast Regularized Policy Mirror Descent with One-Step TD Updates
Policy mirror descent (PMD) enjoys fast convergence in regularized Markov decision processes (MDPs), but existing guarantees often rely on exact or increasingly accurate policy evaluation. We analyze PMD coupled with a persistent critic advanced by one temporal-difference (TD) update. For finite dis
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
- Regularized Emphatic Temporal-Difference Learning: Stability under Constant Stepsizes#1013771
- ReSPO: Reshaped Sequence Policy Optimization for Gradient Starvation in Off-Policy Learning#1130021
- Decision Titan: Test-Time Training for Long-Term Memory in Offline Reinforcement Learning#1156785
- SpecRoll: Fast-Slow Verifier-Feedback Adaptation for Speculative Reinforcement Learning Rollouts#429370
- Sample Efficient Hierarchical Reinforcement Learning via Best Policy Identification#422271
Record · ID 1145004
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