{"total":51,"rows":[{"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.21465","title":"ShadowKV: KV Cache in Shadows for High-Throughput Long-Context LLM Inference","created":"2024-10-28","cited_by_count":134,"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":"2412.10319","title":"SCBench: A KV Cache-Centric Analysis of Long-Context Methods","created":"2024-12-13","cited_by_count":60,"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.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":"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":"2407.08892","title":"Characterizing Prompt Compression Methods for Long Context Inference","created":"2024-07-11","cited_by_count":18,"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":"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":"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":"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":"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":"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":"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":"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":"2510.20797","title":"No Mean Feat: Simple, Strong Baselines for Context Compression","created":"2025-10-23","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":"2607.07847","title":"When Does Continual Learning Require Learning","created":"2026-07-08","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":"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":"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":"2603.16514","title":"FleetOpt: Analytical Fleet Provisioning for LLM Inference with Compress-and-Route as Implementation Mechanism","created":"2026-03-17","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.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.23527","title":"Compression Method Matters: Benchmark-Dependent Output Dynamics in LLM Prompt Compression","created":"2026-03-06","cited_by_count":2,"area":"inference"},{"id":"2604.09613","title":"Token-Budget-Aware Pool Routing for Cost-Efficient LLM Inference","created":"2026-03-13","cited_by_count":2,"area":"inference"},{"id":"2503.23274","title":"PromptDistill: Query-based Selective Token Retention in Intermediate Layers for Efficient Large Language Model Inference","created":"2025-03-30","cited_by_count":1,"area":"inference"},{"id":"2512.03643","title":"Optical Context Compression Is Just (Bad) Autoencoding","created":"2025-12-03","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":"2607.27600","title":"Back from the Future: Key-Value Cache Management by Counter-Causal Surprise","created":"2026-07-30","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":"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":"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":"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.13605","title":"zip2zip++: Towards Inference-Time Token Compression with Minimal Quality Loss","created":"2026-10-09","cited_by_count":0,"area":"inference"}],"next_cursor":null}