mlsanityData to 14 Oct 2026

Efficient LLM Inference using Dynamic Input Pruning and Cache-Aware Masking

arXiv 2412.01380 ↗First posted 2 Dec 2024cs.LG cs.CLcited by 11

On the map: Efficient LLM inference and serving → Serving systems and request scheduling

Abstract (arXiv)

While mobile devices provide ever more compute power, improvements in DRAM bandwidth are much slower. This is unfortunate for large language model (LLM) token generation, which is heavily memory-bound. Previous work has proposed to leverage natural dynamic activation sparsity in ReLU-activated LLMs to reduce effective DRAM bandwidth per token. However, more recent LLMs use SwiGLU instead of ReLU, which results in little inherent sparsity. While SwiGLU activations can be pruned based on magnitude, the resulting sparsity patterns are difficult to predict, rendering previous approaches ineffective. To circumvent this issue, our work introduces Dynamic Input Pruning (DIP): a predictor-free dynamic sparsification approach, which preserves accuracy with minimal fine-tuning. DIP can further use lightweight LoRA adapters to regain some performance lost during sparsification. Lastly, we describe a novel cache-aware masking strategy, which considers the cache state and activation magnitude to further increase cache hit rate, improving LLM token rate on mobile devices. DIP outperforms other methods in terms of accuracy, memory and throughput trade-offs across simulated hardware settings. On Phi-3-Medium, DIP achieves a 46% reduction in memory and 40% increase in throughput with < 0.1 loss in perplexity when compared to streaming the dense model from Flash. The open source code for HW simulator, methods, and experiments in this paper is available at https://github.com/Qualcomm-AI-research/dynamic-sparsity .

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Placed in Serving systems and request scheduling, one of 12 directions in Efficient LLM inference and serving. Builds on 31 of its 48 references that are in the map. First posted on arXiv 2 Dec 2024.

Builds on

31 of 48 references.

Closest ancestors · 1

Same direction, newest first

  1. 2023LLM in a flash: Efficient Large Language Model Inference with Limited Memory12 Dec

Other references · 30

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  3. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  4. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
  5. 2023Qwen Technical Reportcited by 3,344
  6. 2023Mistral 7Bcited by 3,164
  7. 2023A Survey of Large Language Modelscited by 2,576
  8. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  9. 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,917
  10. 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,848
  11. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  12. 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 950
18 more
  1. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  2. 2016Language Modeling with Gated Convolutional Networkscited by 702
  3. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  4. 2023A Comprehensive Overview of Large Language Modelscited by 648
  5. 2021A White Paper on Neural Network Quantizationcited by 472
  6. 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 217
  7. 2018Competitive caching with machine learned advicecited by 195
  8. 2024BiLLM: Pushing the Limit of Post-Training Quantization for LLMscited by 144
  9. 2024PowerInfer-2: Fast Large Language Model Inference on a Smartphonecited by 103
  10. 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 94
  11. 2024AI and Memory Wallcited by 92
  12. 2024GPTVQ: The Blessing of Dimensionality for LLM Quantizationcited by 82
  13. 2023Pruning vs Quantization: Which is Better?cited by 46
  14. 2024ProSparse: Introducing and Enhancing Intrinsic Activation Sparsity within Large Language Modelscited by 45
  15. 2024CATS: Contextually-Aware Thresholding for Sparsity in Large Language Modelscited by 41
  16. 2024Turbo Sparse: Achieving LLM SOTA Performance with Minimal Activated Parameterscited by 38
  17. 2024OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decompositioncited by 20
  18. 2024Algorithms for Caching and MTS with reduced number of predictionscited by 12

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 7; 2026: 4.

11 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Lever: Speculative LLM Inference on Smartphones
  2. 2026Don't Waste Bits! Adaptive KV-Cache Quantization for Lightweight On-Device LLMs
  3. 2025Efficient LLM Inference with Activation Checkpointing and Hybrid Caching
  4. 2026KV Cache Optimization Strategies for Scalable and Efficient LLM Inference
  5. 2025Accelerating LLM Inference with Flexible N:M Sparsity via A Fully Digital Compute-in-Memory Accelerator
  6. 2026TierKV: Long-Context On-Device LLMs via Predictive Multi-Tier KV Caching
  7. 2026LLM Inference in a Flash!
  8. 2025Scaling Up On-Device LLMs via Active-Weight Swapping Between DRAM and Flash