mlsanityData to 7 Oct 2026

TopK-Guided: Adaptive, Budget-Aware Activation Sparsity for Efficient LLM Inference

arXiv 2610.01763 ↗First posted 1 Oct 2026cs.AIcited by 0

On the map: Efficient LLM inference and serving → Early exit and edge inference

Abstract (arXiv)

Activation sparsity speeds up large language model (LLM) inference by setting unimportant activations to zero so that the corresponding computations can be skipped. Existing training-free methods, however, make different trade-offs: threshold-based methods such as TEAL adapt the sparsity level to each token but do not tightly control the realised sparsity, while TopK-based methods such as WINA enforce a fixed sparsity level but use the same sparsity budget for every token. Both also apply the same budget across transformer blocks, despite large differences in block sensitivity. We introduce TopK-Guided, a training-free method that addresses both limitations by combining bounded token-level sparsity adaptation with sensitivity-aware block-level budget allocation. Across Llama-2 and Llama-3 models, TopK-Guided consistently improves perplexity and downstream accuracy over TEAL and WINA while preserving essentially the same sparsitydependent projection compute as WINA, with the largest gains at high sparsity. Ablations show that both components provide complementary improvements.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Early exit and edge inference, one of 12 directions in Efficient LLM inference and serving. Builds on 18 of its 21 references that are in the map. First posted on arXiv 1 Oct 2026.

Builds on

18 of 21 references.

Closest ancestors · 1

Same direction, newest first

  1. 2024Training-Free Activation Sparsity in Large Language Models26 Aug

Other references · 17

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  6. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  7. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  8. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
  9. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  10. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  11. 2024QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMscited by 598
  12. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
5 more
  1. 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
  2. 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
  3. 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 121
  4. 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 91
  5. 2025WINA: Weight Informed Neuron Activation for Accelerating Large Language Model Inferencecited by 2

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026WiSparse: Boosting LLM Inference Efficiency with Weight-Aware Mixed Activation Sparsity
  2. 2025La RoSA: Enhancing LLM Efficiency via Layerwise Rotated Sparse Activation
  3. 2025R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inference
  4. 2024Turbo Sparse: Achieving LLM SOTA Performance with Minimal Activated Parameters
  5. 2026SPARQLe: Sub-Precision Activation Representation for Quantized LLM Inference ↗
  6. 2025Polar Sparsity: High Throughput Batched LLM Inferencing with Scalable Contextual Sparsity
  7. 2024Q-Sparse: All Large Language Models can be Fully Sparsely-Activated
  8. 2025Accelerating LLM Inference with Flexible N:M Sparsity via A Fully Digital Compute-in-Memory Accelerator