Two-Timescale Stochastic Approximation
Overview
Two-timescale stochastic approximation analyzes algorithms in which a fast variable tracks a changing target while a slower variable learns or optimizes using that tracking. It appears in settings such as actor-critic reinforcement learning, bilevel optimization, and stochastic root-finding, where separating update speeds can make complex problems tractable. Researchers use ODE and fast-manifold analyses, martingale and Markov-noise bounds, Lyapunov methods, and Polyak–Ruppert averaging to establish convergence, finite-time error rates, and central limit theorems. A central challenge is that nonlinear tracking bias, heavy-tailed or dependent noise, and projections can slow convergence, so current work studies sharper rate limits and corrections that reduce bias without costly inner loops.
Latest papers
20 papers4 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.