mlsanityData to 14 Oct 2026

Dynamic Expert Pruning for Multi-Agent Systems

arXiv 2610.02951 ↗First posted 2 Oct 2026cs.LG cs.AI cs.MAcited by 0

On the map: LLM agents and tool use → General LLM agent frameworks and benchmarks

also in 1 more
Abstract (arXiv)

Mixture-of-Experts (MoE) architectures scale language models efficiently by activating only a few experts per token, but the saving is confined to computation: every expert must stay resident on the accelerator, so memory bounds where these models can be deployed. Expert pruning reduces this footprint, yet existing methods are static --- a single mask, calibrated offline, is applied to the model for every subsequent request. This assumption can fail when the workload is heterogeneous, most prominently in multi-agent systems, where one backbone serves many tasks and roles at once: our analysis shows that different tasks and roles recruit different experts, while static methods assign one fixed subset to all of them. We therefore propose Dynamic Expert Pruning (DEP), which rests on a finding we establish here: an agent's system and task prompts are by themselves sufficient to identify the experts that agent and its task require, since that text already describes what the agent will do. A lightweight predictor, trained once on workflow transcripts, turns those prompts into a specialized per-request mask in a single forward pass, with no per-configuration calibration. Across diverse tasks and roles, model scales, and MoE architectures, DEP achieves better overall accuracy than static pruning and merging baselines, and generalizes to workflows unseen in training without retraining. Its margin over those baselines is largest when few experts are retained, suggesting that the role specialization inherent to multi-agent systems permits sparser serving than static pruning allows.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in General LLM agent frameworks and benchmarks, one of 16 directions in LLM agents and tool use. Builds on 31 of its 35 references that are in the map. First posted on arXiv 2 Oct 2026.

Builds on

31 of 35 references.

Closest ancestors · 2

Same direction, newest first

  1. 2025Towards a Science of Scaling Agent Systems9 Dec
  2. 2023MetaGPT: Meta Programming for A Multi-Agent Collaborative Framework1 Aug

Other references · 29

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2025Qwen3 Technical Reportcited by 8,820
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  5. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  6. 2023Let's Verify Step by Stepcited by 3,789
  7. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
  8. 2021Program Synthesis with Large Language Modelscited by 3,637
  9. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
  10. 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,373
  11. 2024Gemini 1.5: Unlocking multimodal understanding across millions of tokens of contextcited by 3,224
  12. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
17 more
  1. 2023AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversationcited by 1,988
  2. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  3. 2024Mixtral of Expertscited by 1,823
  4. 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,391
  5. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
  6. 2025Why Do Multi-Agent LLM Systems Fail?cited by 604
  7. 2024AFlow: Automating Agentic Workflow Generationcited by 432
  8. 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 252
  9. 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Modelscited by 146
  10. 2023Pre-gated MoE: An Algorithm-System Co-Design for Fast and Scalable Mixture-of-Expert Inferencecited by 104
  11. 2024Parrot: Efficient Serving of LLM-based Applications with Semantic Variablecited by 99
  12. 2023Fast Inference of Mixture-of-Experts Language Models with Offloadingcited by 91
  13. 2025REAP the Experts: Why Pruning Prevails for One-Shot MoE compressioncited by 44
  14. 2024Retraining-Free Merging of Sparse MoE via Hierarchical Clusteringcited by 35
  15. 2025Instruction-Following Pruning for Large Language Modelscited by 17
  16. 2026The Illusion of Multi-Agent Advantagecited by 9
  17. 2026ReasonOps: Operator Segmentation for LLM Reasoning Tracescited by 5

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Higher-order pruning of experts in mixture-of-experts language models
  2. 2026It Takes a MAESTRO To Prune Bad Experts
  3. 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts
  4. 2026SHAPE: Coalition-Aware Expert Pruning for Sparse Mixture-of-Experts LLMs
  5. 2025MoE Pathfinder: Trajectory-driven Expert Pruning
  6. 2025Cluster-Driven Expert Pruning for Mixture-of-Experts Large Language Models
  7. 2026You Only Need 2/3 of the Chosen Experts: An Empirical Study of Dynamic Expert Pruning in Fine-Grained MoE LLMs
  8. 2026Slicing and Dicing: Configuring Optimal Mixtures of Experts