{"total":426,"rows":[{"id":"2310.01801","title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","created":"2023-10-03","cited_by_count":474,"area":"inference"},{"id":"2406.16858","title":"EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees","created":"2024-06-24","cited_by_count":370,"area":"inference"},{"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":"2503.01840","title":"EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test","created":"2025-03-03","cited_by_count":331,"area":"inference"},{"id":"2404.16710","title":"LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding","created":"2024-04-25","cited_by_count":307,"area":"inference"},{"id":"2402.02057","title":"Break the Sequential Dependency of LLM Inference Using Lookahead Decoding","created":"2024-02-03","cited_by_count":298,"area":"inference"},{"id":"2401.07851","title":"Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding","created":"2024-01-15","cited_by_count":269,"area":"inference"},{"id":"2310.08461","title":"DistillSpec: Improving Speculative Decoding via Knowledge Distillation","created":"2023-10-12","cited_by_count":165,"area":"inference"},{"id":"2403.05527","title":"GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM","created":"2024-03-08","cited_by_count":158,"area":"inference"},{"id":"2405.12532","title":"PyramidInfer: Pyramid KV Cache Compression for High-throughput LLM Inference","created":"2024-05-21","cited_by_count":147,"area":"inference"},{"id":"2405.14366","title":"MiniCache: KV Cache Compression in Depth Dimension for Large Language Models","created":"2024-05-23","cited_by_count":125,"area":"inference"},{"id":"2310.07177","title":"Online Speculative Decoding","created":"2023-10-11","cited_by_count":113,"area":"inference"},{"id":"2506.00413","title":"Accelerating Diffusion LLMs via Adaptive Parallel Decoding","created":"2025-05-31","cited_by_count":112,"area":"inference"},{"id":"2401.03462","title":"Long Context Compression with Activation Beacon","created":"2024-01-07","cited_by_count":104,"area":"inference"},{"id":"2402.18096","title":"No Token Left Behind: Reliable KV Cache Compression via Importance-Aware Mixed Precision Quantization","created":"2024-02-28","cited_by_count":101,"area":"inference"},{"id":"2505.23416","title":"KVzip: Query-Agnostic KV Cache Compression with Context Reconstruction","created":"2025-05-29","cited_by_count":95,"area":"inference"},{"id":"2405.14256","title":"ZipCache: Accurate and Efficient KV Cache Quantization with Salient Token Identification","created":"2024-05-23","cited_by_count":93,"area":"inference"},{"id":"2502.08773","title":"Universal Model Routing for Efficient LLM Inference","created":"2025-02-12","cited_by_count":86,"area":"inference"},{"id":"2408.11850","title":"PEARL: Parallel Speculative Decoding with Adaptive Draft Length","created":"2024-08-13","cited_by_count":85,"area":"inference"},{"id":"2312.11462","title":"Cascade Speculative Drafting for Even Faster LLM Inference","created":"2023-12-18","cited_by_count":83,"area":"inference"},{"id":"2405.03917","title":"KV Cache is 1 Bit Per Channel: Efficient Large Language Model Inference with Coupled Quantization","created":"2024-05-07","cited_by_count":76,"area":"inference"},{"id":"2402.02082","title":"GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decoding","created":"2024-02-03","cited_by_count":75,"area":"inference"},{"id":"2405.19715","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","created":"2024-05-30","cited_by_count":75,"area":"inference"},{"id":"2403.00835","title":"CLLMs: Consistency Large Language Models","created":"2024-02-28","cited_by_count":72,"area":"inference"},{"id":"2408.15766","title":"Learning Harmonized Representations for Speculative Sampling","created":"2024-08-28","cited_by_count":72,"area":"inference"},{"id":"2410.06916","title":"SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration","created":"2024-10-09","cited_by_count":72,"area":"inference"},{"id":"2406.17276","title":"OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure","created":"2024-06-25","cited_by_count":67,"area":"inference"},{"id":"2502.16002","title":"KVLink: Accelerating Large Language Models via Efficient KV Cache Reuse","created":"2025-02-21","cited_by_count":66,"area":"inference"},{"id":"2509.26488","title":"dParallel: Learnable Parallel Decoding for dLLMs","created":"2025-09-30","cited_by_count":65,"area":"inference"},{"id":"2408.12320","title":"TensorOpera Router: A Multi-Model Router for Efficient LLM Inference","created":"2024-08-22","cited_by_count":60,"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":"2408.14690","title":"Training-Free Activation Sparsity in Large Language Models","created":"2024-08-26","cited_by_count":55,"area":"inference"},{"id":"2410.03111","title":"LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy","created":"2024-10-04","cited_by_count":51,"area":"inference"},{"id":"2501.16383","title":"RotateKV: Accurate and Robust 2-Bit KV Cache Quantization for LLMs via Outlier-Aware Adaptive Rotations","created":"2025-01-25","cited_by_count":46,"area":"inference"},{"id":"2402.13516","title":"ProSparse: Introducing and Enhancing Intrinsic Activation Sparsity within Large Language Models","created":"2024-02-21","cited_by_count":45,"area":"inference"},{"id":"2510.04767","title":"ParallelBench: Understanding the Trade-offs of Parallel Decoding in Diffusion LLMs","created":"2025-10-06","cited_by_count":43,"area":"inference"},{"id":"2502.04420","title":"KVTuner: Sensitivity-Aware Layer-Wise Mixed-Precision KV Cache Quantization for Efficient and Nearly Lossless LLM Inference","created":"2025-02-06","cited_by_count":40,"area":"inference"},{"id":"2411.10666","title":"SAM Decoding: Speculative Decoding via Suffix Automaton","created":"2024-11-16","cited_by_count":39,"area":"inference"},{"id":"2405.19261","title":"Faster Cascades via Speculative Decoding","created":"2024-05-29","cited_by_count":38,"area":"inference"},{"id":"2601.07568","title":"d3LLM: Ultra-Fast Diffusion LLM using Pseudo-Trajectory Distillation","created":"2026-01-12","cited_by_count":37,"area":"inference"},{"id":"2605.29707","title":"Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decoding","created":"2026-05-28","cited_by_count":34,"area":"inference"},{"id":"2406.03853","title":"Speculative Decoding via Early-exiting for Faster LLM Inference with Thompson Sampling Control Mechanism","created":"2024-06-06","cited_by_count":32,"area":"inference"},{"id":"2504.06261","title":"Hogwild! Inference: Parallel LLM Generation via Concurrent Attention","created":"2025-04-08","cited_by_count":32,"area":"inference"},{"id":"2510.14973","title":"Attention Is All You Need for KV Cache in Diffusion LLMs","created":"2025-10-16","cited_by_count":32,"area":"inference"},{"id":"2406.13035","title":"D2O: Dynamic Discriminative Operations for Efficient Long-Context Inference of Large Language Models","created":"2024-06-18","cited_by_count":31,"area":"inference"},{"id":"2509.26432","title":"AdaBlock-dLLM: Semantic-Aware Diffusion LLM Inference via Adaptive Block Size","created":"2025-09-30","cited_by_count":31,"area":"inference"},{"id":"2403.10444","title":"Block Verification Accelerates Speculative Decoding","created":"2024-03-15","cited_by_count":30,"area":"inference"},{"id":"2510.04147","title":"Self Speculative Decoding for Diffusion Large Language Models","created":"2025-10-05","cited_by_count":30,"area":"inference"},{"id":"2410.14731","title":"MatryoshkaKV: Adaptive KV Compression via Trainable Orthogonal Projection","created":"2024-10-16","cited_by_count":29,"area":"inference"},{"id":"2504.18583","title":"PARD: Accelerating LLM Inference with Low-Cost PARallel Draft Model Adaptation","created":"2025-04-23","cited_by_count":29,"area":"inference"},{"id":"2604.12989","title":"Accelerating Speculative Decoding with Block Diffusion Draft Trees","created":"2026-04-14","cited_by_count":29,"area":"inference"},{"id":"2506.18879","title":"CommVQ: Commutative Vector Quantization for KV Cache Compression","created":"2025-06-23","cited_by_count":28,"area":"inference"},{"id":"2509.25188","title":"Learning to Parallel: Accelerating Diffusion Large Language Models via Learnable Parallel Decoding","created":"2025-09-29","cited_by_count":27,"area":"inference"},{"id":"2412.03131","title":"DiffKV: Differentiated Memory Management for Large Language Models with Parallel KV Compaction","created":"2024-12-04","cited_by_count":26,"area":"inference"},{"id":"2402.13720","title":"Ouroboros: Generating Longer Drafts Phrase by Phrase for Faster Speculative Decoding","created":"2024-02-21","cited_by_count":25,"area":"inference"},{"id":"2509.23094","title":"d$^2$Cache: Accelerating Diffusion-Based LLMs via Dual Adaptive Caching","created":"2025-09-27","cited_by_count":25,"area":"inference"},{"id":"2504.08850","title":"SpecEE: Accelerating Large Language Model Inference with Speculative Early Exiting","created":"2025-04-11","cited_by_count":23,"area":"inference"},{"id":"2410.05589","title":"ParallelSpec: Parallel Drafter for Efficient Speculative Decoding","created":"2024-10-08","cited_by_count":22,"area":"inference"},{"id":"2503.16525","title":"KVShare: An LLM Service System with Efficient and Effective Multi-Tenant KV Cache Reuse","created":"2025-03-17","cited_by_count":22,"area":"inference"},{"id":"2508.09442","title":"Shadow in the Cache: Unveiling and Mitigating Privacy Risks of KV-cache in LLM Inference","created":"2025-08-13","cited_by_count":21,"area":"inference"},{"id":"2509.18085","title":"Structuring The Future: Diffusion LLM Speculative Decoding via Calibrated Draft Graphs","created":"2025-09-22","cited_by_count":21,"area":"inference"},{"id":"2510.07081","title":"Accelerating Diffusion LLM Inference via Local Determinism Propagation","created":"2025-10-08","cited_by_count":21,"area":"inference"},{"id":"2412.12639","title":"Falcon: Faster and Parallel Inference of Large Language Models through Enhanced Semi-Autoregressive Drafting and Custom-Designed Decoding Tree","created":"2024-12-17","cited_by_count":20,"area":"inference"},{"id":"2412.13649","title":"SCOPE: Optimizing Key-Value Cache Compression in Long-context Generation","created":"2024-12-18","cited_by_count":20,"area":"inference"},{"id":"2502.14856","title":"FR-Spec: Accelerating Large-Vocabulary Language Models via Frequency-Ranked Speculative Sampling","created":"2025-02-20","cited_by_count":20,"area":"inference"},{"id":"2410.03960","title":"SwiftKV: Fast Prefill-Optimized Inference with Knowledge-Preserving Model Transformation","created":"2024-10-04","cited_by_count":19,"area":"inference"},{"id":"2510.00294","title":"Free Draft-and-Verification: Toward Lossless Parallel Decoding for Diffusion Large Language Models","created":"2025-09-30","cited_by_count":19,"area":"inference"},{"id":"2512.03324","title":"Cache What Lasts: Token Retention for Memory-Bounded KV Cache in LLMs","created":"2025-12-03","cited_by_count":19,"area":"inference"},{"id":"2603.04445","title":"Dynamic Model Routing and Cascading for Efficient LLM Inference: A Survey","created":"2026-02-23","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":"2410.11305","title":"QSpec: Speculative Decoding with Complementary Quantization Schemes","created":"2024-10-15","cited_by_count":18,"area":"inference"},{"id":"2412.18910","title":"AdaEAGLE: Optimizing Speculative Decoding via Explicit Modeling of Adaptive Draft Structures","created":"2024-12-25","cited_by_count":18,"area":"inference"},{"id":"2503.05096","title":"AdaSpec: Adaptive Speculative Decoding for Fast, SLO-Aware Large Language Model Serving","created":"2025-03-07","cited_by_count":18,"area":"inference"},{"id":"2505.10938","title":"Accurate KV Cache Quantization with Outlier Tokens Tracing","created":"2025-05-16","cited_by_count":18,"area":"inference"},{"id":"2602.23881","title":"LK Losses: Direct Acceptance Rate Optimization for Speculative Decoding","created":"2026-02-27","cited_by_count":18,"area":"inference"},{"id":"2410.03804","title":"Mixture of Attentions For Speculative Decoding","created":"2024-10-04","cited_by_count":17,"area":"inference"},{"id":"2412.08890","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","created":"2024-12-12","cited_by_count":17,"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":"2512.16229","title":"LoPA: Scaling dLLM Inference via Lookahead Parallel Decoding","created":"2025-12-18","cited_by_count":17,"area":"inference"},{"id":"2605.18810","title":"D-PACE: Dynamic Position-Aware Cross-Entropy for Parallel Speculative Drafting","created":"2026-05-12","cited_by_count":17,"area":"inference"},{"id":"2405.18628","title":"Hardware-Aware Parallel Prompt Decoding for Memory-Efficient Acceleration of LLM Inference","created":"2024-05-28","cited_by_count":16,"area":"inference"},{"id":"2502.11018","title":"GRIFFIN: Effective Token Alignment for Faster Speculative Decoding","created":"2025-02-16","cited_by_count":16,"area":"inference"},{"id":"2410.03090","title":"UNComp: Can Matrix Entropy Uncover Sparsity? -- A Compressor Design from an Uncertainty-Aware Perspective","created":"2024-10-04","cited_by_count":15,"area":"inference"},{"id":"2412.00061","title":"Speculative Decoding with CTC-based Draft Model for LLM Inference Acceleration","created":"2024-11-25","cited_by_count":15,"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":"2601.11580","title":"Speculative Decoding: Performance or Illusion?","created":"2025-12-31","cited_by_count":15,"area":"inference"},{"id":"2603.03251","title":"Speculative Speculative Decoding","created":"2026-03-03","cited_by_count":15,"area":"inference"},{"id":"2606.18394","title":"JetSpec: Breaking the Scaling Ceiling of Speculative Decoding with Parallel Tree Drafting","created":"2026-06-16","cited_by_count":15,"area":"inference"},{"id":"2608.03893","title":"Cross-Model KV Cache Transfer in LLM Families: A Closed-Form Linear Mapping for Prefill Reuse","created":"2026-08-04","cited_by_count":15,"area":"inference"},{"id":"2310.06927","title":"Sparse Fine-tuning for Inference Acceleration of Large Language Models","created":"2023-10-10","cited_by_count":14,"area":"inference"},{"id":"2411.03786","title":"The N-Grammys: Accelerating Autoregressive Inference with Learning-Free Batched Speculation","created":"2024-11-06","cited_by_count":14,"area":"inference"},{"id":"2507.01449","title":"LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation","created":"2025-07-02","cited_by_count":14,"area":"inference"},{"id":"2603.12996","title":"DAPD: Dependency-Aware Parallel Decoding via Attention for Diffusion LLMs","created":"2026-03-13","cited_by_count":14,"area":"inference"},{"id":"2504.20039","title":"AutoJudge: Judge Decoding Without Manual Annotation","created":"2025-04-28","cited_by_count":13,"area":"inference"},{"id":"2506.07851","title":"Learning to Focus: Causal Attention Distillation via Gradient-Guided Token Pruning","created":"2025-06-09","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":"2509.02718","title":"Efficient Training-Free Online Routing for High-Volume Multi-LLM Serving","created":"2025-09-02","cited_by_count":13,"area":"inference"},{"id":"2510.06133","title":"CreditDecoding: Accelerating Parallel Decoding in Diffusion Large Language Models with Trace Credit","created":"2025-10-07","cited_by_count":13,"area":"inference"},{"id":"2511.01815","title":"KV Cache Transform Coding for Compact Storage in LLM Inference","created":"2025-11-03","cited_by_count":13,"area":"inference"}],"next_cursor":"100"}