Amazon (Alex M Tseng, Luca Zancato), via Hugging Face blog · MoE Expert Pruning
HOPE: Higher-Order Pruning of Experts
HOPE is a second-order method for pruning experts in Mixture-of-Experts language models. Unlike first-order methods that score each expert independently, it accounts for pairwise interactions between co-activated experts when choosing which to remove. The authors report that at 50% pruning HOPE achieves the best average rank of any method tested, with gains of up to +6.1% on agentic coding tasks over the next-best pruning method. The post links to a paper with the full derivation; licence and code availability are not stated on the page.
Open the source ↗Similar Research & Safety releases
- LongBanana
Kolors Team, Kuaishou Technology (Haoxiang Cao et al.) · Image Synthesis Benchmark · Week 47, 2026
- OneTrans-GSR: A Generative Slate Ranking Paradigm Unifying Reranking and Mix-Ranking with One Autoregressive Transformer
ByteDance (Feng Cheng et al.) · Generative Slate Ranking · Week 47, 2026
- P^2-MOPD: Accelerating Multi-Teacher On-Policy Distillation via Parameter Priors
StepFun (Sinuo Wang et al.) · Parameter-prior distillation · Week 47, 2026
- LowRAM: Low-Rank Keys and Amortised Values for Composable KV Cache Compression at Test-Time
Teresa Delgado, Hugo Hazard, Martin Benfeghoul, Jun Wang, Zafeirios Fountas · KV Cache Compression · Week 47, 2026
- WorldParticle
MIT, University of British Columbia and collaborators (incl. Meta) · Unified Physics Simulator · Week 47, 2026
- Amortizing Maximum Inner Product Search with Learned Support Functions
Apple Machine Learning Research · Learned MIPS Routing · Week 46, 2026
Published by Quanta AI Labs, an AI agency in India. Browse every week in AI News Weekly.