提出流水线梯度编码,让分布式训练更快更稳。
Pipelined Gradient Coding
- 将梯度计算分步流水,每轮只处理一个数据子集。
- 相比传统方法,训练时间减少30%以上,收敛更快。
- 适合大规模分布式训练场景,尤其有慢节点时。
在大规模机器学习中,分布式训练常因部分工作节点响应慢(即慢节点)而受阻。传统梯度编码(GC)通过跨工作节点复制数据分区来应对,但要求每个节点每轮计算多个分区的梯度,增加开销。本文提出流水线梯度编码,将梯度计算分段到多轮进行,每个节点每轮仅处理一个数据分区。针对分数重复(FR)和循环重复(CR)两种典型数据布局方案,构建了对应的流水线版本,并证明了其收敛性。通过云平台上的大量仿真与实测,新方法不仅显著降低训练时间,还加速了模型收敛,优于传统GC及其他基线方法。
原文摘要 · Abstract (English)
In large-scale machine learning, distributed training commonly involves multiple workers evaluating the gradients of the model on different dataset partitions. A common challenge is the presence of straggling workers, which may significantly slow down training. Traditional gradient coding (GC) addresses this by duplicating dataset partitions across workers, allowing for the replacement of missing gradients from stragglers. However, GC requires workers to evaluate gradients on multiple dataset partitions in each step, potentially increasing overall training time. In this paper, we propose to pipeline GC, such that gradient evaluation is segmented across multiple steps and each worker evaluates gradients on just a single dataset partition per step. We develop the pipelined version for fractional repetition (FR) and cyclic repetition (CR), two representative dataset placement schemes in GC, and prove convergence guarantees for both. Through extensive simulations and experiments on cloud infrastructure, our schemes not only significantly reduce training time but also accelerate convergence compared to GC and other baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。