{"total":23,"rows":[{"id":"2403.12968","title":"LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression","created":"2024-03-19","cited_by_count":348,"area":"inference"},{"id":"2404.14294","title":"A Survey on Efficient Inference for Large Language Models","created":"2024-04-22","cited_by_count":205,"area":"inference"},{"id":"2410.12388","title":"Prompt Compression for Large Language Models: A Survey","created":"2024-10-16","cited_by_count":67,"area":"inference"},{"id":"2404.00489","title":"Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression","created":"2024-03-30","cited_by_count":18,"area":"inference"},{"id":"2407.08892","title":"Characterizing Prompt Compression Methods for Long Context Inference","created":"2024-07-11","cited_by_count":18,"area":"inference"},{"id":"2504.08934","title":"Long Context In-Context Compression by Getting to the Gist of Gisting","created":"2025-04-11","cited_by_count":13,"area":"inference"},{"id":"2410.14042","title":"Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles","created":"2024-10-17","cited_by_count":9,"area":"inference"},{"id":"2410.04139","title":"From Reading to Compressing: Exploring the Multi-document Reader for Prompt Compression","created":"2024-10-05","cited_by_count":7,"area":"inference"},{"id":"2507.11942","title":"DAC: A Dynamic Attention-aware Approach for Task-Agnostic Prompt Compression","created":"2025-07-16","cited_by_count":7,"area":"inference"},{"id":"2409.15395","title":"Parse Trees Guided LLM Prompt Compression","created":"2024-09-23","cited_by_count":6,"area":"inference"},{"id":"2504.11004","title":"Dynamic Compressing Prompts for Efficient Inference of Large Language Models","created":"2025-04-15","cited_by_count":6,"area":"inference"},{"id":"2503.07956","title":"EFPC: Towards Efficient and Flexible Prompt Compression","created":"2025-03-11","cited_by_count":5,"area":"inference"},{"id":"2506.00307","title":"Lossless Token Sequence Compression via Meta-Tokens","created":"2025-05-30","cited_by_count":4,"area":"inference"},{"id":"2601.09703","title":"ShortCoder: Knowledge-Augmented Syntax Optimization for Token-Efficient Code Generation","created":"2026-01-14","cited_by_count":3,"area":"inference"},{"id":"2412.07682","title":"TRIM: Token Reduction and Inference Modeling for Cost-Effective Language Generation","created":"2024-12-10","cited_by_count":2,"area":"inference"},{"id":"2603.12646","title":"98$\\times$ Faster LLM Routing Without a Dedicated GPU: Flash Attention, Prompt Compression, and Near-Streaming for the vLLM Semantic Router","created":"2026-03-13","cited_by_count":2,"area":"inference"},{"id":"2603.19635","title":"BEAVER: A Training-Free Hierarchical Prompt Compression Method via Structure-Aware Page Selection","created":"2026-03-20","cited_by_count":2,"area":"inference"},{"id":"2603.23527","title":"Compression Method Matters: Benchmark-Dependent Output Dynamics in LLM Prompt Compression","created":"2026-03-06","cited_by_count":2,"area":"inference"},{"id":"2502.13374","title":"Task-agnostic Prompt Compression with Context-aware Sentence Embedding and Reward-guided Task Descriptor","created":"2025-02-19","cited_by_count":0,"area":"inference"},{"id":"2603.29193","title":"Developing Adaptive Context Compression Techniques for Large Language Models (LLMs) in Long-Running Interactions","created":"2026-03-31","cited_by_count":0,"area":"inference"},{"id":"2604.15153","title":"Compressing Sequences in the Latent Embedding Space: $K$-Token Merging for Large Language Models","created":"2026-04-16","cited_by_count":0,"area":"inference"},{"id":"2607.25335","title":"Every Time I Hire a Linguist, Inference Costs Go Down: On Linguistic Rules as Effective Prompt Compressors","created":"2026-07-28","cited_by_count":0,"area":"inference"},{"id":"2608.04569","title":"Relevant but Incomplete: Referential Dangling as a Paradigm-Level Failure Mode in Hard Prompt Compression","created":"2026-08-05","cited_by_count":0,"area":"inference"}],"next_cursor":null}