{"total":89,"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":"2310.07240","title":"CacheGen: KV Cache Compression and Streaming for Fast Large Language Model Serving","created":"2023-10-11","cited_by_count":203,"area":"inference"},{"id":"2401.03462","title":"Long Context Compression with Activation Beacon","created":"2024-01-07","cited_by_count":104,"area":"inference"},{"id":"2312.15234","title":"Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systems","created":"2023-12-23","cited_by_count":102,"area":"inference"},{"id":"2407.18003","title":"Keep the Cost Down: A Review on Methods to Optimize LLM' s KV-Cache Consumption","created":"2024-07-25","cited_by_count":97,"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":"2502.00299","title":"ChunkKV: Semantic-Preserving KV Cache Compression for Efficient Long-Context LLM Inference","created":"2025-02-01","cited_by_count":60,"area":"inference"},{"id":"2405.10637","title":"Layer-Condensed KV Cache for Efficient Inference of Large Language Models","created":"2024-05-17","cited_by_count":59,"area":"inference"},{"id":"2409.01227","title":"Prompt Compression with Context-Aware Sentence Encoding for Fast and Improved LLM Inference","created":"2024-09-02","cited_by_count":53,"area":"inference"},{"id":"2408.03094","title":"500xCompressor: Generalized Prompt Compression for Large Language Models","created":"2024-08-06","cited_by_count":47,"area":"inference"},{"id":"2409.17422","title":"Discovering the Gems in Early Layers: Accelerating Long-Context LLMs with 1000x Input Token Reduction","created":"2024-09-25","cited_by_count":39,"area":"inference"},{"id":"2502.13063","title":"Cramming 1568 Tokens into a Single Vector and Back Again: Exploring the Limits of Embedding Space Capacity","created":"2025-02-18","cited_by_count":28,"area":"inference"},{"id":"2409.19272","title":"Perception Compressor: A Training-Free Prompt Compression Framework in Long Context Scenarios","created":"2024-09-28","cited_by_count":23,"area":"inference"},{"id":"2502.00791","title":"Vision-centric Token Compression in Large Language Model","created":"2025-02-02","cited_by_count":21,"area":"inference"},{"id":"2505.12215","title":"GMSA: Enhancing Context Compression via Group Merging and Layer Semantic Alignment","created":"2025-05-18","cited_by_count":21,"area":"inference"},{"id":"2406.05317","title":"LoCoCo: Dropping In Convolutions for Long Context Compression","created":"2024-06-08","cited_by_count":19,"area":"inference"},{"id":"2407.15504","title":"Fundamental Limits of Prompt Compression: A Rate-Distortion Framework for Black-Box Language Models","created":"2024-07-22","cited_by_count":19,"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":"2412.17483","title":"A Silver Bullet or a Compromise for Full Attention? A Comprehensive Study of Gist Token-based Context Compression","created":"2024-12-23","cited_by_count":17,"area":"inference"},{"id":"2404.07979","title":"LLoCO: Learning Long Contexts Offline","created":"2024-04-11","cited_by_count":16,"area":"inference"},{"id":"2510.18586","title":"TokenCake: A KV-Cache-centric Serving Framework for LLM-based Multi-Agent Applications","created":"2025-10-21","cited_by_count":16,"area":"inference"},{"id":"2503.19114","title":"Understanding and Improving Information Preservation in Prompt Compression for LLMs","created":"2025-03-24","cited_by_count":15,"area":"inference"},{"id":"2502.14317","title":"ParallelComp: Parallel Long-Context Compressor for Length Extrapolation","created":"2025-02-20","cited_by_count":14,"area":"inference"},{"id":"2510.08907","title":"Autoencoding-Free Context Compression for LLMs via Contextual Semantic Anchors","created":"2025-10-10","cited_by_count":14,"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":"2506.12707","title":"SecurityLingua: Efficient Defense of LLM Jailbreak Attacks via Security-Aware Prompt Compression","created":"2025-06-15","cited_by_count":13,"area":"inference"},{"id":"2602.01719","title":"COMI: Coarse-to-fine Context Compression via Marginal Information Gain","created":"2026-02-02","cited_by_count":13,"area":"inference"},{"id":"2407.02043","title":"Concise and Precise Context Compression for Tool-Using Language Models","created":"2024-07-02","cited_by_count":12,"area":"inference"},{"id":"2501.12959","title":"Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference","created":"2025-01-22","cited_by_count":12,"area":"inference"},{"id":"2410.08391","title":"KV Prediction for Improved Time to First Token","created":"2024-10-10","cited_by_count":11,"area":"inference"},{"id":"2412.02252","title":"Compressing KV Cache for Long-Context LLM Inference with Inter-Layer Attention Similarity","created":"2024-12-03","cited_by_count":10,"area":"inference"},{"id":"2512.14946","title":"EVICPRESS: Joint KV-Cache Compression and Eviction for Efficient LLM Serving","created":"2025-12-16","cited_by_count":10,"area":"inference"},{"id":"2406.06110","title":"Recurrent Context Compression: Efficiently Expanding the Context Window of LLM","created":"2024-06-10","cited_by_count":8,"area":"inference"},{"id":"2505.00019","title":"An Empirical Study on Prompt Compression for Large Language Models","created":"2025-04-24","cited_by_count":8,"area":"inference"},{"id":"2512.04550","title":"AdmTree: Compressing Lengthy Context with Adaptive Semantic Trees","created":"2025-12-04","cited_by_count":8,"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":"2505.15774","title":"Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retention","created":"2025-05-21","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":"2605.05971","title":"Training Transformers for KV Cache Compressibility","created":"2026-05-07","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":"2504.14992","title":"Efficient Pretraining Length Scaling","created":"2025-04-21","cited_by_count":6,"area":"inference"},{"id":"2508.15813","title":"SCOPE: A Generative Approach for LLM Prompt Compression","created":"2025-08-16","cited_by_count":6,"area":"inference"},{"id":"2604.20920","title":"Simplified Sparse Attention via Gist Tokens","created":"2026-04-22","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":"2503.11816","title":"Key, Value, Compress: A Systematic Exploration of KV Cache Compression Techniques","created":"2025-03-14","cited_by_count":5,"area":"inference"},{"id":"2506.08373","title":"Draft-based Approximate Inference for LLMs","created":"2025-06-10","cited_by_count":5,"area":"inference"},{"id":"2509.19228","title":"CompLLM: Compression for Long Context Q&A","created":"2025-09-23","cited_by_count":5,"area":"inference"},{"id":"2501.06730","title":"Better Prompt Compression Without Multi-Layer Perceptrons","created":"2025-01-12","cited_by_count":4,"area":"inference"},{"id":"2502.01025","title":"Knowing When to Stop: Efficient Context Processing via Latent Sufficiency Signals","created":"2025-02-03","cited_by_count":4,"area":"inference"},{"id":"2504.16574","title":"PIS: Linking Importance Sampling and Attention Mechanisms for Efficient Prompt Compression","created":"2025-04-23","cited_by_count":4,"area":"inference"},{"id":"2506.00307","title":"Lossless Token Sequence Compression via Meta-Tokens","created":"2025-05-30","cited_by_count":4,"area":"inference"},{"id":"2606.09659","title":"End-to-End Context Compression at Scale","created":"2026-06-08","cited_by_count":4,"area":"inference"},{"id":"2405.11299","title":"The CAP Principle for LLM Serving: A Survey of Long-Context Large Language Model Serving","created":"2024-05-18","cited_by_count":3,"area":"inference"},{"id":"2503.02756","title":"BatchGEMBA: Token-Efficient Machine Translation Evaluation with Batched Prompting and Prompt Compression","created":"2025-03-04","cited_by_count":3,"area":"inference"},{"id":"2508.17892","title":"ILRe: Intermediate Layer Retrieval for Context Compression in Causal Language Models","created":"2025-08-25","cited_by_count":3,"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":"2603.19733","title":"PoC: Performance-oriented Context Compression for Large Language Models via Performance Prediction","created":"2026-03-20","cited_by_count":3,"area":"inference"},{"id":"2605.09463","title":"Beyond Position Bias: Shifting Context Compression from Position-Driven to Semantic-Driven","created":"2026-05-10","cited_by_count":3,"area":"inference"},{"id":"2605.17304","title":"Compress the Context, Keep the Commitments: A Formal Framework for Verifiable LLM Context Compression","created":"2026-05-17","cited_by_count":3,"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":"2606.29251","title":"When Summaries Distort Decisions: Information Fidelity in LLM-Compressed Financial Analysis","created":"2026-06-28","cited_by_count":2,"area":"inference"},{"id":"2403.17411","title":"PCToolkit: A Unified Plug-and-Play Prompt Compression Toolkit of Large Language Models","created":"2024-03-26","cited_by_count":1,"area":"inference"},{"id":"2602.00885","title":"Reliability-Aware Determinantal Point Processes for Robust Informative Data Selection in Large Language Models","created":"2026-01-31","cited_by_count":1,"area":"inference"},{"id":"2602.01778","title":"Data Distribution Matters: A Data-Centric Perspective on Context Compression for Large Language Model","created":"2026-02-02","cited_by_count":1,"area":"inference"},{"id":"2603.23525","title":"Prompt Compression in Production Task Orchestration: A Pre-Registered Randomized Trial","created":"2026-03-06","cited_by_count":1,"area":"inference"},{"id":"2605.17932","title":"Prompt Compression in Diffusion Large Language Models: Evaluating LLMLingua-2 on LLaDA","created":"2026-05-18","cited_by_count":1,"area":"inference"},{"id":"2606.05742","title":"AdaPLD: Adaptive Retrieval and Reuse for Efficient Model-Free Speculative Decoding","created":"2026-06-04","cited_by_count":1,"area":"inference"},{"id":"2606.18406","title":"CoreMem: Riemannian Retrieval and Fisher-Guided Distillation for Long-Term Memory in Dialogue Agents","created":"2026-06-16","cited_by_count":1,"area":"inference"},{"id":"2607.01241","title":"Mapping Text to Multiplex Graph: Prompt Compression as L\\'evy Walk-Guided Graph Pruning","created":"2026-05-04","cited_by_count":1,"area":"inference"},{"id":"2607.15516","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","created":"2026-07-17","cited_by_count":1,"area":"inference"},{"id":"2608.26175","title":"Lost in Compression: A Controlled Cross-Lingual Audit of Extractive Prompt Compressors","created":"2026-07-27","cited_by_count":1,"area":"inference"},{"id":"2608.30811","title":"TopoCompress: Long Context Compression via Graph-Wired Semantic Trajectories","created":"2026-08-31","cited_by_count":1,"area":"inference"},{"id":"2609.01507","title":"LatentPress: Context Compression Beyond Text and Vision","created":"2026-09-01","cited_by_count":1,"area":"inference"},{"id":"2609.25537","title":"Compressing Long Context into Answer-Aligned Memory Embeddings for LLM Inference","created":"2026-09-22","cited_by_count":1,"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.23528","title":"The Compression Paradox in LLM Inference: Provider-Dependent Energy Effects of Prompt Compression","created":"2026-03-06","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.19368","title":"Spectral-LSH: Sub-Quadratic Prompt Compression via Krylov-Projected Locality-Sensitive Hashing","created":"2026-06-12","cited_by_count":0,"area":"inference"},{"id":"2607.24260","title":"KAP: Bridging the Knowledge Selection-Runtime Consumption Gap in LLM Systems","created":"2026-07-27","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"},{"id":"2609.13154","title":"Lexical Prompt Compression for Large Language Models: A Training-Free, Deterministic Pipeline with Empirical Pareto Analysis Across Eleven Task Categories","created":"2026-07-08","cited_by_count":0,"area":"inference"},{"id":"2609.32474","title":"PC-SubMax: Efficient Prompt Compression via Regularized Submodular Maximization","created":"2026-09-26","cited_by_count":0,"area":"inference"},{"id":"2609.36526","title":"Adapting Context Compression for Long-Horizon Agents with Counterfactual Continuations","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2610.02953","title":"SlimKV: Joint Token-Feature KV Cache Compression with Reconstruction-Free Beacon Attention","created":"2026-10-02","cited_by_count":0,"area":"inference"}],"next_cursor":null}