HodgeCover isolates the harmonic kernel of a simplicial Laplacian on an expert 2-complex to identify irreducible merge cycles and selects experts for aggressive compression, matching or exceeding baselines on open-weight MoE models.
Topological graph neural networks
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
STRAND treats persistence diagrams as survival data to derive a calibrated two-sample test, interpretable effect sizes, and a 1-Wasserstein-stable feature vector from one representation.
citing papers explorer
-
HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Experts
HodgeCover isolates the harmonic kernel of a simplicial Laplacian on an expert 2-complex to identify irreducible merge cycles and selects experts for aggressive compression, matching or exceeding baselines on open-weight MoE models.
-
From Persistence to Survival: Hypothesis Testing, Effect Sizes and Vectorisation for Topological Features
STRAND treats persistence diagrams as survival data to derive a calibrated two-sample test, interpretable effect sizes, and a 1-Wasserstein-stable feature vector from one representation.