Proximal Stochastic Recursive Momentum Methods for Nonconvex Composite Decentralized Optimization
Gabriel Mancino-Ball, Shengnan Miao, Yangyang Xu, Jie Chen
Abstract
Consider a network of N decentralized computing agents collaboratively solving a nonconvex stochastic composite problem. In this work, we propose a single-loop algorithm, called DEEPSTORM, that achieves optimal sample complexity for this setting. Unlike double-loop algorithms that require a large batch size to compute the (stochastic) gradient once in a while, DEEPSTORM uses a small batch size, creating advantages in occasions such as streaming data and online learning. This is the first method achieving optimal sample complexity for decentralized nonconvex stochastic composite problems, requiring O(1) batch size. We conduct convergence analysis for DEEPSTORM with both constant and diminishing step sizes. Additionally, under proper initialization and a small enough desired solution error, we show that DEEPSTORM with a constant step size achieves a network-independent sample complexity, with an additional linear speed-up with respect to N over centralized methods. All codes are made available at https://github.com/gmancino/DEEPSTORM.
BibTeX
@article{Mancino-Ball_Miao_Xu_Chen_2023, title={Proximal Stochastic Recursive Momentum Methods for Nonconvex Composite Decentralized Optimization}, volume={37}, url={https://ojs.aaai.org/index.php/AAAI/article/view/26087}, DOI={10.1609/aaai.v37i7.26087}, abstractNote={Consider a network of N decentralized computing agents collaboratively solving a nonconvex stochastic composite problem. In this work, we propose a single-loop algorithm, called DEEPSTORM, that achieves optimal sample complexity for this setting. Unlike double-loop algorithms that require a large batch size to compute the (stochastic) gradient once in a while, DEEPSTORM uses a small batch size, creating advantages in occasions such as streaming data and online learning. This is the first method achieving optimal sample complexity for decentralized nonconvex stochastic composite problems, requiring O(1) batch size. We conduct convergence analysis for DEEPSTORM with both constant and diminishing step sizes. Additionally, under proper initialization and a small enough desired solution error, we show that DEEPSTORM with a constant step size achieves a network-independent sample complexity, with an additional linear speed-up with respect to N over centralized methods. All codes are made available at https://github.com/gmancino/DEEPSTORM.}, number={7}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Mancino-Ball, Gabriel and Miao, Shengnan and Xu, Yangyang and Chen, Jie}, year={2023}, month={Jun.}, pages={9055-9063} }