HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Experts
On the map: Mixture-of-experts → Expert routing strategies
Abstract (arXiv)
Sparse Mixture-of-Experts (MoE) layers route tokens through a handful of experts, and learning-free compression of these layers reduces inference cost without retraining. A subtle obstruction blocks every existing compressor in this family: three experts can each be pairwise compatible yet form an irreducible cycle when merged together, so any score that ranks experts on pairwise signals is structurally blind to which triples are jointly mergeable. We show the obstruction is a precise mathematical object, the harmonic kernel of the simplicial Laplacian on a 2-complex whose vertices are experts, whose edges carry KL merge barriers, and whose faces carry triplet barriers; Hodge-decomposing the edge-barrier signal isolates the kernel exactly. We turn the diagnostic into a selection objective: HodgeCover greedily covers the harmonic-critical edges and triplet-critical triangles, and a hybrid variant of HodgeCover pairs it with off-the-shelf weight pruning on survivors. On three open-weight Sparse MoE backbones under aggressive expert reduction, HodgeCover matches state-of-the-art learning-free baselines on the expert-reduction axis, leads on the aggressive-compression frontier of the hybrid axis, and uniquely balances retained mass across all four Hodge components. These results show that exposing the harmonic kernel of a learned MoE structure changes which compressor wins at the regime that matters most.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 53 of its 70 references that are in the map. First posted on arXiv 13 May 2026.
Builds on
53 of 70 references.
Closest ancestors · 3
Same direction, newest first
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy2 Oct
- 2022Meta-DMoE: Adapting to Domain Shift by Meta-Distillation from Mixture-of-Experts8 Oct
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan
Other references · 50
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
38 more
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2024Mixtral of Expertscited by 1,785
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2018Hypergraph Neural Networkscited by 482
- 2023OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Modelscited by 403
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2024OLMoE: Open Mixture-of-Experts Language Modelscited by 291
- 2019Hypergraph Convolution and Hypergraph Attentioncited by 226
- 2021Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networkscited by 219
- 2022Sparse Upcycling: Training Mixture-of-Experts from Dense Checkpointscited by 207
- 2014Learning Fine-grained Image Similarity with Deep Rankingcited by 189
- 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 187
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Modelscited by 140
- 2020Topology of deep neural networkscited by 111
- 2016Higher-order organization of complex networkscited by 109
- 2020Simplicial Neural Networkscited by 105
- 2021Topological Graph Neural Networkscited by 86
- 2018Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplaciancited by 84
- 2018Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topologycited by 73
- 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Routercited by 58
- 2024MoE-I2: Compressing Mixture of Experts Models through Inter-Expert Pruning and Intra-Expert Low-Rank Decompositioncited by 57
- 2024Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costscited by 51
- 2025REAP the Experts: Why Pruning Prevails for One-Shot MoE compressioncited by 40
- 2024Retraining-Free Merging of Sparse MoE via Hierarchical Clusteringcited by 31
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruningcited by 30
- 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniquescited by 24
- 2014Hypergraph Markov Operators, Eigenvalues and Approximation Algorithmscited by 9
- 2026REAM: Merging Improves Pruning of Experts in LLMscited by 9
- 2026EvoESAP: Non-Uniform Expert Pruning for Sparse MoEcited by 7
- 2023Disentangling the Spectral Properties of the Hodge Laplacian: Not All Small Eigenvalues Are Equalcited by 5
- 2026AIMER: Calibration-Free Task-Agnostic MoE Expert Pruningcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Dense Mixture-of-Experts as a Reparameterized Wide FFN: A Granularity Sweep at Fixed Compute
- 2026Variational Inference, Entropy, and Orthogonality: A Unified Theory of Mixture-of-Experts
- 2024Beyond Parameter Count: Implicit Bias in Soft Mixture of Experts
- 2026Shared Low-rank Basis Factorization for Data-free Mixture-of-Experts Compression
- 2026Shape Mutating Expert Compression:LorExperts and BTExperts
- 2026Grassmannian Mixture-of-Experts: Concentration-Controlled Routing on Subspace Manifolds
- 2026Beyond Geometric Complementarity: Coherent Overlap in Sparse Mixture-of-Experts Routing
- 2026Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compression