{"total":20,"rows":[{"id":"2505.15141","title":"BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms","created":"2025-05-21","cited_by_count":20,"area":"inference"},{"id":"2606.18394","title":"JetSpec: Breaking the Scaling Ceiling of Speculative Decoding with Parallel Tree Drafting","created":"2026-06-16","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":"2502.08923","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","created":"2025-02-13","cited_by_count":6,"area":"inference"},{"id":"2502.15572","title":"DReSD: Dense Retrieval for Speculative Decoding","created":"2025-02-21","cited_by_count":6,"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":"2511.16193","title":"Fast LLM Post-training via Decoupled and Fastest-of-N Speculation","created":"2025-11-20","cited_by_count":4,"area":"inference"},{"id":"2511.21699","title":"Cacheback: Speculative Decoding With Nothing But Cache","created":"2025-11-15","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":"2601.04766","title":"JuDi: Revisiting Judge Decoding from First Principles via Training-Free Distributional Divergence","created":"2026-01-08","cited_by_count":2,"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":"2606.05742","title":"AdaPLD: Adaptive Retrieval and Reuse for Efficient Model-Free Speculative Decoding","created":"2026-06-04","cited_by_count":1,"area":"inference"},{"id":"2609.20186","title":"To Copy or Not to Copy: Controlling Speculative Decoding via Intrinsic Model Signals","created":"2026-09-17","cited_by_count":1,"area":"inference"},{"id":"2608.03839","title":"Oilbird: Training-Free Speculative Decoding with Keys the Verifier Already Computes","created":"2026-08-04","cited_by_count":0,"area":"inference"},{"id":"2609.17241","title":"ECHO: Early-layer Collaborative Hierarchical Orchestration with Bonus Logits in Speculative Decoding","created":"2026-09-15","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.26100","title":"TSS: Target-Side Sparsification for Speculative Decoding in Domain-Specific Large Language Models","created":"2026-08-15","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"},{"id":"2610.19792","title":"JetSpec++: Foresight Parallel Drafting with Self Refinements","created":"2026-10-14","cited_by_count":0,"area":"inference"}],"next_cursor":null}