mlsanityData to 7 Oct 2026

WIDE: Boosting Adaptive LLM Inference via Token-level Dynamic Width Pruning

arXiv 2607.28418 ↗First posted 30 Jul 2026cs.AI cs.CL cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Pruning is a promising approach for improving the efficiency of LLMs. Existing static structured pruning methods are hardware-friendly and can deliver practical throughput gains, but their input-agnostic computation allocation often causes substantial accuracy degradation under aggressive sparsity. Recent dynamic sparsity methods improve quality retention by adapting computation to individual inputs, yet they remain largely limited to coarse-grained structural decisions and their practical acceleration under real-world inference scenarios remains challenging. To address these challenges, we present WIDE, the first end-to-end differentiable token-level dynamic width pruning framework designed for both prefill and decode scenarios. WIDE enables fine-grained computation allocation by allowing each token to dynamically select attention-head groups and FFN-channel groups, extending dynamic pruning beyond layer-level decisions to neuron-block-level granularity. Through a two-stage training pipeline, WIDE learns effective token-wise sparse execution patterns and achieves substantially better quality retention than existing approaches. To make such fine-grained dynamic pruning practical, we further propose a pruning--kernel co-design framework that decomposes dynamic sparsity acceleration into mask reordering, hardware-agnostic block-level skipping, and hardware-dependent intra-block skipping, enabling efficient execution across different granularities. At 50% sparsity, WIDE provides 55.1% performance boost when compared to the state-of-the-art dynamic depth pruning under calibration-only settings. Under prefill and decoding inference workloads, WIDE achieves close-to-theoretical kernel-level speedups of up to 1.98x for prefill and 4.95x for decoding, as well as 1.68x and 1.55x end-to-end acceleration. Our code is available at https://github.com/EIT-NLP/LLM-Pruning/tree/main/WIDE.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 38 of its 49 references that are in the map. First posted on arXiv 30 Jul 2026.

Builds on

38 of 49 references.

References · 38

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  2. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  4. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  5. 2016Pointer Sentinel Mixture Modelscited by 2,992
  6. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  7. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  8. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  9. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  10. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
  11. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
  12. 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,107
26 more
  1. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  2. 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 877
  3. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  4. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
  5. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
  6. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
  7. 2025FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Servingcited by 248
  8. 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
  9. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
  10. 2024RedPajama: an Open Dataset for Training Large Language Modelscited by 178
  11. 2024What Matters in Transformers? Not All Attention is Neededcited by 83
  12. 2026FlashAttention-4: Algorithm and Kernel Pipelining Co-Design for Asymmetric Hardware Scalingcited by 58
  13. 2024MaskLLM: Learnable Semi-Structured Sparsity for Large Language Modelscited by 49
  14. 2026CUDA Agent: Large-Scale Agentic RL for High-Performance CUDA Kernel Generationcited by 41
  15. 2024BlockPruner: Fine-grained Pruning for Large Language Modelscited by 35
  16. 2026AVO: Agentic Variation Operators for Autonomous Evolutionary Searchcited by 19
  17. 2026HiDrop: Hierarchical Vision Token Reduction in MLLMs via Late Injection, Concave Pyramid Pruning, and Early Exitcited by 15
  18. 2026UTPTrack: Towards Simple and Unified Token Pruning for Visual Trackingcited by 6
  19. 2025Polar Sparsity: High Throughput Batched LLM Inferencing with Scalable Contextual Sparsitycited by 5
  20. 2025Informed Routing in LLMs: Smarter Token-Level Computation for Faster Inferencecited by 4
  21. 2026Pruning as a Cooperative Game: Surrogate-Assisted Layer Contribution Estimation for Large Language Modelscited by 3
  22. 2025ELANA: A Simple Energy and Latency Analyzer for LLMscited by 2
  23. 2026Deterministic Differentiable Structured Pruning for Large Language Modelscited by 2
  24. 2026Fast Forward: Accelerating LLM Prefill with Predictive FFN Sparsitycited by 1
  25. 2026SkipOPU: An FPGA-based Overlay Processor for Large Language Models with Dynamically Allocated Computationcited by 1
  26. 2026Beyond FLOPs: Benchmarking Real Inference Acceleration of LLM Pruning under a GEMM-Centric Taxonomycited by 1

Built on by

Not cited yet.