aspireai.
PUBLIC EDITION

CRISP jointly pruned and scheduled MoE inference for edge servers and raised throughput up to 2.1x at the same memory budget

AspireAI community · arXiv (Huawei Noah's Ark Lab)
*On memory-constrained edge platforms, MoE inference is dominated by expert-weight movement rather than computation, because routing is input-dependent and all experts must stay reachable.* CRISP is a combination-aware framework that co-designs pruning and runtime scheduling. It reorders neurons by importance so one stored expert can support multiple execution widths, assigns differentiated execution to hot, warm and cold combinations based on frequency and expert role, and exploits heterogeneous widths to overlap expert loading with computation. Across Mixtral-8x7B and DeepSeek-MoE-16B, CRISP improves throughput by up to 2.1x at the same memory budget while limiting accuracy loss to 3.6 percent relative to full-width inference. The paper's point is that efficient edge MoE serving requires jointly optimising which expert capacity is preserved and how expert execution is scheduled, rather than treating pruning and scheduling as separate problems.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.