arXiv (All)
open access
Nonasymptotic CLT and Error Bounds for Linear Two-Time-Scale Stochastic Approximation
We consider linear two-time-scale stochastic approximation algorithms driven by martingale noise. Recent applications in machine learning motivate the need to understand finite-time error rates, but conventional stochastic approximation analyses focus on either asymptotic convergence in distribution
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
- An error bound-based convergence analysis framework for a class of randomized algorithms#798805
- An error bound-based convergence analysis framework for a class of randomized algorithms#797391
- Numerical Ergodicity and Uniform Estimate of Monotone SPDEs Driven by Multiplicative Noise#821640
- Bias Reduction by Multiscale Quasi-Interpolation for Scalar- and Manifold-Valued Functions#1084035
- Zero Noise Limit for Multidimensional SDEs Driven by a Pointy Gradient#202797
Record · ID 821683
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