{"total":18,"rows":[{"id":"2603.03251","title":"Speculative Speculative Decoding","created":"2026-03-03","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":"2604.09557","title":"SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding","created":"2026-02-10","cited_by_count":10,"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":"2604.26412","title":"When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?","created":"2026-04-29","cited_by_count":5,"area":"inference"},{"id":"2605.09992","title":"Attention Drift: What Autoregressive Speculative Decoding Models Learn","created":"2026-05-11","cited_by_count":4,"area":"inference"},{"id":"2605.09329","title":"Test-Time Speculation","created":"2026-05-10","cited_by_count":3,"area":"inference"},{"id":"2506.01986","title":"SpecMemo: Speculative Decoding is in Your Pocket","created":"2025-05-16","cited_by_count":1,"area":"inference"},{"id":"2606.24957","title":"Dustin: Draft-Augmented Sparse Verification for Efficient Long-Context Generation with Speculative Decoding","created":"2026-06-23","cited_by_count":0,"area":"inference"},{"id":"2607.21535","title":"Windowed-MTP: Removing the Full-Context Draft-KV Tax at Million-Token Context","created":"2026-07-23","cited_by_count":0,"area":"inference"},{"id":"2607.24260","title":"KAP: Bridging the Knowledge Selection-Runtime Consumption Gap in LLM Systems","created":"2026-07-27","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":"2608.30252","title":"Strong Drafts Need Compact Memories: Long-Context Speculative Decoding with Compressed KV Cache","created":"2026-08-31","cited_by_count":0,"area":"inference"},{"id":"2609.37029","title":"LongSpark: Efficient speculative decoding with a fixed-cost parallel drafter","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2609.39972","title":"UBTree: Parallel Tree Drafting via Unigram and Bigram Models for Speculative Decoding","created":"2026-09-30","cited_by_count":0,"area":"inference"},{"id":"2610.05106","title":"SharpDraft: Accelerating Long-Context Speculative Decoding with Cardinality-Aware Query Scaling","created":"2026-10-04","cited_by_count":0,"area":"inference"},{"id":"2610.20392","title":"FOLD: Position-Free Far Memory with Local Order for Long-Context Speculative Decoding","created":"2026-10-14","cited_by_count":0,"area":"inference"},{"id":"2610.20503","title":"ReaDy: Recurrent States as Dynamic Context for Speculative Drafting in Hybrid Linear Attention Large Language Models","created":"2026-10-14","cited_by_count":0,"area":"inference"}],"next_cursor":null}