PapersWithELO
← ICLR 2024 leaderboard

Sparse Backpropagation for MoE Training

Liyuan Liu, Jianfeng Gao, Weizhu Chen

general MLMixture-of-ExpertMoESparsityBackpropagationStraight Through
89.60100
Fused
band ≈ ±14 pct pts (from σ = 0.28)
88.80100
Mimo
band ≈ ±20 pct pts (from σ = 0.40)
91.40100
DeepSeek
band ≈ ±20 pct pts (from σ = 0.40)

OpenReview ground truth

Rejected

TL;DR — We introduce SparseMixer, a scalable gradient estimator that bridges the gap between backpropagation and sparse expert routing.

Abstract

One defining characteristic of Mixture-of-Expert (MoE) models is their capacity for conducting sparse computation via expert routing, leading to remarkable scalability. However, backpropagation, the cornerstone of deep learning, requires dense computation, thereby posting challenges in MoE gradient computations. Here, we introduce SparseMixer, a scalable gradient estimator that bridges the gap between backpropagation and sparse expert routing. Unlike typical MoE training which strategically neglects certain gradient terms for the sake of sparse computation and scalability, SparseMixer provides scalable gradient approximations for these terms, enabling reliable gradient estimation in MoE training. Grounded in a numerical ODE framework, SparseMixer harnesses the mid-point method, a second-order ODE solver, to deliver precise gradient approximations with negligible computational overhead. Applying SparseMixer to Switch Transformer on both pre-training and machine translation tasks, SparseMixer showcases considerable performance gain, accelerating training convergence by up to 2 times.

Author context

Most prolific author: 13 submissions (credibility 0.86).

No mass-submission penalty for this paper (authors within normal submission volume).

Aggregate statistics only — no individual author rankings.

Ranking trajectory

Percentile by tournament round — convergence indicates rating stability.

Judge assessments

Mean overall score 0.0 ± 0.0 (n = 40)