Overview

Stochastic approximation studies how repeated updates based on noisy samples can find solutions to optimization, root-finding, and fixed-point problems, including those in reinforcement learning. Common approaches include Polyak–Ruppert averaging, two-time-scale updates, variance reduction, and Lyapunov or Poisson-equation analyses to control noise and dependence. Current work develops finite-time convergence and uncertainty guarantees for settings such as Markovian data, heavy-tailed noise, and asynchronous updates. A central challenge is to obtain sharp, reliable rates without restrictive assumptions on smoothness, stability, or noise.

Latest papers

CardsList

76 papers13 papers in the last four weeks, level with the four weeks before. 0.1% of all new papers.

  1. Stochastic approximation in non-markovian environments revisited

    Mar 22, 2026Vivek Shripad BorkarStochastic ApproximationContinual Learning

  2. Heavy-Tailed and Long-Range Dependent Noise in Stochastic Approximation: A Finite-Time Analysis

    Mar 20, 2026Siddharth Chandak, Anuj Yadav, Ayfer Ozgur +1Stochastic ApproximationStochastic Optimization Convergence

  3. Convergence of Two Time-Scale Stochastic Approximation: A Martingale Approach

    Mar 15, 2026Mathukumalli VidyasagarStochastic ApproximationTwo-Timescale Stochastic Approximation

  4. Convergence Rate of a Functional Learning Method for Contextual Stochastic Optimization

    Mar 13, 2026Noel Smith, Andrzej RuszczynskiStochastic OptimizationStochastic Approximation

  5. Generalized Random Direction Newton Algorithms for Stochastic Optimization

    Feb 23, 2026Soumen Pachal, Prashanth L. A., Shalabh Bhatnagar +1Stochastic OptimizationStochastic Optimization Convergence

  6. Regret and Sample Complexity of Online Q-Learning via Concentration of Stochastic Approximation with Time-Inhomogeneous Markov Chains

    Feb 18, 2026Rahul Singh, Siddharth Chandak, Eric Moulines +2Regret Minimization in RLQ-Learning

  7. Constant-Stepsize Stochastic Approximation: Finite-Time Convergence, Gaussian Approximation, and Tail Bounds

    Feb 15, 2026Zedong Wang, Yuyang Wang, Ijay Narang +3Stochastic ApproximationStochastic Gradient Descent

  8. Rethinking Langevin Thompson Sampling from A Stochastic Approximation Perspective

    Oct 6, 2025Weixin Wang, Haoyang Zheng, Guang Lin +2Thompson SamplingMulti-Armed Bandits

  9. Uniform-in-time convergence bounds for Persistent Contrastive Divergence algorithms

    Oct 2, 2025Paul Felix Valsecchi Oliva, O. Deniz Akyildiz, Andrew DuncanParameter EstimationStochastic Approximation

  10. A Kernel-based Stochastic Approximation Framework for Nonlinear Operator Learning

    Sep 14, 2025Jia-Qi Yang, Lei ShiStochastic ApproximationReproducing Kernel Hilbert Spaces

  11. Towards Weaker Variance Assumptions for Stochastic Optimization

    Apr 14, 2025Ahmet Alacaoglu, Yura Malitsky, Stephen J. WrightStochastic OptimizationLast-Iterate Convergence

  12. Nonasymptotic CLT and Error Bounds for Linear Two-Time-Scale Stochastic Approximation

    Feb 14, 2025Seo Taek Kong, Sihan Zeng, Thinh T. Doan +1Stochastic ApproximationTwo-Timescale Stochastic Approximation

  13. Statistical Inference for Policy Evaluation with Temporal Difference Learning

    Oct 21, 2024Weichen Wu, Gen Li, Yuting Wei +1Parameter EstimationConfidence Region Estimation