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
October 29, 2024
October 21, 2024
October 17, 2024
October 16, 2024
October 14, 2024
September 16, 2024
August 29, 2024
August 19, 2024
May 27, 2024
May 26, 2024
May 23, 2024
May 15, 2024
May 13, 2024
April 21, 2024
April 9, 2024
March 29, 2024
March 25, 2024
March 4, 2024
February 27, 2024