Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy
On the map: Mixture-of-experts → Expert routing strategies
Abstract (arXiv)
Sparsely activated Mixture-of-Experts (SMoE) has shown promise to scale up the learning capacity of neural networks, however, they have issues like (a) High Memory Usage, due to duplication of the network layers into multiple copies as experts; and (b) Redundancy in Experts, as common learning-based routing policies suffer from representational collapse. Therefore, vanilla SMoE models are memory inefficient and non-scalable, especially for resource-constrained downstream scenarios. In this paper, we ask: Can we craft a compact SMoE model by consolidating expert information? What is the best recipe to merge multiple experts into fewer but more knowledgeable experts? Our pilot investigation reveals that conventional model merging methods fail to be effective in such expert merging for SMoE. The potential reasons are: (1) redundant information overshadows critical experts; (2) appropriate neuron permutation for each expert is missing to bring all of them in alignment. To address this, we propose M-SMoE, which leverages routing statistics to guide expert merging. Specifically, it starts with neuron permutation alignment for experts; then, dominant experts and their "group members" are formed; lastly, every expert group is merged into a single expert by utilizing each expert's activation frequency as their weight for merging, thus diminishing the impact of insignificant experts. Moreover, we observed that our proposed merging promotes a low dimensionality in the merged expert's weight space, naturally paving the way for additional compression. Hence, our final method, MC-SMoE (i.e., Merge, then Compress SMoE), further decomposes the merged experts into low-rank and structural sparse alternatives. Extensive experiments across 8 benchmarks validate the effectiveness of MC-SMoE. For instance, our MC-SMoE achieves up to 80% memory and a 20% FLOPs reduction, with virtually no loss in performance.
Key facts. Cited by 108 papers in the map (data through 14 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 65 of its 78 references that are in the map. First posted on arXiv 2 Oct 2023.
Builds on
65 of 78 references.
Closest ancestors · 4
Same direction, newest first
- 2023Soft Merging of Experts with Adaptive Routing6 Jun
- 2023Sparse MoE as the New Dropout: Scaling Dense and Self-Slimmable Transformers2 Mar
- 2022On the Representation Collapse of Sparse Mixture of Experts20 Apr
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan
Other references · 61
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
38 more
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2022Scaling Instruction-Finetuned Language Modelscited by 3,024
- 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,811
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2022DeepSpeed-MoE: Advancing Mixture-of-Experts Inference and Training to Power Next-Generation AI Scalecited by 404
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
- 2022Patching open-vocabulary models by interpolating weightscited by 190
- 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 179
- 2021Efficient Large Scale Language Modeling with Mixtures of Expertscited by 175
- 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 120
- 2021FastMoE: A Fast Mixture-of-Expert Training Systemcited by 112
- 2022Fusing finetuned models for better pretrainingcited by 110
- 2020End-to-End Object Detection with Adaptive Clustering Transformercited by 109
- 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 104
- 2016Topology and Geometry of Half-Rectified Network Optimizationcited by 102
- 2022M3ViT: Mixture-of-Experts Vision Transformer for Efficient Multi-task Learning with Model-Accelerator Co-designcited by 98
- 2022Model Ratatouille: Recycling Diverse Models for Out-of-Distribution Generalizationcited by 97
- 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
- 2021Scalable and Efficient MoE Training for Multitask Multilingual Modelscited by 76
- 2022Task-Specific Expert Pruning for Sparse Mixture-of-Expertscited by 72
- 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
- 2022Re-basin via implicit Sinkhorn differentiationcited by 62
- 2023Knowledge is a Region in Weight Space for Fine-tuned Language Modelscited by 58
- 2022ColD Fusion: Collaborative Descent for Distributed Multitask Finetuningcited by 52
50 most cited of 61 All 61 (JSON)
Built on by
Citing papers per year: 2024: 20; 2025: 42; 2026: 46.
108 papers.
Sort:
By area:
- 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 254
- 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Routercited by 62
- 2024HOBBIT: A Mixed Precision Expert Offloading System for Fast MoE Inferencecited by 55
- 2024LoRA Soups: Merging LoRAs for Practical Skill Composition Taskscited by 52
- 2024A Closer Look into Mixture-of-Experts in Large Language Modelscited by 48
- 2024A Survey on Inference Optimization Techniques for Mixture of Experts Modelscited by 47
- 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Expertscited by 37
- 2024Retraining-Free Merging of Sparse MoE via Hierarchical Clusteringcited by 35
- 2025Delta Decompression for MoE-based LLMs Compressioncited by 33
- 2025Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Mergingcited by 28
- 2024Checkpoint Merging via Bayesian Optimization in LLM Pretrainingcited by 27
- 2024Model Swarms: Collaborative Search to Adapt LLM Experts via Swarm Intelligencecited by 27
38 more
- 2025MoETuner: Optimized Mixture of Expert Serving with Balanced Expert Placement and Token Routingcited by 26
- 2025DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruningcited by 26
- 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMscited by 25
- 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniquescited by 24
- 2025Taming Latency-Memory Trade-Off in MoE-Based LLM Serving via Fine-Grained Expert Offloadingcited by 24
- 2025Finding Fantastic Experts in MoEs: A Unified Study for Expert Dropping Strategies and Observationscited by 20
- 2025MoESD: Unveil Speculative Decoding's Potential for Accelerating Sparse MoEcited by 19
- 2025Unveiling Super Experts in Mixture-of-Experts Large Language Modelscited by 17
- 2024Lynx: Enabling Efficient MoE Inference through Dynamic Batch-Aware Expert Selectioncited by 16
- 2025Domain-Specific Pruning of Large Mixture-of-Experts Models with Few-shot Demonstrationscited by 16
- 2024Mixture of Cache-Conditional Experts for Efficient Mobile Device Inferencecited by 14
- 2026LatentMoE: Toward Optimal Accuracy per FLOP and Parameter in Mixture of Expertscited by 14
- 2025MoNE: Replacing Redundant Experts with Lightweight Novices for Structured Pruning of MoEcited by 13
- 2025GRACE-MoE: Grouping and Replication with Locality-Aware Routing for Efficient Distributed MoE Inferencecited by 13
- 2024SurgeryV2: Bridging the Gap Between Model Merging and Multi-Task Learning with Deep Representation Surgerycited by 12
- 2025ResMoE: Space-efficient Compression of Mixture of Experts LLMs via Residual Restorationcited by 12
- 2024Condense, Don't Just Prune: Enhancing Efficiency and Performance in MoE Layer Pruningcited by 10
- 2025DeRS: Towards Extremely Efficient Upcycled Mixture-of-Experts Modelscited by 10
- 2025HAMoBE: Hierarchical and Adaptive Mixture of Biometric Experts for Video-based Person ReIDcited by 10
- 2025MergeMoE: Efficient Compression of MoE Models via Expert Output Mergingcited by 10
- 2026REAM: Merging Improves Pruning of Experts in LLMscited by 10
- 2024QuantMoE-Bench: Examining Post-Training Quantization for Mixture-of-Expertscited by 9
- 2025Faster MoE LLM Inference for Extremely Large Modelscited by 9
- 2025MoBE: Mixture-of-Basis-Experts for Compressing MoE-based LLMscited by 9
- 2025Accelerating Mixture-of-Expert Inference with Adaptive Expert Split Mechanismcited by 9
- 2025PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Sparse Expert Merging and Bit-packed inferencecited by 9
- 2026EvoESAP: Non-Uniform Expert Pruning for Sparse MoEcited by 9
- 2024Revisiting SMoE Language Models by Evaluating Inefficiencies with Task Specific Expert Pruningcited by 8
- 2025MiLo: Efficient Quantized MoE Inference with Mixture of Low-Rank Compensatorscited by 8
- 2025Not All Models Suit Expert Offloading: On Local Routing Consistency of Mixture-of-Expert Modelscited by 8
- 2025Knowledge Fusion of Large Language Models Via Modular SkillPackscited by 8
- 2025MixNet: A Runtime Reconfigurable Optical-Electrical Fabric for Distributed Mixture-of-Experts Trainingcited by 7
- 2025MoE Pathfinder: Trajectory-driven Expert Pruningcited by 7
- 2026Effective MoE-based LLM Compression by Exploiting Heterogeneous Inter-Group Experts Routing Frequency and Information Densitycited by 7
- 2026SlimQwen: Exploring the Pruning and Distillation in Large MoE Model Pre-trainingcited by 7
- 2024First Activations Matter: Training-Free Methods for Dynamic Activation in Large Language Modelscited by 6
- 2025Efficiently Editing Mixture-of-Experts Models with Compressed Expertscited by 6
- 2026How to Score Experts for One-Shot MoE Expert Pruning: A Unified Formulation and Selection Principlecited by 6
50 most cited of 108 All 108 (JSON)
- 2026SLEM: Spectrum-Aware Latent Expert Merging12 Oct 2026
- 2026The Arbitrary-Placement Problem in Entropy-Minimizing Selection, and a Residual-Entropy Formulation5 Oct 2026
- 2026SPEAR: A Spectral-Disentangled MoE Neural Operator with Knowledge-Guided Expert Aggregation for Large-Scale PDE Pretraining2 Oct 2026
- 2026MoRA: MoE Pruning via Router Bias Learning and Expert Approximation30 Sep 2026
- 2026BASE: Batch-Aware Selection of Experts Using Predicted Removal Error for Efficient MoE Decoding28 Sep 2026
- 2026SlimWise: Decoupling Expert Pruning Across Prefill and Decode for Efficient MoE Serving28 Sep 2026
- 2026Routing Drift Alone Does Not Diagnose Failure in Merged MoE LLMs26 Sep 2026
- 2026RAZOR: Pruning Replaceable Experts in LLMs24 Sep 2026
- 2026PRIME: Frequency-Aware Unified Pruning and Merging for MoE Compression23 Sep 2026
- 2026OMP-MoE: Efficient Expert Pruning for Mixture-of-Experts LLMs via Orthogonal Matching Pursuit9 Sep 2026
- 2026Beyond Retraining-Free MoE Compression: A Cost-Normalized Study of Post-Compression Adjustment5 Sep 2026
- 2026Training-Free Halving of Activated Experts in Fine-Grained Mixture-of-Experts Models4 Sep 2026
38 more
- 2026When Load-Balancing Goes Too Far: Expert Pruning in Over-Dispersed Mixture-of-Experts Models3 Sep 2026
- 2026Residual Sparsification via Output Importance for Compressing Mixture-of-Experts LLMs1 Sep 2026
- 2026ExFold: Unified Expert Folding for Training-Free MoE Prefill-Decode Acceleration24 Aug 2026
- 2026Cacheable by Design? Training Mixture-of-Experts Routers for Locality Against the Edge Memory-Bandwidth Wall: A Pre-Registered Negative Result with a Systems Measurement Study18 Aug 2026
- 2026MAPLE: MoE Adaptive Plug-and-play Layer-wise Expert allocation15 Aug 2026
- 2026Router Sensitivity Under Lightweight Fine-Tuning Identifies Prunable Experts in Mixture-of-Experts Models8 Aug 2026
- 2026Shape Mutating Expert Compression:LorExperts and BTExperts7 Aug 2026
- 2026Beyond Global Routing Aggregation: Phase-Aware Expert Merging for MoE Vision-Language Models5 Aug 2026
- 2026It Takes a MAESTRO To Prune Bad Experts9 Jul 2026
- 2026On the Utility and Factual Reliability of Pruned Mixture-of-Experts Models in the Biomedical Domain1 Jul 2026
- 2026Learning to Recover Task Experts from a Multi-Task Merged Model25 Jun 2026
- 2026Post-Hoc Merging is Not Enough: Many-Shot Model Merging with Loss-Gap Balancing15 Jun 2026
- 2026How to Score Experts for One-Shot MoE Expert Pruning: A Unified Formulation and Selection Principle14 Jun 2026
- 2026Less is MoE: Trimming Experts in Domain-Specialist Language Models4 Jun 2026
- 2026TENP: Trapezoidal Expert Neuron Pruning For Mixture-of-Experts3 Jun 2026
- 2026Pruning and Distilling Mixture-of-Experts into Dense Language Models27 May 2026
- 2026Post-Trained MoE Can Skip Half Experts via Self-Distillation18 May 2026
- 2026BEAM: Binary Expert Activation Masking for Dynamic Routing in MoE14 May 2026
- 2026HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Experts13 May 2026
- 2026SlimQwen: Exploring the Pruning and Distillation in Large MoE Model Pre-training9 May 2026
- 2026Adaptive Inverted-Index Routing for Granular Mixtures-of-Experts6 May 2026
- 2026Does a Global Perspective Help Prune Sparse MoEs Elegantly?8 Apr 2026
- 2026REAM: Merging Improves Pruning of Experts in LLMs6 Apr 2026
- 2026Improving Ensemble Forecasts of Abnormally Deflecting Tropical Cyclones with Fused Atmosphere-Ocean-Terrain Data31 Mar 2026
- 2026DyMoE: Dynamic Expert Orchestration with Mixed-Precision Quantization for Efficient MoE Inference on Edge19 Mar 2026
- 2026AIMER: Calibration-Free Task-Agnostic MoE Expert Pruning19 Mar 2026
- 2026LightMoE: Reducing Mixture-of-Experts Redundancy through Expert Replacing13 Mar 2026
- 2026Mozart: Modularized and Efficient MoE Training on 3.5D Wafer-Scale Chiplet Architectures7 Mar 2026
- 2026EvoESAP: Non-Uniform Expert Pruning for Sparse MoE6 Mar 2026
- 2026MoE-SpAc: Efficient MoE Inference Based on Speculative Activation Utility in Heterogeneous Edge Scenarios12 Feb 2026
- 2026Is Retraining-Free Enough? The Necessity of Router Calibration for Efficient MoE Compression10 Feb 2026
- 2026Effective MoE-based LLM Compression by Exploiting Heterogeneous Inter-Group Experts Routing Frequency and Information Density10 Feb 2026
- 2026Dynamic Expert Sharing: Decoupling Memory from Parallelism in Mixture-of-Experts Diffusion LLMs31 Jan 2026
- 2026LatentMoE: Toward Optimal Accuracy per FLOP and Parameter in Mixture of Experts26 Jan 2026
- 2025MoE Pathfinder: Trajectory-driven Expert Pruning20 Dec 2025
- 2025A Systematic Study of In-the-Wild Model Merging for Large Language Models26 Nov 2025
- 2025Merging without Forgetting: Continual Fusion of Task-Specific Models via Optimal Transport24 Nov 2025
- 2025PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Sparse Expert Merging and Bit-packed inference6 Nov 2025
50 newest of 108 All 108 (JSON)
- 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Routercited by 62
- 2024HOBBIT: A Mixed Precision Expert Offloading System for Fast MoE Inferencecited by 55
- 2024A Closer Look into Mixture-of-Experts in Large Language Modelscited by 48
- 2024A Survey on Inference Optimization Techniques for Mixture of Experts Modelscited by 47
- 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Expertscited by 37
- 2024Retraining-Free Merging of Sparse MoE via Hierarchical Clusteringcited by 35
- 2025Delta Decompression for MoE-based LLMs Compressioncited by 33
- 2025Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Mergingcited by 28
- 2025MoETuner: Optimized Mixture of Expert Serving with Balanced Expert Placement and Token Routingcited by 26
- 2025DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruningcited by 26
- 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMscited by 25
- 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniquescited by 24
12 most cited of 89 All 89 (JSON)
- 2026SLEM: Spectrum-Aware Latent Expert Merging12 Oct 2026
- 2026SPEAR: A Spectral-Disentangled MoE Neural Operator with Knowledge-Guided Expert Aggregation for Large-Scale PDE Pretraining2 Oct 2026
- 2026MoRA: MoE Pruning via Router Bias Learning and Expert Approximation30 Sep 2026
- 2026BASE: Batch-Aware Selection of Experts Using Predicted Removal Error for Efficient MoE Decoding28 Sep 2026
- 2026SlimWise: Decoupling Expert Pruning Across Prefill and Decode for Efficient MoE Serving28 Sep 2026
- 2026Routing Drift Alone Does Not Diagnose Failure in Merged MoE LLMs26 Sep 2026
- 2026RAZOR: Pruning Replaceable Experts in LLMs24 Sep 2026
- 2026PRIME: Frequency-Aware Unified Pruning and Merging for MoE Compression23 Sep 2026
- 2026OMP-MoE: Efficient Expert Pruning for Mixture-of-Experts LLMs via Orthogonal Matching Pursuit9 Sep 2026
- 2026Beyond Retraining-Free MoE Compression: A Cost-Normalized Study of Post-Compression Adjustment5 Sep 2026
- 2026Training-Free Halving of Activated Experts in Fine-Grained Mixture-of-Experts Models4 Sep 2026
- 2026When Load-Balancing Goes Too Far: Expert Pruning in Over-Dispersed Mixture-of-Experts Models3 Sep 2026
12 newest of 89 All 89 (JSON)
- 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 254
- 2024LoRA Soups: Merging LoRAs for Practical Skill Composition Taskscited by 52
- 2024Checkpoint Merging via Bayesian Optimization in LLM Pretrainingcited by 27
- 2024Model Swarms: Collaborative Search to Adapt LLM Experts via Swarm Intelligencecited by 27
- 2024SurgeryV2: Bridging the Gap Between Model Merging and Multi-Task Learning with Deep Representation Surgerycited by 12
- 2025HAMoBE: Hierarchical and Adaptive Mixture of Biometric Experts for Video-based Person ReIDcited by 10
- 2025Knowledge Fusion of Large Language Models Via Modular SkillPackscited by 8
- 2024First Activations Matter: Training-Free Methods for Dynamic Activation in Large Language Modelscited by 6
- 2025CAMEx: Curvature-aware Merging of Expertscited by 5
- 2025A Systematic Study of In-the-Wild Model Merging for Large Language Modelscited by 5
- 2024Low-dimensional approximations of the conditional law of Volterra processes: a non-positive curvature approachcited by 3
- 2025Merging Feed-Forward Sublayers for Compressed Transformerscited by 1
12 most cited of 18 All 18 (JSON)
- 2026The Arbitrary-Placement Problem in Entropy-Minimizing Selection, and a Residual-Entropy Formulation5 Oct 2026
- 2026Learning to Recover Task Experts from a Multi-Task Merged Model25 Jun 2026
- 2026Post-Hoc Merging is Not Enough: Many-Shot Model Merging with Loss-Gap Balancing15 Jun 2026
- 2026Improving Ensemble Forecasts of Abnormally Deflecting Tropical Cyclones with Fused Atmosphere-Ocean-Terrain Data31 Mar 2026
- 2025A Systematic Study of In-the-Wild Model Merging for Large Language Models26 Nov 2025
- 2025Merging without Forgetting: Continual Fusion of Task-Specific Models via Optimal Transport24 Nov 2025
- 2025UNIFORM: Unifying Knowledge from Large-scale and Diverse Pre-trained Models27 Aug 2025
- 2025HAMoBE: Hierarchical and Adaptive Mixture of Biometric Experts for Video-based Person ReID7 Aug 2025
- 2025Knowledge Fusion of Large Language Models Via Modular SkillPacks24 May 2025
- 2025CAMEx: Curvature-aware Merging of Experts26 Feb 2025
- 2025Merging Feed-Forward Sublayers for Compressed Transformers10 Jan 2025
- 2024SurgeryV2: Bridging the Gap Between Model Merging and Multi-Task Learning with Deep Representation Surgery18 Oct 2024
12 newest of 18 All 18 (JSON)
Similar, not cited
Close in wording, no citation either way
- 2025Rethinking Sparse Mixture of Experts from a Unified Perspective
- 2025Improving Routing in Sparse Mixture of Experts with Graph of Tokens
- 2026Eigenvectors of Experts are Training-free Non-collapsing Routers
- 2023Patch-level Routing in Mixture-of-Experts is Provably Sample-efficient for Convolutional Neural Networks
- 2025Selective Sinkhorn Routing for Improved Sparse Mixture of Experts
- 2026Distribution-Consistent Inference for Dynamic Sparse Mixture-of-Experts
- 2024On the Role of Discrete Representation in Sparse Mixture of Experts
- 2024Sparse Mixture-of-Experts for Compositional Generalization: Empirical Evidence and Theoretical Foundations of Optimal Sparsity