{"total":73,"rows":[{"id":"2401.09670","title":"DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Serving","created":"2024-01-18","cited_by_count":617,"area":"inference"},{"id":"2405.16406","title":"SpinQuant: LLM quantization with learned rotations","created":"2024-05-26","cited_by_count":471,"area":"inference"},{"id":"2406.02069","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","created":"2024-06-04","cited_by_count":432,"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":"2408.11850","title":"PEARL: Parallel Speculative Decoding with Adaptive Draft Length","created":"2024-08-13","cited_by_count":85,"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":"2408.12320","title":"TensorOpera Router: A Multi-Model Router for Efficient LLM Inference","created":"2024-08-22","cited_by_count":60,"area":"inference"},{"id":"2407.01527","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","created":"2024-07-01","cited_by_count":42,"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":"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":"2410.18351","title":"AdaEDL: Early Draft Stopping for Speculative Decoding of Large Language Models via an Entropy-based Lower Bound on Token Acceptance Probability","created":"2024-10-24","cited_by_count":25,"area":"inference"},{"id":"2311.00502","title":"Efficient LLM Inference on CPUs","created":"2023-11-01","cited_by_count":24,"area":"inference"},{"id":"2404.08698","title":"Lossless Acceleration of Large Language Model via Adaptive N-gram Parallel Decoding","created":"2024-04-10","cited_by_count":23,"area":"inference"},{"id":"2508.01989","title":"Prefill-Decode Aggregation or Disaggregation? Unifying Both for Goodput-Optimized LLM Serving","created":"2025-08-04","cited_by_count":23,"area":"inference"},{"id":"2403.00858","title":"Direct Alignment of Draft Model for Speculative Decoding with Chat-Fine-Tuned LLMs","created":"2024-02-29","cited_by_count":22,"area":"inference"},{"id":"2402.06082","title":"SubGen: Token Generation in Sublinear Time and Memory","created":"2024-02-08","cited_by_count":21,"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":"2502.15197","title":"TETRIS: Optimal Draft Token Selection for Batch Speculative Decoding","created":"2025-02-21","cited_by_count":15,"area":"inference"},{"id":"2503.06433","title":"Seesaw: High-throughput LLM Inference via Model Re-sharding","created":"2025-03-09","cited_by_count":15,"area":"inference"},{"id":"2504.20456","title":"Reviving Any-Subset Autoregressive Models with Principled Parallel Sampling and Speculative Decoding","created":"2025-04-29","cited_by_count":15,"area":"inference"},{"id":"2410.17375","title":"AMUSD: Asynchronous Multi-Device Speculative Decoding for LLM Acceleration","created":"2024-10-22","cited_by_count":14,"area":"inference"},{"id":"2412.15803","title":"WebLLM: A High-Performance In-Browser LLM Inference Engine","created":"2024-12-20","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":"2403.01273","title":"NoMAD-Attention: Efficient LLM Inference on CPUs Through Multiply-add-free Attention","created":"2024-03-02","cited_by_count":12,"area":"inference"},{"id":"2507.01438","title":"EdgeLoRA: An Efficient Multi-Tenant LLM Serving System on Edge Devices","created":"2025-07-02","cited_by_count":11,"area":"inference"},{"id":"2407.03157","title":"Let the Code LLM Edit Itself When You Edit the Code","created":"2024-07-03","cited_by_count":10,"area":"inference"},{"id":"2510.07651","title":"OBCache: Optimal Brain KV Cache Pruning for Efficient Long-Context LLM Inference","created":"2025-10-09","cited_by_count":10,"area":"inference"},{"id":"2403.08312","title":"StreamingDialogue: Prolonged Dialogue Learning via Long Context Compression with Minimal Losses","created":"2024-03-13","cited_by_count":9,"area":"inference"},{"id":"2410.23079","title":"BUZZ: Beehive-structured Sparse KV Cache with Segmented Heavy Hitters for Efficient LLM Inference","created":"2024-10-30","cited_by_count":9,"area":"inference"},{"id":"2503.13565","title":"ML-SpecQD: Multi-Level Speculative Decoding with Quantized Drafts","created":"2025-03-17","cited_by_count":9,"area":"inference"},{"id":"2507.06517","title":"SpindleKV: A Novel KV Cache Reduction Method Balancing Both Shallow and Deep Layers","created":"2025-07-09","cited_by_count":9,"area":"inference"},{"id":"2605.08840","title":"ReST-KV: Robust KV Cache Eviction with Layer-wise Output Reconstruction and Spatial-Temporal Smoothing","created":"2026-05-09","cited_by_count":9,"area":"inference"},{"id":"2410.01028","title":"Draft on the Fly: Adaptive Self-Speculative Decoding using Cosine Similarity","created":"2024-10-01","cited_by_count":8,"area":"inference"},{"id":"2504.10724","title":"HELIOS: Adaptive Model And Early-Exit Selection for Efficient LLM Inference Serving","created":"2025-04-14","cited_by_count":8,"area":"inference"},{"id":"2412.09036","title":"ZigZagkv: Dynamic KV Cache Compression for Long-context Modeling based on Layer Uncertainty","created":"2024-12-12","cited_by_count":7,"area":"inference"},{"id":"2502.08910","title":"InfiniteHiP: Extending Language Model Context Up to 3 Million Tokens on a Single GPU","created":"2025-02-13","cited_by_count":7,"area":"inference"},{"id":"2502.08923","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","created":"2025-02-13","cited_by_count":6,"area":"inference"},{"id":"2506.02006","title":"MorphServe: Efficient and Workload-Aware LLM Serving via Runtime Quantized Layer Swapping and KV Cache Resizing","created":"2025-05-24","cited_by_count":6,"area":"inference"},{"id":"2406.17404","title":"Make Some Noise: Unlocking Language Model Parallel Inference Capability through Noisy Training","created":"2024-06-25","cited_by_count":5,"area":"inference"},{"id":"2511.22880","title":"Serving Heterogeneous LoRA Adapters in Distributed LLM Inference Systems","created":"2025-11-28","cited_by_count":5,"area":"inference"},{"id":"2412.08521","title":"EMS: Adaptive Evict-then-Merge Strategy for Head-wise KV Cache Compression Based on Global-Local Importance","created":"2024-12-11","cited_by_count":4,"area":"inference"},{"id":"2503.01330","title":"WeightedKV: Attention Scores Weighted Key-Value Cache Merging for Large Language Models","created":"2025-03-03","cited_by_count":4,"area":"inference"},{"id":"2509.10372","title":"MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness","created":"2025-09-12","cited_by_count":4,"area":"inference"},{"id":"2511.16193","title":"Fast LLM Post-training via Decoupled and Fastest-of-N Speculation","created":"2025-11-20","cited_by_count":4,"area":"inference"},{"id":"2604.07622","title":"DIVERSED: Relaxed Speculative Decoding via Dynamic Ensemble Verification","created":"2026-04-08","cited_by_count":4,"area":"inference"},{"id":"2604.26837","title":"Unifying Sparse Attention with Hierarchical Memory for Scalable Long-Context LLM Serving","created":"2026-04-29","cited_by_count":4,"area":"inference"},{"id":"2404.12022","title":"Parallel Decoding via Hidden Transfer for Lossless Large Language Model Acceleration","created":"2024-04-18","cited_by_count":3,"area":"inference"},{"id":"2412.05896","title":"XKV: Personalized KV Cache Memory Reduction for Long-Context LLM Inference","created":"2024-12-08","cited_by_count":3,"area":"inference"},{"id":"2504.03651","title":"Echo: Efficient Co-Scheduling of Hybrid Online-Offline Tasks for Large Language Model Serving","created":"2025-03-01","cited_by_count":3,"area":"inference"},{"id":"2505.05772","title":"Sparse Attention Remapping with Clustering for Efficient LLM Decoding on PIM","created":"2025-05-09","cited_by_count":3,"area":"inference"},{"id":"2509.24328","title":"Speculative Verification: Exploiting Information Gain to Refine Speculative Decoding","created":"2025-09-29","cited_by_count":3,"area":"inference"},{"id":"2510.01336","title":"HiSpec: Hierarchical Speculative Decoding for LLMs","created":"2025-10-01","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":"2403.18647","title":"SDSAT: Accelerating LLM Inference through Speculative Decoding with Semantic Adaptive Tokens","created":"2024-03-27","cited_by_count":2,"area":"inference"},{"id":"2406.07553","title":"Inference Acceleration for Large Language Models on CPUs","created":"2024-03-04","cited_by_count":2,"area":"inference"},{"id":"2502.17139","title":"FastCoder: Accelerating Repository-level Code Generation via Efficient Retrieval and Verification","created":"2025-02-24","cited_by_count":2,"area":"inference"},{"id":"2503.14153","title":"Speculative Decoding for Verilog: Speed and Quality, All in One","created":"2025-03-18","cited_by_count":2,"area":"inference"},{"id":"2507.23035","title":"OASIS: Outlier-Aware LUT-Based GEMM with Dual-Side Quantization for LLM Inference Acceleration","created":"2025-07-30","cited_by_count":2,"area":"inference"},{"id":"2604.25925","title":"SpecTr-GBV: Multi-Draft Block Verification Accelerating Speculative Decoding","created":"2026-04-01","cited_by_count":2,"area":"inference"},{"id":"2605.04357","title":"Coral: Cost-Efficient Multi-LLM Serving over Heterogeneous Cloud GPUs","created":"2026-05-05","cited_by_count":2,"area":"inference"},{"id":"2607.28150","title":"SmartGen: Seamless Disaggregated LLM Inference with Selective KV Cache Transfer","created":"2026-07-30","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":"2408.04678","title":"CREST: Effectively Compacting a Datastore For Retrieval-Based Speculative Decoding","created":"2024-08-08","cited_by_count":1,"area":"inference"},{"id":"2501.12162","title":"AdaServe: Accelerating Multi-SLO LLM Serving with SLO-Customized Speculative Decoding","created":"2025-01-21","cited_by_count":1,"area":"inference"},{"id":"2505.21889","title":"EFIM: Efficient Serving of LLMs for Infilling Tasks with Improved KV Cache Reuse","created":"2025-05-28","cited_by_count":1,"area":"inference"},{"id":"2507.18006","title":"Unlock the Potential of Fine-grained LLM Serving via Dynamic Module Scaling","created":"2025-07-24","cited_by_count":1,"area":"inference"},{"id":"2602.09725","title":"Efficient Remote KV Cache Reuse with GPU-native Video Codec","created":"2026-02-10","cited_by_count":1,"area":"inference"},{"id":"2603.02599","title":"SUN: Shared Use of Next-token Prediction for Efficient Multi-LLM Disaggregated Serving","created":"2026-03-03","cited_by_count":1,"area":"inference"},{"id":"2604.18396","title":"River-LLM: Large Language Model Seamless Exit Based on KV Share","created":"2026-04-20","cited_by_count":1,"area":"inference"},{"id":"2608.08684","title":"RippleKV: Cross-Layer KV Cache Allocation via Perturbation Propagation","created":"2026-08-09","cited_by_count":1,"area":"inference"},{"id":"2604.16400","title":"CoLLM: Continuous Adaptation for SLO-Aware LLM Serving on Shared GPU Clusters","created":"2026-03-31","cited_by_count":0,"area":"inference"},{"id":"2606.14779","title":"Unified KV Pooling to Accelerate Long-Context LLM Serving","created":"2026-06-10","cited_by_count":0,"area":"inference"},{"id":"2609.24635","title":"Written as a Record, Read as an Address: What a Forward Pass Leaves in an Operation's KV Cache","created":"2026-09-21","cited_by_count":0,"area":"inference"}],"next_cursor":null}