Efficient LLM Inference using Dynamic Input Pruning and Cache-Aware Masking
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
Other references · 30
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
- 2023Qwen Technical Reportcited by 3,344
- 2023Mistral 7Bcited by 3,164
- 2023A Survey of Large Language Modelscited by 2,576
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,917
- 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,848
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 950
18 more
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2016Language Modeling with Gated Convolutional Networkscited by 702
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2023A Comprehensive Overview of Large Language Modelscited by 648
- 2021A White Paper on Neural Network Quantizationcited by 472
- 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 217
- 2018Competitive caching with machine learned advicecited by 195
- 2024BiLLM: Pushing the Limit of Post-Training Quantization for LLMscited by 144
- 2024PowerInfer-2: Fast Large Language Model Inference on a Smartphonecited by 103
- 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 94
- 2024AI and Memory Wallcited by 92
- 2024GPTVQ: The Blessing of Dimensionality for LLM Quantizationcited by 82
- 2023Pruning vs Quantization: Which is Better?cited by 46
- 2024ProSparse: Introducing and Enhancing Intrinsic Activation Sparsity within Large Language Modelscited by 45
- 2024CATS: Contextually-Aware Thresholding for Sparsity in Large Language Modelscited by 41
- 2024Turbo Sparse: Achieving LLM SOTA Performance with Minimal Activated Parameterscited by 38
- 2024OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decompositioncited by 20
- 2024Algorithms for Caching and MTS with reduced number of predictionscited by 12
Built on by
Citing papers per year: 2025: 7; 2026: 4.
11 papers.
- 2025DocPruner: A Storage-Efficient Framework for Multi-Vector Visual Document Retrieval via Adaptive Patch-Level Embedding Pruningcited by 20
- 2025AutoNeural: Co-Designing Vision-Language Models for NPU Inferencecited by 17
- 2025Memory-Augmented Transformers: A Systematic Review from Neuroscience Principles to Enhanced Model Architecturescited by 9
- 2025HELIOS: Adaptive Model And Early-Exit Selection for Efficient LLM Inference Servingcited by 8
- 2025Universal Properties of Activation Sparsity in Modern Large Language Modelscited by 7
- 2025Dynamic Tool Dependency Retrieval for Lightweight Function Callingcited by 7
- 2025RAP: Runtime Adaptive Pruning for LLM Inferencecited by 3
- 2026When Cloud Agents Meet Device Agents: Lessons from Hybrid Multi-Agent Systemscited by 1
- 2026SparSEEty: Extracting Tokens from Sparsity-Exploiting LLM Serving Systems via Deterministic Side Channelscited by 0
- 2026LeanStream: A Speculate-and-Refine Streaming Framework for Efficient on-Device LLM Inferencecited by 0
- 2026Activation Sparsity with Weight Approximation for Faster LLM Decoding on Offloaded Weightscited by 0
- 2026Activation Sparsity with Weight Approximation for Faster LLM Decoding on Offloaded Weights1 Oct 2026
- 2026LeanStream: A Speculate-and-Refine Streaming Framework for Efficient on-Device LLM Inference2 Sep 2026
- 2026SparSEEty: Extracting Tokens from Sparsity-Exploiting LLM Serving Systems via Deterministic Side Channels4 Aug 2026
- 2026When Cloud Agents Meet Device Agents: Lessons from Hybrid Multi-Agent Systems28 May 2026
- 2025Dynamic Tool Dependency Retrieval for Lightweight Function Calling18 Dec 2025
- 2025AutoNeural: Co-Designing Vision-Language Models for NPU Inference2 Dec 2025
- 2025DocPruner: A Storage-Efficient Framework for Multi-Vector Visual Document Retrieval via Adaptive Patch-Level Embedding Pruning28 Sep 2025
- 2025Universal Properties of Activation Sparsity in Modern Large Language Models30 Aug 2025
- 2025Memory-Augmented Transformers: A Systematic Review from Neuroscience Principles to Enhanced Model Architectures14 Aug 2025
- 2025RAP: Runtime Adaptive Pruning for LLM Inference22 May 2025
- 2025HELIOS: Adaptive Model And Early-Exit Selection for Efficient LLM Inference Serving14 Apr 2025
Similar, not cited
Close in wording, no citation either way
- 2026Lever: Speculative LLM Inference on Smartphones
- 2026Don't Waste Bits! Adaptive KV-Cache Quantization for Lightweight On-Device LLMs
- 2025Efficient LLM Inference with Activation Checkpointing and Hybrid Caching
- 2026KV Cache Optimization Strategies for Scalable and Efficient LLM Inference
- 2025Accelerating LLM Inference with Flexible N:M Sparsity via A Fully Digital Compute-in-Memory Accelerator
- 2026TierKV: Long-Context On-Device LLMs via Predictive Multi-Tier KV Caching
- 2026LLM Inference in a Flash!
- 2025Scaling Up On-Device LLMs via Active-Weight Swapping Between DRAM and Flash