{"total":140,"rows":[{"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":"2410.10819","title":"DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Heads","created":"2024-10-14","cited_by_count":288,"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":"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":"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":"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":"2405.04304","title":"Dynamic Speculation Lookahead Accelerates Speculative Decoding of Large Language Models","created":"2024-05-07","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":"2604.12989","title":"Accelerating Speculative Decoding with Block Diffusion Draft Trees","created":"2026-04-14","cited_by_count":29,"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":"2601.19278","title":"DART: Diffusion-Inspired Speculative Decoding for Fast LLM Inference","created":"2026-01-27","cited_by_count":24,"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":"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":"2410.11305","title":"QSpec: Speculative Decoding with Complementary Quantization Schemes","created":"2024-10-15","cited_by_count":18,"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":"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":"2603.12996","title":"DAPD: Dependency-Aware Parallel Decoding via Attention for Diffusion LLMs","created":"2026-03-13","cited_by_count":14,"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":"2512.14681","title":"Fast and Accurate Causal Parallel Decoding using Jacobi Forcing","created":"2025-12-16","cited_by_count":13,"area":"inference"},{"id":"2602.06953","title":"DAWN: Dependency-Aware Fast Inference for Diffusion LLMs","created":"2026-02-06","cited_by_count":13,"area":"inference"},{"id":"2605.29343","title":"Draft-OPD: On-Policy Distillation for Speculative Draft Models","created":"2026-05-28","cited_by_count":11,"area":"inference"},{"id":"2402.08644","title":"Tandem Transformers for Inference Efficient LLMs","created":"2024-02-13","cited_by_count":10,"area":"inference"},{"id":"2511.22972","title":"Training-Free Loosely Speculative Decoding: Accepting Semantically Correct Drafts Beyond Exact Match","created":"2025-11-28","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":"2503.13565","title":"ML-SpecQD: Multi-Level Speculative Decoding with Quantized Drafts","created":"2025-03-17","cited_by_count":9,"area":"inference"},{"id":"2602.11812","title":"Predicting LLM Output Length via Entropy-Guided Representations","created":"2026-02-12","cited_by_count":9,"area":"inference"},{"id":"2606.02091","title":"DFlare: Scaling Up Draft Capacity for Block Diffusion Speculative Decoding","created":"2026-06-01","cited_by_count":9,"area":"inference"},{"id":"2510.19779","title":"AdaSPEC: Selective Knowledge Distillation for Efficient Speculative Decoders","created":"2025-10-22","cited_by_count":8,"area":"inference"},{"id":"2608.02438","title":"xPress: Parallel Refinement for Diffusion Drafters in Speculative Decoding","created":"2026-08-03","cited_by_count":8,"area":"inference"},{"id":"2403.08845","title":"Bifurcated Attention: Accelerating Massively Parallel Decoding with Shared Prefixes in LLMs","created":"2024-03-13","cited_by_count":7,"area":"inference"},{"id":"2601.17917","title":"Streaming-dLLM: Accelerating Diffusion LLMs via Suffix Pruning and Dynamic Decoding","created":"2026-01-25","cited_by_count":7,"area":"inference"},{"id":"2602.05992","title":"DSB: Dynamic Sliding Block Scheduling for Diffusion LLMs","created":"2026-02-05","cited_by_count":7,"area":"inference"},{"id":"2606.01813","title":"Cost-Aware Diffusion Draft Trees for Speculative Decoding","created":"2026-06-01","cited_by_count":6,"area":"inference"},{"id":"2608.13524","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","created":"2026-08-13","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":"2510.05090","title":"Finish First, Perfect Later: Test-Time Token-Level Cross-Validation for Diffusion Large Language Models","created":"2025-10-06","cited_by_count":5,"area":"inference"},{"id":"2608.30135","title":"Verification-Aware Training for Speculative Decoding","created":"2026-08-31","cited_by_count":5,"area":"inference"},{"id":"2505.17074","title":"Semi-Clairvoyant Scheduling of Speculative Decoding Requests to Minimize LLM Inference Latency","created":"2025-05-20","cited_by_count":4,"area":"inference"},{"id":"2505.20438","title":"HAMburger: Accelerating LLM Inference via Token Smashing","created":"2025-05-26","cited_by_count":4,"area":"inference"},{"id":"2506.05632","title":"List-Level Distribution Coupling with Applications to Speculative Decoding and Lossy Compression","created":"2025-06-05","cited_by_count":4,"area":"inference"},{"id":"2507.02659","title":"OmniDraft: A Cross-vocabulary, Online Adaptive Drafter for On-device Speculative Decoding","created":"2025-07-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":"2510.13602","title":"NOSA: Native and Offloadable Sparse Attention","created":"2025-10-15","cited_by_count":4,"area":"inference"},{"id":"2511.00351","title":"Reject Only Critical Tokens: Pivot-Aware Speculative Decoding","created":"2025-11-01","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":"2602.22868","title":"Rejection Mixing: Fast Semantic Propagation of Mask Tokens for Efficient DLLM Inference","created":"2026-02-26","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":"2606.03819","title":"TreeFlash: Parallel AR-Approximation for Faster Speculative Decoding","created":"2026-06-02","cited_by_count":4,"area":"inference"},{"id":"2607.07409","title":"DeLS-Spec: Decoupled Long-Short Contexts for Parallel Speculative Drafting","created":"2026-07-08","cited_by_count":4,"area":"inference"},{"id":"2607.25852","title":"AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding","created":"2026-07-28","cited_by_count":4,"area":"inference"},{"id":"2506.17286","title":"GTA: Grouped-head latenT Attention","created":"2025-06-15","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":"2601.09703","title":"ShortCoder: Knowledge-Augmented Syntax Optimization for Token-Efficient Code Generation","created":"2026-01-14","cited_by_count":3,"area":"inference"},{"id":"2602.23200","title":"InnerQ: Hardware-Aware Tuning-Free Quantization of KV Cache for Large Language Models","created":"2026-02-26","cited_by_count":3,"area":"inference"},{"id":"2604.07931","title":"Robust Length Prediction: A Perspective from Heavy-Tailed Prompt-Conditioned Distributions","created":"2026-04-09","cited_by_count":3,"area":"inference"},{"id":"2607.06763","title":"Trees from Marginals: Autoregressive drafting with factorized priors","created":"2026-07-07","cited_by_count":3,"area":"inference"},{"id":"2607.22634","title":"PRESTO: Prefix-Aligned Tree Drafting for Diffusion Speculative Decoding","created":"2026-06-20","cited_by_count":3,"area":"inference"},{"id":"2608.01651","title":"Bole: Efficient Tree Speculation for Hybrid-Attention Language Models","created":"2026-08-03","cited_by_count":3,"area":"inference"},{"id":"2608.02123","title":"From Chains to Trees: Parent-Conditioned Drafting for Semi-Autoregressive Speculative Decoding","created":"2026-08-03","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":"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":"2602.01274","title":"PACER: Blockwise Pre-verification for Speculative Decoding with Adaptive Length","created":"2026-02-01","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.02047","title":"Goose: Anisotropic Speculation Trees for Training-Free Speculative Decoding","created":"2026-04-02","cited_by_count":2,"area":"inference"},{"id":"2605.16786","title":"Lever: Speculative LLM Inference on Smartphones","created":"2026-05-16","cited_by_count":2,"area":"inference"},{"id":"2605.24793","title":"Beyond the Target: From Imitation to Collaboration in Speculative Decoding","created":"2026-05-24","cited_by_count":2,"area":"inference"},{"id":"2605.29727","title":"Bastion: Budget-Aware Speculative Decoding with Tree-structured Block Diffusion Drafting","created":"2026-05-28","cited_by_count":2,"area":"inference"},{"id":"2606.04446","title":"D^2SD: Accelerating Speculative Decoding with Dual Diffusion Draft Models","created":"2026-06-03","cited_by_count":2,"area":"inference"},{"id":"2606.31315","title":"BlockPilot: Instance-Adaptive Policy Learning for Diffusion-based Speculative Decoding","created":"2026-06-30","cited_by_count":2,"area":"inference"},{"id":"2609.06498","title":"DFlow: Enabling Verifier Information Flow in Block Diffusion Speculative Decoding","created":"2026-09-06","cited_by_count":2,"area":"inference"},{"id":"2609.17184","title":"LoopSpec: Pipelined Self-Speculative Decoding for Looped Transformers","created":"2026-09-15","cited_by_count":2,"area":"inference"},{"id":"2609.27396","title":"When Parallel Drafter Meets Parallel Speculative Decoding","created":"2026-09-23","cited_by_count":2,"area":"inference"},{"id":"2505.23219","title":"Ghidorah: Fast LLM Inference on Edge with Speculative Decoding and Hetero-Core Parallelism","created":"2025-05-29","cited_by_count":1,"area":"inference"},{"id":"2601.23180","title":"TriSpec: Ternary Speculative Decoding via Lightweight Proxy Verification","created":"2026-01-30","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.09630","title":"Scratchpad Patching: Decoupling Compute from Patch Size in Byte-Level Language Models","created":"2026-05-10","cited_by_count":1,"area":"inference"},{"id":"2605.15609","title":"PSD: Pushing the Pareto Frontier of Diffusion LLMs via Parallel Speculative Decoding","created":"2026-05-15","cited_by_count":1,"area":"inference"},{"id":"2605.24832","title":"Optimus: Elastic Decoding for Efficient Diffusion LLM Serving","created":"2026-05-24","cited_by_count":1,"area":"inference"},{"id":"2605.30753","title":"Efficient Diffusion LLMs via Temporal-Spatial Parallel Decoding and Confidence Extrapolation","created":"2026-05-29","cited_by_count":1,"area":"inference"},{"id":"2607.10661","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","created":"2026-07-12","cited_by_count":1,"area":"inference"},{"id":"2607.14107","title":"Polestar: Drift-Aware Cache Calibration and Token Commitment for Efficient Inference of Diffusion LLMs","created":"2026-05-07","cited_by_count":1,"area":"inference"},{"id":"2608.00531","title":"CURE: Local Uncertainty Repair for Block-Parallel Speculative Decoding","created":"2026-08-01","cited_by_count":1,"area":"inference"},{"id":"2608.11742","title":"Ripple-Pivot Search: Active Parallel Decoding for Diffusion Large Language Models","created":"2026-08-12","cited_by_count":1,"area":"inference"},{"id":"2609.26368","title":"HySparse2: Hybrid Sparse Attention with Two-Level KV Sharing","created":"2026-09-22","cited_by_count":1,"area":"inference"},{"id":"2609.36173","title":"Draft in Parallel, Condition Through Depth: Adjacent Causal Injection for Speculative Decoding","created":"2026-09-28","cited_by_count":1,"area":"inference"},{"id":"2508.04462","title":"CARD: A Cache-Assisted Parallel Speculative Decoding Framework via Query-and-Correct Paradigm for Accelerating LLM Inference","created":"2025-08-06","cited_by_count":0,"area":"inference"},{"id":"2512.14069","title":"RADAR: Accelerate Large Language Model Inference With RL-Based Dynamic Draft Trees","created":"2025-12-16","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":"2604.12452","title":"Latent-Condensed Transformer for Efficient Long Context Modeling","created":"2026-04-14","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"}],"next_cursor":"100"}