paper-with-me

홈 › Papers

HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Experts

2026-05-13 · Tao Zhong, Dongzhe Zheng, Christine Allen-Blanchette 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.

📄 PDF Abstract BibTeX arXiv:2605.13997

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

MANTRA: The Manifold Triangulations Assemblage

2024-10-03 · Rubén Ballester, Ernst Röell, Daniel Bīn Schmid, Mathieu Alain 외

The rising interest in leveraging higher-order interactions present in complex systems has led to a surge in more expressive models exploiting higher-order structures in the data, especially in topological deep learning …

Benchmarking

Quantum Simplicial Neural Networks

2025-01-09 · Simone Piperno, Claudio Battiloro, Andrea Ceschini, Francesca Dominici 외

Graph Neural Networks (GNNs) excel at learning from graph-structured data but are limited to modeling pairwise interactions, insufficient for capturing higher-order relationships present in many real-world systems. Topol…

Deep Learning

Higher-Order Topological Directionality and Directed Simplicial Neural Networks

2024-09-12 · Manuel Lecha, Andrea Cavallo, Francesca Dominici, Elvin Isufi 외

Topological Deep Learning (TDL) has emerged as a paradigm to process and learn from signals defined on higher-order combinatorial topological spaces, such as simplicial or cell complexes. Although many complex systems ha…

Dirac signal processing of higher-order topological signals

2023-01-12 · Lucille Calmon, Michael T. Schaub, Ginestra Bianconi

Higher-order networks can sustain topological signals which are variables associated not only to the nodes, but also to the links, to the triangles and in general to the higher dimensional simplices of simplicial complex…

Topological Relational Learning on Graphs

2021-10-29 · NeurIPS 2021 12 · Yuzhou Chen, Baris Coskunuzer, Yulia R. Gel

Graph neural networks (GNNs) have emerged as a powerful tool for graph classification and representation learning. However, GNNs tend to suffer from over-smoothing problems and are vulnerable to graph perturbations. To a…

Graph ClassificationNode ClassificationRelational ReasoningRepresentation Learning