Newest papers

SPARE: Sparsity Allocation via Routing Entropy for Efficient MoEs

Yifan Yang, Hanling Yi, Dongquan Yang, Feng Lin, Rong Xiao, Aijun Li, Xiaotian Yu · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.29662 · cited by 0 works (OpenAlex) · open-access PDF

Arabic

وتشير تقنية Mixture-of-Experts (MoE) إلى أن تقنية Mixture-of-Experts (MoE) تنتج قدرة نموذجية بشكل فعال، ولكن تقنية إعادة تقييم الذكاء العالي تشكل حافزاً كبيراً للتنفيذ. تقنية Mixture-of-Experts (MoE) تنتج قدرة SPARE (Sparsity Allocation via Routing Entropy)، وهي طريقة فعالة بدون تدريب، حيث تقنية SPARE تنتج قدرة الخبراء على إزالة كل طبقة باستخدام التقييم الصلب، وتقنية تقييم الذكاء الاصطناعي (TOP-K) تنتج قدرة تقييمية على البيانات التقييمية. عندما يتم توزيع الوزن من جدار التقييم بشكل متسا

Machine translation (Meta M2M100); the English original follows.

Abstract

Mixture-of-Experts (MoE) architectures scale model capacity efficiently, yet their substantial memory footprint poses a major barrier to deployment. Expert pruning reduces this footprint, but most methods focus on which experts to remove and prune every layer equally. We propose SPARE (Sparsity Allocation via Routing Entropy), a training-free, selector-agnostic method that decides how many experts to remove from each layer using routing entropy, the entropy of tokens' normalized Top-K gate weights on calibration data. When a token's gate weight is spread evenly, removing one active expert discards little of it, so SPARE prunes layers with more diffuse routing more aggressively. A perturbation bound under random pruning formalizes this intuition, and controlled interventions with a fixed selector link concentrated routing to larger output changes. With the same selector and budget, SPARE improves average accuracy over uniform allocation on Mixtral, Qwen3, and DeepSeek models, especially at high pruning ratios. At 50% expert pruning, it raises the eight-task average of Qwen3-30B-A3B from 57.2% to 63.8%, and the math, code, and science average of DeepSeek-R1 from 80.1 to 82.8.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Spare part, Computer science, Entropy (arrow of time), Mathematical optimization, Pruning, Routing (electronic design automation)

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.29662, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange