mlsanityData to 7 Oct 2026

More Experts Than Galaxies: Conditionally-overlapping Experts With Biologically-Inspired Fixed Routing

arXiv 2410.08003 ↗First posted 10 Oct 2024cs.LGcited by 2

On the map: Mixture-of-experts → MoE theory and gating functions

Abstract (arXiv)

The evolution of biological neural systems has led to both modularity and sparse coding, which enables energy efficiency and robustness across the diversity of tasks in the lifespan. In contrast, standard neural networks rely on dense, non-specialized architectures, where all model parameters are simultaneously updated to learn multiple tasks, leading to interference. Current sparse neural network approaches aim to alleviate this issue but are hindered by limitations such as 1) trainable gating functions that cause representation collapse, 2) disjoint experts that result in redundant computation and slow learning, and 3) reliance on explicit input or task IDs that limit flexibility and scalability. In this paper we propose Conditionally Overlapping Mixture of ExperTs (COMET), a general deep learning method that addresses these challenges by inducing a modular, sparse architecture with an exponential number of overlapping experts. COMET replaces the trainable gating function used in Sparse Mixture of Experts with a fixed, biologically inspired random projection applied to individual input representations. This design causes the degree of expert overlap to depend on input similarity, so that similar inputs tend to share more parameters. This results in faster learning per update step and improved out-of-sample generalization. We demonstrate the effectiveness of COMET on a range of tasks, including image classification, language modeling, and regression, using several popular deep learning architectures.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. Builds on 47 of its 70 references that are in the map. First posted on arXiv 10 Oct 2024.

Builds on

47 of 70 references.

References · 47

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  2. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  3. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  4. 2016Pointer Sentinel Mixture Modelscited by 2,992
  5. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  6. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  7. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  8. 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,441
  9. 2022Toy Models of Superpositioncited by 928
  10. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  11. 2022Mixture-of-Experts with Expert Choice Routingcited by 611
  12. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
35 more
  1. 2021Dynamic Neural Networks: A Surveycited by 405
  2. 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 362
  3. 2021Hash Layers For Large Sparse Modelscited by 236
  4. 2020Supermasks in Superpositioncited by 223
  5. 2018Task-Free Continual Learningcited by 219
  6. 2019Compacting, Picking and Growing for Unforgetting Continual Learningcited by 207
  7. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
  8. 2022BlenderBot 3: a deployed conversational agent that continually learns to responsibly engagecited by 197
  9. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  10. 2015Conditional Computation in Neural Networks for faster modelscited by 166
  11. 2021DEMix Layers: Disentangling Domains for Modular Language Modelingcited by 130
  12. 2017Routing Networks: Adaptive Selection of Non-linear Functions for Multi-Task Learningcited by 125
  13. 2018Alleviating catastrophic forgetting using context-dependent gating and synaptic stabilizationcited by 104
  14. 2022Sparse Mixture-of-Experts are Domain Generalizable Learnerscited by 85
  15. 2013Deep Learning of Representations: Looking Forwardcited by 84
  16. 2023Can Neural Network Memorization Be Localized?cited by 66
  17. 2019Superposition of many models into onecited by 64
  18. 2023Sparse MoE as the New Dropout: Scaling Dense and Self-Slimmable Transformerscited by 59
  19. 2019Routing Networks and the Challenges of Modular and Compositional Computationcited by 49
  20. 2021Learning Language Specific Sub-network for Multilingual Machine Translationcited by 48
  21. 2018You Look Twice: GaterNet for Dynamic Filter Selection in CNNscited by 46
  22. 2022Is a Modular Architecture Enough?cited by 35
  23. 2022Improving Task-free Continual Learning by Distributionally Robust Memory Evolutioncited by 29
  24. 2021Dynamic Inference with Neural Interpreterscited by 24
  25. 2022Task-Free Continual Learning via Online Discrepancy Distance Learningcited by 22
  26. 2023Adaptive Sharpness-Aware Pruning for Robust Sparse Networkscited by 17
  27. 2018Guided Dropoutcited by 14
  28. 2024Mask in the Mirror: Implicit Sparsificationcited by 12
  29. 2023Continual Learning with Dynamic Sparse Training: Exploring Algorithms for Effective Model Updatescited by 8
  30. 2024Let's Focus on Neuron: Neuron-Level Supervised Fine-tuning for Large Language Modelcited by 8
  31. 2024Active Dendrites Enable Efficient Continual Learning in Time-To-First-Spike Neural Networkscited by 6
  32. 2020KSM: Fast Multiple Task Adaption via Kernel-wise Soft Mask Learningcited by 5
  33. 2023Continual Learning: Forget-free Winning Subnetworks for Video Representationscited by 5
  34. 2022Bioinspired random projections for robust, sparse classificationcited by 4
  35. 2023Investigating the Impact of Weight Sharing Decisions on Knowledge Transfer in Continual Learningcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2023COMET: Learning Cardinality Constrained Mixture of Experts with Trees and Local Search
  2. 2018Deep Mixture of Experts via Shallow Embedding
  3. 2026The Rise of Sparse Mixture-of-Experts: A Survey from Algorithmic Foundations to Decentralized Architectures and Vertical Domain Applications
  4. 2023Soft Merging of Experts with Adaptive Routing
  5. 2026Towards a Statistical Understanding of Mixture-of-Experts
  6. 2024Beyond Parameter Count: Implicit Bias in Soft Mixture of Experts
  7. 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs
  8. 2023Improving Expert Specialization in Mixture of Experts