Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
<|reference_start|>Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics: In distributed stochastic optimization, where parallel and asynchronous methods are employed, we establish optimal time complexities under virtually any computation behavior of workers/devices/CPUs/GPUs, capturing potential disconnections due to hardware and network delays, time-varying computation powers, and any possible fluctuations and trends of computation speeds. These real-world scenarios are formalized by our new universal computation model. Leveraging this model and new proof techniques, we discover tight lower bounds that apply to virtually all synchronous and asynchronous methods, including Minibatch SGD, Asynchronous SGD (Recht et al., 2011), and Picky SGD (Cohen et al., 2021). We show that these lower bounds, up to constant factors, are matched by the optimal Rennala SGD and Malenia SGD methods (Tyurin & Richt\'arik, 2023).<|reference_end|>
@article{tyurin2024tight,
    title={Tight Time Complexities in Parallel Stochastic Optimization with
  Arbitrary Computation Dynamics},
    author={Alexander Tyurin},
    journal={arXiv preprint arXiv:2408.04929},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.04929},
    primaryClass={math.OC cs.CC}
}