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
February 27, 2024
February 20, 2024
February 19, 2024
February 6, 2024
January 23, 2024
January 18, 2024
January 17, 2024
January 15, 2024
December 31, 2023
December 18, 2023
December 16, 2023
December 8, 2023
December 5, 2023
October 22, 2023
October 17, 2023
August 25, 2023
August 2, 2023
July 11, 2023
July 5, 2023