Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression

๐Ÿ“… 2023-05-12
๐Ÿ›๏ธ arXiv.org
๐Ÿ“ˆ Citations: 7
โœจ Influential: 2
๐Ÿ“„ PDF
๐Ÿค– AI Summary
This work investigates the fundamental performance limits of distributed stochastic optimization under communication compression. We establish the first set of tight convergence lower boundsโ€”covering six distinct settings formed by combining strongly convex, convex, and nonconvex objective functions with unbiased and contractive compressors. Building upon these bounds, we propose NEOLITHIC, the first compression-based algorithm achieving near-optimal rates (up to logarithmic factors) across all six settings. NEOLITHIC integrates variance reduction, momentum acceleration, and explicit compressor modeling. We prove theoretically that it matches the derived lower bounds under mild assumptions. Empirical evaluations demonstrate that, in multi-node training, NEOLITHIC reduces communication overhead by 3โ€“5ร— compared to state-of-the-art compressed methods, while significantly improving convergence efficiency.
๐Ÿ“ Abstract
Communication compression is an essential strategy for alleviating communication overhead by reducing the volume of information exchanged between computing nodes in large-scale distributed stochastic optimization. Although numerous algorithms with convergence guarantees have been obtained, the optimal performance limit under communication compression remains unclear. In this paper, we investigate the performance limit of distributed stochastic optimization algorithms employing communication compression. We focus on two main types of compressors, unbiased and contractive, and address the best-possible convergence rates one can obtain with these compressors. We establish the lower bounds for the convergence rates of distributed stochastic optimization in six different settings, combining strongly-convex, generally-convex, or non-convex functions with unbiased or contractive compressor types. To bridge the gap between lower bounds and existing algorithms' rates, we propose NEOLITHIC, a nearly optimal algorithm with compression that achieves the established lower bounds up to logarithmic factors under mild conditions. Extensive experimental results support our theoretical findings. This work provides insights into the theoretical limitations of existing compressors and motivates further research into fundamentally new compressor properties.
Problem

Research questions and friction points this paper is trying to address.

Determine performance limits of distributed stochastic optimization with communication compression.
Establish lower bounds for convergence rates in various optimization settings.
Propose NEOLITHIC algorithm to achieve nearly optimal convergence rates.
Innovation

Methods, ideas, or system contributions that make the work stand out.

Establishes lower bounds for distributed optimization convergence rates.
Proposes NEOLITHIC, a nearly optimal compression algorithm.
Analyzes unbiased and contractive compressors in six settings.
๐Ÿ”Ž Similar Papers
No similar papers found.
๐Ÿ’ผ Related Jobs
No related jobs found.
Peking University | University of Pennsylvania | MetaCarbon Inc. | DAMO Academy | Alibaba Group
Y
Yutong He
Peking University
Xinmeng Huang
Xinmeng Huang
University of Pennsylvania
Y
Yiming Chen
MetaCarbon Inc.
W
W. Yin
DAMO Academy, Alibaba Group
K
K. Yuan
Peking University