{"total":45,"rows":[{"id":"2207.07061","title":"Confident Adaptive Language Modeling","created":"2022-07-14","cited_by_count":310,"area":"inference"},{"id":"2203.16487","title":"Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generation","created":"2022-03-30","cited_by_count":171,"area":"inference"},{"id":"2310.08461","title":"DistillSpec: Improving Speculative Decoding via Knowledge Distillation","created":"2023-10-12","cited_by_count":165,"area":"inference"},{"id":"2302.07863","title":"Speculative Decoding with Big Little Decoder","created":"2023-02-15","cited_by_count":164,"area":"inference"},{"id":"2307.02628","title":"SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inference","created":"2023-07-05","cited_by_count":89,"area":"inference"},{"id":"2402.09398","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","created":"2024-02-14","cited_by_count":75,"area":"inference"},{"id":"2405.19261","title":"Faster Cascades via Speculative Decoding","created":"2024-05-29","cited_by_count":38,"area":"inference"},{"id":"2203.01670","title":"A Simple Hash-Based Early Exiting Approach For Language Understanding and Generation","created":"2022-03-03","cited_by_count":32,"area":"inference"},{"id":"2405.20915","title":"Fast yet Safe: Early-Exiting with Risk Control","created":"2024-05-31","cited_by_count":30,"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":"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":"2502.18779","title":"Towards Optimal Multi-draft Speculative Decoding","created":"2025-02-26","cited_by_count":19,"area":"inference"},{"id":"2410.13461","title":"Progressive Mixed-Precision Decoding for Efficient LLM Inference","created":"2024-10-17","cited_by_count":18,"area":"inference"},{"id":"2601.11580","title":"Speculative Decoding: Performance or Illusion?","created":"2025-12-31","cited_by_count":15,"area":"inference"},{"id":"2402.08644","title":"Tandem Transformers for Inference Efficient LLMs","created":"2024-02-13","cited_by_count":10,"area":"inference"},{"id":"2501.14808","title":"HyGen: Efficient LLM Serving via Elastic Online-Offline Request Co-location","created":"2025-01-15","cited_by_count":10,"area":"inference"},{"id":"2405.14105","title":"Distributed Speculative Inference (DSI): Speculation Parallelism for Provably Faster Lossless Language Model Inference","created":"2024-05-23","cited_by_count":9,"area":"inference"},{"id":"2410.20418","title":"Inevitable Trade-off between Watermark Strength and Speculative Sampling Efficiency for Language Models","created":"2024-10-27","cited_by_count":8,"area":"inference"},{"id":"2505.00570","title":"FreqKV: Key-Value Compression in Frequency Domain for Context Window Extension","created":"2025-05-01","cited_by_count":7,"area":"inference"},{"id":"2405.20314","title":"S3D: A Simple and Cost-Effective Self-Speculative Decoding Scheme for Low-Memory GPUs","created":"2024-05-30","cited_by_count":6,"area":"inference"},{"id":"2411.11055","title":"FastDraft: How to Train Your Draft","created":"2024-11-17","cited_by_count":6,"area":"inference"},{"id":"2602.13836","title":"Speculative Decoding with a Speculative Vocabulary","created":"2026-02-14","cited_by_count":6,"area":"inference"},{"id":"2404.09221","title":"Exploring and Improving Drafts in Blockwise Parallel Decoding","created":"2024-04-14","cited_by_count":5,"area":"inference"},{"id":"2407.20272","title":"An Efficient Inference Framework for Early-exit Large Language Models","created":"2024-07-25","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":"2511.21669","title":"DSD: A Distributed Speculative Decoding Solution for Edge-Cloud Agile Large Model Serving","created":"2025-11-26","cited_by_count":5,"area":"inference"},{"id":"2512.23858","title":"Yggdrasil: Bridging Dynamic Speculation and Static Runtime for Latency-Optimal Tree-Based LLM Decoding","created":"2025-12-29","cited_by_count":4,"area":"inference"},{"id":"2601.15498","title":"MARS: Unleashing the Power of Speculative Decoding via Margin-Aware Verification","created":"2026-01-21","cited_by_count":4,"area":"inference"},{"id":"2604.05417","title":"Multi-Drafter Speculative Decoding with Alignment Feedback","created":"2026-04-07","cited_by_count":4,"area":"inference"},{"id":"2509.23666","title":"Beyond Greedy Exits: Improved Early Exit Decisions for Risk Control and Reliability","created":"2025-09-28","cited_by_count":3,"area":"inference"},{"id":"2509.01083","title":"DSDE: Dynamic Speculative Decoding with KLD Stability for Real-World Serving","created":"2025-09-01","cited_by_count":2,"area":"inference"},{"id":"2510.09332","title":"FLRC: Fine-grained Low-Rank Compressor for Efficient LLM Inference","created":"2025-10-10","cited_by_count":2,"area":"inference"},{"id":"2512.15705","title":"Dynamic Rebatching for Efficient Early-Exit Inference with DREX","created":"2025-12-17","cited_by_count":2,"area":"inference"},{"id":"2609.09662","title":"PELM: Power Efficient On-Device LLM Inference with Speculative Decoding and Dynamic Voltage Frequency Scaling","created":"2026-09-09","cited_by_count":2,"area":"inference"},{"id":"2508.15371","title":"Confidence-Modulated Speculative Decoding for Large Language Models","created":"2025-08-21","cited_by_count":1,"area":"inference"},{"id":"2604.23277","title":"From Similarity to Structure: Training-free LLM Context Compression with Hybrid Graph Priors","created":"2026-04-25","cited_by_count":1,"area":"inference"},{"id":"2609.20186","title":"To Copy or Not to Copy: Controlling Speculative Decoding via Intrinsic Model Signals","created":"2026-09-17","cited_by_count":1,"area":"inference"},{"id":"2505.24544","title":"Cross-Attention Speculative Decoding","created":"2025-05-30","cited_by_count":0,"area":"inference"},{"id":"2510.19705","title":"Fast Inference via Hierarchical Speculative Decoding","created":"2025-10-22","cited_by_count":0,"area":"inference"},{"id":"2604.13634","title":"Calibrated Speculative Decoding: Frequency-Guided Candidate Selection for Efficient Inference","created":"2026-04-15","cited_by_count":0,"area":"inference"},{"id":"2607.27269","title":"Beyond KV Reconstruction: Functional Reconstruction for MLA Draft Models in Speculative Decoding","created":"2026-07-29","cited_by_count":0,"area":"inference"},{"id":"2608.26112","title":"TreeGraft: Adaptive Multi-Drafter Grafting for Tree-Based Speculative Decoding","created":"2026-05-28","cited_by_count":0,"area":"inference"},{"id":"2609.09166","title":"X-CoSD: Communication-Efficient Cross-Vocabulary Collaborative Speculative Decoding","created":"2026-07-15","cited_by_count":0,"area":"inference"},{"id":"2609.19169","title":"SiliconBench: Speed, Memory, and Fidelity for LLM Serving on Unified-Memory Desktops","created":"2026-09-12","cited_by_count":0,"area":"inference"},{"id":"2610.14571","title":"Dissecting the Carbon-SLO Tension in Geo-Distributed LLM Serving","created":"2026-10-10","cited_by_count":0,"area":"inference"}],"next_cursor":null}