ACCO: Accumulate While You Communicate for Communication-Overlapped Sharded LLM Training

Adel Nabli (Mila, Concordia University, Sorbonne University) · Louis Fournier (genbio) · Pierre ERBACHER (Université Pierre et Marie Curie - Paris 6, Sorbonne Université - Faculté des Sciences (Paris VI)) · Louis Serrano (Emmi AI) · Eugene Belilovsky (Concordia University / Mila) · Edouard Oyallon (CNRS/ISIR)
communication overheadconvergence issuesdata parallel setupsdelayed gradientsdistributed implementationsdistributed optimizationheterogeneous hardwarelocal optimization algorithmsmemory efficiencyoptimizer state shardingscalabilitysharded optimizerstraining dynamicszero-1

Training LLMs relies on distributed implementations using multiple GPUs to compute gradients in parallel with sharded optimizers. However, synchronizing gradients in data parallel setups introduces communication overhead that grows with the number of workers, limiting parallelization efficiency. Local optimization algorithms reduce communications but incur high memory costs as they prevent optimizer state sharding, hindering scalability. To address this, we propose $\textbf{AC}$cumulate while $\textbf{CO}$mmunicate ($\texttt{ACCO}$), a memory-efficient optimization algorithm for distributed LLM training. By synchronizing delayed gradients while computing new ones, $\texttt{ACCO}$ reduces GPU idle time and supports heterogeneous hardware. To mitigate the convergence issues caused by delayed updates, we introduce a novel technique ensuring training dynamics align with standard distributed optimization. Compared to ZeRO-1, our approach is significantly faster and scales effectively across heterogeneous hardware.