mlsanityData to 7 Oct 2026

Sensitivity-Aware Thresholding and Token Routing for Activation Sparsification in Large Language Models

arXiv 2607.08991 ↗First posted 9 Jul 2026cs.LG cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Efficient inference in Large Language Models (LLMs) requires deciding where computation can be reduced while preserving model quality. We study this problem through multilayer perceptron (MLP) activation sparsification and token-level conditional routing. We first propose Sensitivity-Aware Thresholding for Sparsity (SATS), a threshold calibration method to choose layerwise gate thresholds using a local MLP output sensitivity proxy rather than calibrating thresholds directly from activation percentiles. While SATS retains the existing mechanism of sparsifying MLP activations by thresholding gate activations, it replaces percentile-based calibration with a sensitivity-aware selection rule. We then introduce a lightweight token routing framework that dynamically selects between a base path and a modified path on a per-token basis, rather than applying the modified computation uniformly to all tokens. We evaluate both methods on multiple recent open-weight LLMs. Our results show that SATS improves over the threshold-based sparsification baseline at matched actual sparsity and that token routing yields a more favorable quality-throughput trade-off than static activation modification baselines. Overall, our results suggest that improved threshold calibration and token routing can improve the quality-throughput trade-off in LLMs.

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

Builds on

15 of 17 references.

References · 15

  1. 2024The Llama 3 Herd of Modelscited by 14,192
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  3. 2025Qwen3 Technical Reportcited by 8,195
  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. 2023Qwen Technical Reportcited by 3,273
  7. 2016Pointer Sentinel Mixture Modelscited by 2,992
  8. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  9. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  10. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  11. 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 935
  12. 2023The RefinedWeb Dataset for Falcon LLM: Outperforming Curated Corpora with Web Data, and Web Data Onlycited by 755
3 more
  1. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  2. 2024ReLU2 Wins: Discovering Efficient Activation Functions for Sparse LLMscited by 66
  3. 2024CATS: Contextually-Aware Thresholding for Sparsity in Large Language Modelscited by 41

Built on by

Not cited yet.