Unbiased Gradient Estimation with Balanced Assignments for Mixtures of Experts
Wouter Kool, Chris J. Maddison, Andriy Mnih

TL;DR
This paper introduces two unbiased gradient estimators for training large-scale mixture of experts models, improving robustness and correctness over biased methods by using principled stochastic assignment procedures.
Contribution
It proposes novel unbiased estimators based on balanced assignment sampling, addressing biases in existing mixture of experts training methods.
Findings
Skip-estimator outperforms balanced sampling in toy experiments
Both estimators are more robust than biased alternatives
Unbiased estimators improve training accuracy and reliability
Abstract
Training large-scale mixture of experts models efficiently on modern hardware requires assigning datapoints in a batch to different experts, each with a limited capacity. Recently proposed assignment procedures lack a probabilistic interpretation and use biased estimators for training. As an alternative, we propose two unbiased estimators based on principled stochastic assignment procedures: one that skips datapoints which exceed expert capacity, and one that samples perfectly balanced assignments using an extension of the Gumbel-Matching distribution [29]. Both estimators are unbiased, as they correct for the used sampling procedure. On a toy experiment, we find the `skip'-estimator is more effective than the balanced sampling one, and both are more robust in solving the task than biased alternatives.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Advanced Bandit Algorithms Research · Machine Learning and Data Classification
