- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
PRESTO constructs draft trees from the parallel position-wise predictions of diffusion drafters. It combines diffusion marginal probabilities with a prefix-dependent compatibility signal, implemented using an n-gram model built from target-model-generated text, and uses additive path scores to guide priority-based tree search. The framework supports both dedicated diffusion drafters and self-speculative diffusion models. Experiments report improvements over single-path drafting, comparisons with DDTree, and ablations of the scoring signal, search parameters, and n-gram order.
Critical strengths
- Practically useful integration into self-speculative diffusion decoding.
Extending tree drafting to a pipeline that jointly verifies previous drafts and generates subsequent candidates is a valuable systems contribution. The treatment of branch-specific attention, accepted-path state, and reusable speculative outputs provides a concrete way to exploit multiple candidates without additional full-model forward passes for tree construction.
- The evaluation provides evidence beyond single-path comparisons.
Appendix K reports improvements over DDTree across two models and three node budgets, with acceptance-length gains of 0.29–0.35 and throughput ratios of 1.04–1.10×. Appendix J further investigates n-gram order, memory footprint, and an alternative neural prefix scorer. These results support the usefulness of an inexpensive prefix signal for improving draft-tree quality.
Critical weaknesses
- The distinct contribution over existing prefix-aware and causally conditioned tree construction remains insufficiently isolated.
DART already combines parallel draft probabilities with n-gram conditional scores and uses beam expansion with global node retention. PRESTO makes meaningful distinctions through target-generated counts and its self-speculation integration. However, the experiments do not compare the scoring rules under a matched drafter, candidate set, search procedure, and tuning budget, or directly isolate the benefit of target-generated counts over ordinary corpus counts.
Related methods such as DominoTree and DARTree also explore causal correction along individual branches. The Qwen3-0.6B comparison in Appendix J is useful, but a general-purpose small LM used as a scorer does not fully represent a specialized lightweight causal-correction head. The current evidence therefore more clearly establishes that prefix information helps than it establishes PRESTO’s quality–cost advantage over alternative prefix models. Concurrent methods can be addressed through technical discussion or targeted experiments without requiring reproduction of every baseline.
- The independent contribution of tree construction and pruning, and the advantage under cost-aware budgets, remain unclear.
Global reranking and retention after expansion have established precedents, including EAGLE-2. PRESTO includes beam-versus-best-first comparisons and search-parameter ablations, but should more clearly separate improvements attributable to prefix scoring, candidate coverage, and the expansion/pruning policy itself. In particular, the numbers of scored candidates, nodes retained for further expansion, and nodes passed to verification should be distinguished.
Moreover, CaDDTree already jointly considers acceptance gains and verification costs to select diffusion-tree budgets per round. PRESTO’s throughput-based selection among fixed budgets and its latency breakdown are valuable, but do not fully establish whether its advantage persists under matched time budgets or adaptive budget selection. Evaluation with a default batch size of one on B200 GPUs also limits conclusions about other workloads and hardware conditions.
Questions for authors
-
Causally conditioned scoring: How does PRESTO compare with lightweight branch-state-based causal correction in acceptance length, tree-construction latency, and memory usage? If a direct comparison is infeasible, please clarify the applicability and key design differences.
-
Pruning and cost-aware budgets: With scoring and verification budget fixed, how much improvement comes from expansion, candidate retention, and pruning? Can the authors provide a cost-aware DDTree baseline, or acceptance–latency curves across node budgets and context lengths?