Pith. sign in

Recursive speculative decoding: Accelerating llm inference via sampling without replacement.arXiv preprint arXiv:2402.14160

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

fields

cs.CL 3 cs.LG 1

years

2026 4

verdicts

UNVERDICTED 4

representative citing papers

Cost-Aware Diffusion Draft Trees for Speculative Decoding

cs.CL · 2026-06-01 · unverdicted · novelty 7.0

CaDDTree jointly selects tree structure and budget to maximize expected tokens per unit time in speculative decoding, proving unimodality under convex verification cost and matching oracle DDTree performance on Qwen models.

citing papers explorer

Showing 4 of 4 citing papers.