Dropout Regularization in Hierarchical Mixture of Experts
On the map: Mixture-of-experts → MoE theory and gating functions
Abstract (arXiv)
Dropout is a very effective method in preventing overfitting and has become the go-to regularizer for multi-layer neural networks in recent years. Hierarchical mixture of experts is a hierarchically gated model that defines a soft decision tree where leaves correspond to experts and decision nodes correspond to gating models that softly choose between its children, and as such, the model defines a soft hierarchical partitioning of the input space. In this work, we propose a variant of dropout for hierarchical mixture of experts that is faithful to the tree hierarchy defined by the model, as opposed to having a flat, unitwise independent application of dropout as one has with multi-layer perceptrons. We show that on a synthetic regression data and on MNIST and CIFAR-10 datasets, our proposed dropout mechanism prevents overfitting on trees with many levels improving generalization and providing smoother fits.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. Builds on 6 of its 22 references that are in the map. First posted on arXiv 25 Dec 2018.
Builds on
6 of 22 references.
References · 6
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2014Convolutional Neural Networks for Sentence Classificationcited by 1,127
- 2014Recurrent Neural Network Regularizationcited by 189
- 2015A Theoretically Grounded Application of Dropout in Recurrent Neural Networkscited by 161
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 0; 2025: 2; 2026: 1.
6 papers.
- 2022A Survey on Dropout Methods and Experimental Verification in Recommendationcited by 4
- 2025Convergence Rates for Softmax Gating Mixture of Expertscited by 4
- 2022Mixtures of Gaussian Process Experts with SMC2cited by 3
- 2021Shrub Ensembles for Online Classificationcited by 1
- 2025Hypernetwork-Driven Low-Rank Adaptation Across Attention Headscited by 1
- 2026Four Ways to Grow a Classifier and Why One of Them Cannot Learncited by 0
- 2026Four Ways to Grow a Classifier and Why One of Them Cannot Learn16 Sep 2026
- 2025Hypernetwork-Driven Low-Rank Adaptation Across Attention Heads5 Oct 2025
- 2025Convergence Rates for Softmax Gating Mixture of Experts5 Mar 2025
- 2022Mixtures of Gaussian Process Experts with SMC226 Aug 2022
- 2022A Survey on Dropout Methods and Experimental Verification in Recommendation5 Apr 2022
- 2021Shrub Ensembles for Online Classification7 Dec 2021
Similar, not cited
Close in wording, no citation either way
- 2026A Heterogeneous Mixture of Experts Framework for Interpretable Machine Learning
- 2024On Expert Estimation in Hierarchical Mixture of Experts: Beyond Softmax Gating Functions
- 2024Generalization Error Analysis for Sparse Mixture-of-Experts: A Preliminary Study
- 2024Sigmoid Gating is More Sample Efficient than Softmax Gating in Mixture of Experts
- 2025Finding Fantastic Experts in MoEs: A Unified Study for Expert Dropping Strategies and Observations
- 2023Improving Expert Specialization in Mixture of Experts
- 2022Gating Dropout: Communication-efficient Regularization for Sparsely Activated Transformers
- 2022Functional mixture-of-experts for classification