{"total":23,"rows":[{"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":"2505.15141","title":"BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms","created":"2025-05-21","cited_by_count":20,"area":"inference"},{"id":"2602.23881","title":"LK Losses: Direct Acceptance Rate Optimization for Speculative Decoding","created":"2026-02-27","cited_by_count":18,"area":"inference"},{"id":"2411.18462","title":"Draft Model Knows When to Stop: Self-Verification Speculative Decoding for Long-Form Generation","created":"2024-11-27","cited_by_count":16,"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":"2511.09844","title":"Steering Pretrained Drafters during Speculative Decoding","created":"2025-11-13","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":"2604.07622","title":"DIVERSED: Relaxed Speculative Decoding via Dynamic Ensemble Verification","created":"2026-04-08","cited_by_count":4,"area":"inference"},{"id":"2607.08690","title":"A Practical Investigation of Training-free Relaxed Speculative Decoding","created":"2026-07-09","cited_by_count":3,"area":"inference"},{"id":"2505.07680","title":"SpecRouter: Adaptive Routing for Multi-Level Speculative Decoding in Large Language Models","created":"2025-05-12","cited_by_count":2,"area":"inference"},{"id":"2606.13426","title":"Accelerating Speculative Diffusions via Block Verification","created":"2026-06-11","cited_by_count":2,"area":"inference"},{"id":"2506.01986","title":"SpecMemo: Speculative Decoding is in Your Pocket","created":"2025-05-16","cited_by_count":1,"area":"inference"},{"id":"2510.09942","title":"Conformal Sparsification for Bandwidth-Efficient Edge-Cloud Speculative Decoding","created":"2025-10-11","cited_by_count":1,"area":"inference"},{"id":"2510.26527","title":"Polybasic Speculative Decoding Through a Theoretical Perspective","created":"2025-10-30","cited_by_count":1,"area":"inference"},{"id":"2601.09212","title":"Annealed Relaxation of Speculative Decoding for Faster Autoregressive Image Generation","created":"2026-01-14","cited_by_count":1,"area":"inference"},{"id":"2602.01428","title":"Improving the Trade-off Between Watermark Strength and Speculative Sampling Efficiency for Language Models","created":"2026-02-01","cited_by_count":1,"area":"inference"},{"id":"2606.30265","title":"When Is a Draft Accepted? A Theory of Acceptance in Speculative Decoding","created":"2026-06-29","cited_by_count":1,"area":"inference"},{"id":"2608.24411","title":"ResiSpec: Enhancing Multi-Candidate Speculative Sampling via Residual Distribution Shaping","created":"2026-08-25","cited_by_count":1,"area":"inference"},{"id":"2512.11718","title":"Speculative Decoding Speed-of-Light: Optimal Lower Bounds via Branching Random Walks","created":"2025-12-12","cited_by_count":0,"area":"inference"},{"id":"2606.27829","title":"CSD: Content-aware Speculative Decoding for Efficient Image Generation","created":"2026-06-26","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":"2609.26796","title":"Flash-dLLM: IO-Aware KV Caching and Parallel Decoding for Fast, Memory-Efficient Diffusion LLMs","created":"2026-09-22","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"}],"next_cursor":null}