{"total":32,"rows":[{"id":"2608.02438","title":"xPress: Parallel Refinement for Diffusion Drafters in Speculative Decoding","created":"2026-08-03","cited_by_count":8,"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":"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.19223","title":"AdaFlash: Adaptive Speculative Decoding via On-Policy Distilled Diffusion Drafters","created":"2026-07-21","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":"2608.20530","title":"LiLiCorr: Lightweight Likelihood Correlation of Parallel Drafts for Speculative Decoding","created":"2026-08-20","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":"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":"2608.29748","title":"ReTrace: Rejected-Trajectory Conditioning for Speculative Decoding","created":"2026-08-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":"2608.05448","title":"DBLAST: Dependent Block Drafting for Stochastic Speculative Decoding","created":"2026-08-05","cited_by_count":1,"area":"inference"},{"id":"2609.14717","title":"Carryover Drafting: Recycling Rejected States for Speculative Decoding","created":"2026-09-13","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":"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":"2608.14787","title":"From Positionwise Confidence to Prefix Scheduling: Verifier Skipping in Speculative Decoding","created":"2026-08-14","cited_by_count":0,"area":"inference"},{"id":"2608.20743","title":"Is Multimodal Speculative Decoding Ready for Diffusion-Based Parallel Drafting? A Survey and Empirical Diagnosis","created":"2026-08-21","cited_by_count":0,"area":"inference"},{"id":"2609.24698","title":"Adapting Tree-Structured Speculative Decoding to DeepSeek-V4 for Efficient Inference","created":"2026-09-21","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":"2609.34388","title":"Reciprocal Guidance: Orchestrating Draft and Verify Budgets for Advancing the Diffusion-AR Self-Speculation Frontier","created":"2026-09-28","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.37532","title":"DScale: Scaling Block-Diffusion Speculative Decoding with Adaptive Verification","created":"2026-09-29","cited_by_count":0,"area":"inference"},{"id":"2609.38510","title":"DEdit: Iterative Draft Editing for Speculative Decoding","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.01439","title":"DRelay: Global Draft Context for Prefix-Aware Parallel Speculative Decoding Repair","created":"2026-10-01","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.07822","title":"Nucleus Speculative Decoding: Plausibility-Aware Verification Beyond Exact Distribution","created":"2026-10-06","cited_by_count":0,"area":"inference"},{"id":"2610.10411","title":"Training Parallel Speculative Draft Models by Directly Minimizing Expected Decoding Rounds","created":"2026-10-07","cited_by_count":0,"area":"inference"},{"id":"2610.12570","title":"Contextual Correction of Parallel Draftsfor Speculative Decoding","created":"2026-10-08","cited_by_count":0,"area":"inference"},{"id":"2610.13708","title":"Adaptive DHiSparse: Speculative Decoding over a Load-Adaptive KV Hierarchy","created":"2026-10-09","cited_by_count":0,"area":"inference"},{"id":"2610.19792","title":"JetSpec++: Foresight Parallel Drafting with Self Refinements","created":"2026-10-14","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"},{"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"}],"next_cursor":null}