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
June 13, 2023
June 2, 2023
May 31, 2023
May 12, 2023
May 11, 2023
May 2, 2023
April 7, 2023
April 3, 2023
March 28, 2023
February 18, 2023
January 11, 2023
December 20, 2022
December 15, 2022
November 8, 2022
October 23, 2022
October 13, 2022
October 11, 2022
October 10, 2022
October 9, 2022