{"total":50,"rows":[{"id":"2604.12989","title":"Accelerating Speculative Decoding with Block Diffusion Draft Trees","created":"2026-04-14","cited_by_count":29,"area":"inference"},{"id":"2502.19732","title":"Speculative Decoding and Beyond: An In-Depth Survey of Techniques","created":"2025-02-27","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":"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.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":"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":"2504.19720","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","created":"2025-04-28","cited_by_count":16,"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":"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":"2601.07353","title":"TALON: Confidence-Aware Speculative Decoding with Adaptive Token Trees","created":"2026-01-12","cited_by_count":13,"area":"inference"},{"id":"2604.09603","title":"ECHO: Elastic Speculative Decoding with Sparse Gating for High-Concurrency Scenarios","created":"2026-03-10","cited_by_count":12,"area":"inference"},{"id":"2505.13204","title":"Alignment-Augmented Speculative Decoding with Alignment Sampling and Conditional Verification","created":"2025-05-19","cited_by_count":10,"area":"inference"},{"id":"2502.13652","title":"C2T: A Classifier-Based Tree Construction Method in Speculative Decoding","created":"2025-02-19","cited_by_count":9,"area":"inference"},{"id":"2502.16880","title":"CORAL: Learning Consistent Representations across Multi-step Training with Lighter Speculative Drafter","created":"2025-02-24","cited_by_count":9,"area":"inference"},{"id":"2505.12398","title":"Traversal Verification for Speculative Tree Decoding","created":"2025-05-18","cited_by_count":9,"area":"inference"},{"id":"2411.13157","title":"Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding","created":"2024-11-20","cited_by_count":7,"area":"inference"},{"id":"2512.22420","title":"Nightjar: Dynamic Adaptive Speculative Decoding for Large Language Models Serving","created":"2025-12-27","cited_by_count":6,"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":"2505.20776","title":"SpecExtend: A Drop-in Enhancement for Speculative Decoding of Long Sequences","created":"2025-05-27","cited_by_count":5,"area":"inference"},{"id":"2509.19873","title":"SpecMamba: Accelerating Mamba Inference on FPGA with Speculative Decoding","created":"2025-09-24","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":"2606.03819","title":"TreeFlash: Parallel AR-Approximation for Faster Speculative Decoding","created":"2026-06-02","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":"2502.02493","title":"EasySpec: Layer-Parallel Speculative Decoding for Efficient Multi-GPU Utilization","created":"2025-02-04","cited_by_count":3,"area":"inference"},{"id":"2605.07243","title":"SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Drafting","created":"2026-05-08","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.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":"2506.03566","title":"POSS: Position Specialist Generates Better Draft for Speculative Decoding","created":"2025-06-04","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":"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":"2507.02620","title":"FlowSpec: Continuous Pipelined Speculative Decoding for Efficient Distributed LLM Inference","created":"2025-07-03","cited_by_count":1,"area":"inference"},{"id":"2603.18016","title":"MineDraft: A Framework for Batch Parallel Speculative Decoding","created":"2026-02-24","cited_by_count":1,"area":"inference"},{"id":"2606.00021","title":"SENSE: Semantic Embedding Navigation with Soft-gated Evaluation for Retrieval-based Speculative Decoding","created":"2026-04-14","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.03447","title":"Approximate Speculative Decoding","created":"2026-08-04","cited_by_count":1,"area":"inference"},{"id":"2609.02897","title":"Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding","created":"2026-07-03","cited_by_count":1,"area":"inference"},{"id":"2609.21827","title":"RheoSampling: Resolving the One-Hot Dilemma in Stochastic Dynamic-Tree Speculative Decoding","created":"2026-09-18","cited_by_count":1,"area":"inference"},{"id":"2609.22098","title":"TreeSpark: Calibrated, Load-Adaptive Draft Trees for Semi-Autoregressive Speculative Decoding","created":"2026-08-12","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":"2602.16994","title":"Dynamic Delayed Tree Expansion For Improved Multi-Path Speculative Decoding","created":"2026-02-19","cited_by_count":0,"area":"inference"},{"id":"2602.18931","title":"WANSpec: Leveraging Global Compute Capacity for LLM Inference","created":"2026-02-21","cited_by_count":0,"area":"inference"},{"id":"2605.11186","title":"CATS: Cascaded Adaptive Tree Speculation for Memory-Limited LLM Inference Acceleration","created":"2026-05-11","cited_by_count":0,"area":"inference"},{"id":"2608.05926","title":"BALANCE: Hybrid Autoregressive-Speculative LLM Inference at the Network Edge","created":"2026-08-06","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.23900","title":"LumoTree: Path-Parallel Speculative Verification for Hybrid Language Models","created":"2026-09-20","cited_by_count":0,"area":"inference"},{"id":"2609.33652","title":"Tsubame: Tree Replay for Diffusion-Based Speculative Decoding","created":"2026-09-27","cited_by_count":0,"area":"inference"},{"id":"2610.00321","title":"CAST: Cost-Aware Speculative Trees from One-Pass Block Drafters","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2610.20175","title":"TreeSpark: Learning to Draft the Trees You Verify for Speculative Decoding","created":"2026-10-14","cited_by_count":0,"area":"inference"}],"next_cursor":null}