arXiv:2607.10611cs.LG2026-07中稿 · ICML被引 2

混合加法与乘法更新,让低精度训练更稳定高效

M+Adam: Low-Precision Training via Additive-Multiplicative Optimization

论文配图:M+Adam: Low-Precision Training via Additive-Multiplicative Optimization
图 1 · 摘自论文原文
  • 结合加法与乘法更新机制,应对不同权重大小的优化难题
  • 在BF16/FP8/FP4下训练60M-1B模型,准确率显著提升
  • 适合追求低精度训练效率的模型部署与推理场景

低精度训练可降低计算成本,但常导致准确率下降,尤其在无高精度副本存储的情况下。我们发现关键问题:低精度下标准优化器易陷入停滞,尤其在大权重值时因尾数分辨率粗糙而失效。此前提出的乘法更新虽在极低精度下有效,但在零附近和符号变化处表现不佳。加法与乘法更新的失败模式互补。为此,我们提出M+Adam,融合两种更新方式:加法步处理符号变化和小值区域,乘法步保障大值区域的优化进展。理论证明在标准光滑性假设下具备单调下降性质。在60M至1B规模的LLaMA风格预训练中,使用1x-8x Chinchilla预算及仅BF16、FP8、FP4主权重,M+Adam始终显著提升低精度训练效果。

原文摘要 · Abstract (English)

Training with quantized weights can reduce costs but often results in degraded accuracy, especially when optimization is carried out in low precision, without storing high-precision copies. We identify a key failure mode: under low precision, standard optimizers can get stuck and not make progress, especially at large weight magnitudes due to coarse mantissa resolution. To overcome this, multiplicative updates have been previously proposed, in place of additive updates in standard optimizers. While successful under extremely low precision, such as under the logarithmic number system, they suffer from failures near zero and across sign changes. The failure modes of additive and multiplicative updates are therefore complementary. To exploit this, we propose M+Adam, which combines both update types: additive steps handle sign changes and small magnitudes, while multiplicative steps ensure progress at large magnitudes when additive updates are zeroed out under rounding. We prove monotone descent for M+Adam under standard smoothness assumptions. Across LLaMA-style pretraining with 60M-1B models, 1x-8x Chinchilla budgets, and using only BF16, FP8, and FP4 master weights, M+Adam consistently improves low-precision training.

低精度训练优化器设计量化

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