Stochastic Approximation
Stochastic approximation (SA) is an iterative method for finding the root of an operator using noisy observations, crucial for solving optimization problems where exact gradients are unavailable. Current research emphasizes improving SA's efficiency and robustness, focusing on variance reduction techniques, adaptive step sizes, and handling Markovian noise and delays in various settings, including distributed and federated learning, reinforcement learning, and temporal difference learning. These advancements are significant for tackling large-scale optimization problems in diverse fields, leading to improved algorithms with stronger convergence guarantees and enhanced applicability to real-world scenarios.
Papers
September 6, 2022
August 15, 2022
July 11, 2022
July 10, 2022
July 9, 2022
June 21, 2022
June 17, 2022
June 14, 2022
June 8, 2022
June 1, 2022
May 18, 2022
May 3, 2022
March 3, 2022
February 23, 2022
February 12, 2022
January 29, 2022
December 27, 2021
December 23, 2021