{"total":20,"rows":[{"id":"2405.19715","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","created":"2024-05-30","cited_by_count":75,"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":"2502.05202","title":"Accelerating LLM Inference with Lossless Speculative Decoding Algorithms for Heterogeneous Vocabularies","created":"2025-01-31","cited_by_count":20,"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":"2502.04557","title":"Speeding up Speculative Decoding via Sequential Approximate Verification","created":"2025-02-06","cited_by_count":11,"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":"2605.20104","title":"Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decoding","created":"2026-05-19","cited_by_count":6,"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":"2604.07622","title":"DIVERSED: Relaxed Speculative Decoding via Dynamic Ensemble Verification","created":"2026-04-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":"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":"2602.01274","title":"PACER: Blockwise Pre-verification for Speculative Decoding with Adaptive Length","created":"2026-02-01","cited_by_count":2,"area":"inference"},{"id":"2604.09731","title":"SMART: When is it Actually Worth Expanding a Speculative Tree?","created":"2026-04-09","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":"2505.08600","title":"Automatic Task Detection and Heterogeneous LLM Speculative Decoding","created":"2025-05-13","cited_by_count":0,"area":"inference"},{"id":"2605.14978","title":"Performance-Driven Policy Optimization for Speculative Decoding with Adaptive Windowing","created":"2026-05-14","cited_by_count":0,"area":"inference"},{"id":"2605.15051","title":"An Interpretable Latency Model for Speculative Decoding in LLM Serving","created":"2026-05-14","cited_by_count":0,"area":"inference"},{"id":"2608.08721","title":"LibraSpec: Dynamic Diffusion-Based Speculative Decoding via Marginal-Gain-Driven Optimization","created":"2026-08-09","cited_by_count":0,"area":"inference"},{"id":"2610.07659","title":"DLoop: Looped Speculative Decoding","created":"2026-10-06","cited_by_count":0,"area":"inference"},{"id":"2610.07780","title":"APEX: Speculate smarter, not deeper","created":"2026-10-06","cited_by_count":0,"area":"inference"}],"next_cursor":null}