arXiv (All)
open access
A Concentration Bound for Two-Timescale Actor-Critic Algorithm
Significant research effort has been directed in recent years towards establishing both asymptotic and non-asymptotic convergence guarantees for two-timescale actor--critic algorithms, where the actor recursion is run on a slower timescale than the critic recursion. This work derives a uniform all-t
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
- Minimax Last-Iterate Convergence in Matrix Games with Observed Actions#1128916
- Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier#19002
- Sharp Statistical Rates for Asynchronous TD Learning with Markovian Data#1143481
- Q-Learning for Reachability in MEC-Free MDPs#1157052
- Transformer-Empowered Actor-Critic Reinforcement Learning for Sequence-Aware Service Function Chain Partitioning#183234
Record · ID 1077046
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