MindFlayer: Efficient Asynchronous Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times
<|reference_start|>MindFlayer: Efficient Asynchronous Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times: We study the problem of minimizing the expectation of smooth nonconvex functions with the help of several parallel workers whose role is to compute stochastic gradients. In particular, we focus on the challenging situation where the workers' compute times are arbitrarily heterogeneous and random. In the simpler regime characterized by arbitrarily heterogeneous but deterministic compute times, Tyurin and Richt\'arik (NeurIPS 2023) recently designed the first theoretically optimal asynchronous SGD method, called Rennala SGD, in terms of a novel complexity notion called time complexity. The starting point of our work is the observation that Rennala SGD can have arbitrarily bad performance in the presence of random compute times -- a setting it was not designed to handle. To advance our understanding of stochastic optimization in this challenging regime, we propose a new asynchronous SGD method, for which we coin the name MindFlayer SGD. Our theory and empirical results demonstrate the superiority of MindFlayer SGD over existing baselines, including Rennala SGD, in cases when the noise is heavy tailed.<|reference_end|>
@article{maranjyan2024mindflayer:,
    title={MindFlayer: Efficient Asynchronous Parallel SGD in the Presence of
  Heterogeneous and Random Worker Compute Times},
    author={Artavazd Maranjyan, Omar Shaikh Omar, Peter Richt'arik},
    journal={arXiv preprint arXiv:2410.04285},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.04285},
    primaryClass={math.OC cs.DC cs.LG stat.ML}
}