arXiv (All)
open access
Finite-Time Concentration and Convergence Rates for Projected Two-Time-Scale Stochastic Approximation with Markov Noise
We study finite-time concentration and convergence rates for projected two-time-scale stochastic approximation driven by a controlled Markov chain. The averaged fast map is contractive, while the slow iterate is projected onto a compact convex polyhedron. The associated projected ordinary differenti
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
- Optimal mixing of the systematic scan dynamics via approximate tensorization of entropy#972795
- A solution to Morrey's problem in $\mathbb{R}^{2\times m}$#785207
- A solution to Morrey's problem in $\mathbb{R}^{2\times m}$#783616
- Online Convex Optimization with Sublinear Noisy Probes#271829
- The $L^q$-bounds for Derivatives of Unitary Developments of Random Continuous Geometric Rough Paths#975053
Record · ID 1129409
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