UniMoMo: Expert Merging-Based MoE Acceleration for Large Recommendation Models
On the map: Mixture-of-experts → MoE for recommender systems
Abstract (arXiv)
Sparse mixture-of-experts (MoE) layers expand recommendation capacity through conditional computation, yet a trained checkpoint still stores and routes over its full expert bank. We study a deployment problem: convert that checkpoint to a smaller standard MoE under an explicit expert budget, without adding a compression-specific online module. To address this, we introduce UniMoMo, a post-training compression framework formulated as a constrained graph coarsening problem. Rather than relying on parameter distance, UniMoMo groups experts based on their functional similarity, using an unlabeled calibration set to measure how similarly experts respond to shared recommendation states. To prevent performance degradation, we introduce a layer-adaptive protection mechanism that restricts the merging of high-traffic experts based on their routing exposure. Across Amazon Beauty, KuaiRec, and TenRec with 2, 4, and 6 MoE blocks, the final four-expert checkpoints obtain source-relative five-run mean NDCG@10 ratios of 99.92%--102.30% and measured A100 speedups of 1.28×--1.63×. An aggressive two-expert, top-1 operating point obtains ratios of 98.36%--104.24% and speedups of 1.47×--2.21×. These endpoint results evaluate the complete conversion-and-adaptation workflow and show that a trained recommendation MoE can be exported at multiple serving budgets.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in MoE for recommender systems, one of 12 directions in Mixture-of-experts. Builds on 48 of its 73 references that are in the map. First posted on arXiv 9 Aug 2026.
Builds on
48 of 73 references.
Closest ancestors · 3
Same direction, newest first
- 2026Mixture of Sequence: Theme-Aware Mixture-of-Experts for Long-Sequence Recommendation1 Mar
- 2026SMES: Towards Scalable Multi-Task Recommendation via Expert Sparsity10 Feb
- 2026TokenMixer-Large: Scaling Up Large Ranking Models in Industrial Recommenders6 Feb
Other references · 45
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2024Mixtral of Expertscited by 1,823
- 2020GLU Variants Improve Transformercited by 1,804
- 2018Self-Attentive Sequential Recommendationcited by 1,184
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2017Neural Collaborative Filteringcited by 1,111
- 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 964
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 897
- 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 867
33 more
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2016Wide & Deep Learning for Recommender Systemscited by 747
- 2015Session-based Recommendations with Recurrent Neural Networkscited by 695
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
- 2022Mixture-of-Experts with Expert Choice Routingcited by 623
- 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 476
- 2022DeepSpeed-MoE: Advancing Mixture-of-Experts Inference and Training to Power Next-Generation AI Scalecited by 404
- 2022ST-MoE: Designing Stable and Transferable Sparse Expert Modelscited by 399
- 2017Deep & Cross Network for Ad Click Predictionscited by 393
- 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 338
- 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 327
- 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 320
- 2021BASE Layers: Simplifying Training of Large, Sparse Modelscited by 320
- 2023From Sparse to Soft Mixtures of Expertscited by 248
- 2021Hash Layers For Large Sparse Modelscited by 237
- 2022MegaBlocks: Efficient Sparse Training with Mixture-of-Expertscited by 209
- 2021MoEfication: Transformer Feed-forward Layers are Mixtures of Expertscited by 152
- 2021DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learningcited by 115
- 2022KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systemscited by 96
- 2022Filter-enhanced MLP is All You Need for Sequential Recommendationcited by 96
- 2024Wukong: Towards a Scaling Law for Large-Scale Recommendationcited by 74
- 2025RankMixer: Scaling Up Ranking Models in Industrial Recommenderscited by 42
- 2023Merging Experts into One: Improving Computational Efficiency of Mixture of Expertscited by 37
- 2024Retraining-Free Merging of Sparse MoE via Hierarchical Clusteringcited by 35
- 2025Ivy-Fake: A Unified Explainable Framework and Benchmark for Image and Video AIGC Detectioncited by 34
- 2025HiDe-LLaVA: Hierarchical Decoupling for Continual Instruction Tuning of Multimodal Large Language Modelcited by 31
- 2025Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Mergingcited by 28
- 2025PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Sparse Expert Merging and Bit-packed inferencecited by 9
- 2026Fake-HR1: Rethinking Reasoning of Vision Language Model for Synthetic Image Detectioncited by 8
- 2026Venus-DeFakerOne: Unified Fake Image Detection & Localizationcited by 8
- 2023Mixture of Tokens: Continuous MoE through Cross-Example Aggregationcited by 5
- 2025TabDSR: Decompose, Sanitize, and Reason for Complex Numerical Reasoning in Tabular Datacited by 5
- 2026Beyond Human Annotation: Recent Advances in Data Generation Methods for Document Intelligencecited by 4
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2026Hierarchical Mixture-of-Experts with Two-Stage Optimization
- 2026Shape Mutating Expert Compression:LorExperts and BTExperts
- 2026Dense Mixture-of-Experts as a Reparameterized Wide FFN: A Granularity Sweep at Fixed Compute
- 2026Beyond Routing: Decoupling Expert Dispatch and Aggregation in Sparse Mixture-of-Experts
- 2026Towards a Statistical Understanding of Mixture-of-Experts
- 2026Share First, Route What Remains: A Unified Framework for Token-Adaptive MoE Computation
- 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques
- 2026Effective MoE-based LLM Compression by Exploiting Heterogeneous Inter-Group Experts Routing Frequency and Information Density