{"total":57,"rows":[{"id":"2310.06839","title":"LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression","created":"2023-10-10","cited_by_count":453,"area":"inference"},{"id":"2405.16444","title":"CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion","created":"2024-05-26","cited_by_count":223,"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":"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":"2506.06266","title":"Cartridges: Lightweight and general-purpose long context representations via self-study","created":"2025-06-06","cited_by_count":86,"area":"inference"},{"id":"2407.14057","title":"LazyLLM: Dynamic Token Pruning for Efficient Long Context LLM Inference","created":"2024-07-19","cited_by_count":70,"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":"2505.18227","title":"Token Reduction Should Go Beyond Efficiency in Generative Models -- From Vision, Language to Multimodality","created":"2025-05-23","cited_by_count":50,"area":"inference"},{"id":"2410.03065","title":"Compute Or Load KV Cache? Why Not Both?","created":"2024-10-04","cited_by_count":25,"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":"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":"2409.13761","title":"Do Large Language Models Need a Content Delivery Network?","created":"2024-09-16","cited_by_count":16,"area":"inference"},{"id":"2604.19572","title":"A Self-Evolving Framework for Efficient Terminal Agents via Observational Context Compression","created":"2026-04-21","cited_by_count":15,"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":"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":"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":"2608.06503","title":"Toward Reliable Context Compression for Long-Horizon Agents: An Empirical Study of Execution Instability","created":"2026-08-06","cited_by_count":10,"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":"2510.20797","title":"No Mean Feat: Simple, Strong Baselines for Context Compression","created":"2025-10-23","cited_by_count":7,"area":"inference"},{"id":"2401.09486","title":"LoMA: Lossless Compressed Memory Attention","created":"2024-01-16","cited_by_count":6,"area":"inference"},{"id":"2412.09919","title":"B-VLLM: A Vision Large Language Model with Balanced Spatio-Temporal Tokens","created":"2024-12-13","cited_by_count":6,"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":"2504.04514","title":"Saliency-driven Dynamic Token Pruning for Large Language Models","created":"2025-04-06","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":"2501.06730","title":"Better Prompt Compression Without Multi-Layer Perceptrons","created":"2025-01-12","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":"2509.16857","title":"ShadowServe: Interference-Free KV Cache Fetching for Distributed Prefix Caching","created":"2025-09-21","cited_by_count":3,"area":"inference"},{"id":"2512.14244","title":"From Context to EDUs: Faithful and Structured Context Compression via Elementary Discourse Unit Decomposition","created":"2025-12-16","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":"2508.17032","title":"Learned Structure in Cartridges: Keys as Shareable Routers in Self-Studied Representations","created":"2025-08-23","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":"2605.04426","title":"Telegraph English: Semantic Prompt Compression via Structured Symbolic Rewriting","created":"2026-05-06","cited_by_count":2,"area":"inference"},{"id":"2609.35621","title":"Cartridges++: KV Cache Compression without Off-Context Derailment","created":"2026-09-28","cited_by_count":2,"area":"inference"},{"id":"2407.19410","title":"AdaCoder: Adaptive Prompt Compression for Programmatic Visual Question Answering","created":"2024-07-28","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":"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.30647","title":"What It Costs to Compose, Rebuild, and Correct Precomputed Memory","created":"2026-08-31","cited_by_count":1,"area":"inference"},{"id":"2409.00855","title":"LanguaShrink: Reducing Token Overhead with Psycholinguistics","created":"2024-09-01","cited_by_count":0,"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":"2603.25926","title":"Density-aware Soft Context Compression with Semi-Dynamic Compression Ratio","created":"2026-03-26","cited_by_count":0,"area":"inference"},{"id":"2606.03739","title":"Entropy Gate: Entropy Quenching for Near-Lossless Token Compression in LLM Pipelines","created":"2026-06-02","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":"2608.21362","title":"KVBoost: Chunk-Level Key-Value Cache Reuse with Deviation-Guided Recomputation for Efficient Large Language Model Inference","created":"2026-05-21","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"}],"next_cursor":null}