FrugalPrompt: Reducing Contextual Overhead in Large Language Models via Token Attribution
Not on the map. Why?
Abstract (arXiv)
Human communication heavily relies on laconism and inferential pragmatics, allowing listeners to successfully reconstruct rich meaning from sparse, telegraphic speech. In contrast, large language models (LLMs) owe much of their stellar performance to expansive input contexts, yet such verbosity inflates monetary costs, carbon footprint, and inference-time latency. This overhead manifests from the redundant low-utility tokens present in typical prompts, as only a fraction of tokens typically carries the majority of the semantic weight. Inspired by the aforementioned cognitive psycholinguistic processes, we address this inefficiency by introducing FrugalPrompt, a novel prompt compression framework for LLMs, which retains only the most semantically significant tokens. Leveraging two state-of-the-art token attribution methods, GlobEnc and DecompX, we assign salience scores to every token in an input sequence, rank them to retain the top-k% tokens, and obtain a sparse frugalized prompt. We establish the theoretical stability of our approach and provide strong empirical results across a suite of four NLP tasks to study the trade-off between the portion of retained tokens and performance. Experimental findings across retention settings reveal asymmetric performance patterns that suggest potential task contamination effects. We posit that our work contributes to a more nuanced understanding of LLM behavior in performance-efficiency trade-offs and delineates the boundary between tasks tolerant of contextual sparsity and those requiring exhaustive context.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 33 of its 66 references that are in the map. First posted on arXiv 18 Oct 2025.
Builds on
33 of 66 references.
References · 33
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2024SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineeringcited by 1,628
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
21 more
- 2019Attention is not Explanationcited by 916
- 2020Quantifying Attention Flow in Transformerscited by 759
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2025Agent Laboratory: Using LLM Agents as Research Assistantscited by 405
- 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 359
- 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compressioncited by 343
- 2024Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Modelscited by 282
- 2019Cosmos QA: Machine Reading Comprehension with Contextual Commonsense Reasoningcited by 281
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 260
- 2024MapCoder: Multi-Agent Code Generation for Competitive Problem Solvingcited by 177
- 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 103
- 2023Task Contamination: Language Models May Not Be Few-Shot Anymorecited by 98
- 2019Do Attention Heads in BERT Track Syntactic Dependencies?cited by 87
- 2024Towards Greener LLMs: Bringing Energy-Efficiency to the Forefront of LLM Inferencecited by 59
- 2023Baby Llama: knowledge distillation from an ensemble of teachers trained on a small dataset with no performance penaltycited by 57
- 2024Learning to Compress Prompt in Natural Language Formatscited by 54
- 2022GlobEnc: Quantifying Global Token Attribution by Incorporating the Whole Encoder Layer in Transformerscited by 44
- 2024VideoWebArena: Evaluating Long Context Multimodal Agents with Video Understanding Web Taskscited by 43
- 2023Masked Structural Growth for 2x Faster Language Model Pre-trainingcited by 32
- 2023DecompX: Explaining Transformers Decisions by Propagating Token Decompositioncited by 31
- 2024Trillion Parameter AI Serving Infrastructure for Scientific Discovery: A Survey and Visioncited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Lexical Prompt Compression for Large Language Models: A Training-Free, Deterministic Pipeline with Empirical Pareto Analysis Across Eleven Task Categories
- 2024LanguaShrink: Reducing Token Overhead with Psycholinguistics
- 2026Lost in Compression: A Controlled Cross-Lingual Audit of Extractive Prompt Compressors
- 2025Learning a Single Token to Replace Long System Prompts in LLMs
- 2026CAVEWOMAN: How Large Language Models Behave Under Linguistic Input and Output Compression
- 2024Prompt Compression for Large Language Models: A Survey
- 2025Dynamic Compressing Prompts for Efficient Inference of Large Language Models
- 2025Understanding and Improving Information Preservation in Prompt Compression for LLMs