arXiv:2602.03515cs.LGcs.AI2026-02被引 2

通过旋转坐标系解决异步流水线训练中的梯度延迟问题

Mitigating Staleness in Asynchronous Pipeline Parallelism via Basis Rotation

  • 将优化器坐标系旋转至海森矩阵特征基,对齐模型优化方向
  • 训练30亿参数大模型时,减少81.7%迭代次数
  • 适合大规模分布式训练、追求高硬件利用率的研究者

异步流水线并行通过消除同步执行中的流水线空洞,最大化硬件利用率,为大规模分布式训练提供高效路径。然而,梯度延迟会引入噪声,削弱优化效果。我们发现一个关键但常被忽视的问题:延迟随流水线深度线性增长,从根本上损害了该方法本应实现的可扩展性。根源在于优化景观中海森矩阵特征基与标准坐标基的错位,导致坐标自适应优化器更新轨迹产生振荡。这种振荡使延迟更新偏离真实值,使其在当前迭代中失效。理论分析表明,基错位会放大延迟惩罚;实证验证支持该结论。为此,我们提出基旋转框架,将优化器坐标系旋转至海森矩阵特征基,使延迟更新仍具有效性。理论上证明基旋转可最小化基错位,从而抵消延迟惩罚放大条件。在训练最大达30亿参数的大语言模型时,相比最优异步基线,基旋转将所需迭代次数减少81.7%。

原文摘要 · Abstract (English)

Asynchronous pipeline parallelism maximizes hardware utilization by eliminating the pipeline bubbles inherent in synchronous execution, offering a path toward efficient large-scale distributed training. However, this efficiency gain can be compromised by gradient staleness, where the immediate model updates with delayed gradients introduce noise into the optimization process. Crucially, we identify a critical, yet often overlooked, pathology: this delay scales linearly with pipeline depth, fundamentally undermining the very scalability that the method originally intends to provide. We trace this pathology to a specific property of the optimization landscape: the misalignment between the Hessian eigenbasis and the standard coordinate basis, which triggers oscillations in the update trajectories of coordinate-wise adaptive optimizers. We identify that these oscillations cause delayed updates to diverge from their true counterparts, invalidating their use for current iterations. This insight is formalized through theoretical analysis, including a convergence bound showing that basis misalignment amplifies the delay penalty, and substantiated with empirical evaluation. To address this, we propose basis rotation, a framework that rotates the optimizer's coordinate system to align with the Hessian eigenbasis, keeping delayed updates useful. We theoretically demonstrate that basis rotation minimizes basis misalignment, thereby counteracting the conditions that amplify delay penalties. Empirically, in training up to a 3B-parameter LLM, basis rotation reduces the required iterations by 81.7\% compared to the best-performing asynchronous baseline.

异步训练流水线并行梯度延迟

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。