- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
PCTree converts DSpark’s chain drafts into budgeted trees by applying its pretrained Markov head to multiple parents. It requires no additional training or backbone passes and improves acceptance length and end-to-end speed over matched DSpark baselines.
Critical strengths
- A practical inference-only modification with consistent improvements across three model sizes and nine benchmarks.
- The Shared-Markov control demonstrates that parent-specific conditioning improves acceptance beyond branching alone.
- The paper reports actual latency gains and acknowledges tree-construction overhead.
Critical weaknesses
-
Limited methodological novelty. Parent conditioning is already provided by DSpark, while path-probability scoring, frontier pruning, and budgeted tree selection follow established dynamic-tree methods, particularly EAGLE-2. DDTree also establishes tree construction from parallel draft distributions. The main contribution therefore appears to be a straightforward adaptation of existing tree-search techniques to DSpark’s conditional head. The paper does not sufficiently establish a nontrivial algorithmic advance beyond this combination.
-
The distinct contribution is not fully validated in wall-clock terms. Table 4 shows higher acceptance than the Shared-Markov tree but does not report their relative latency. Consequently, the end-to-end benefit specifically attributable to parent conditioning, beyond ordinary branching, remains unclear.
Questions for authors
- What technical obstacle requires a novel solution beyond applying established dynamic-tree construction to DSpark?
- Do existing timing measurements show a net speed advantage over the Shared-Markov tree?
We thank the reviewer for precisely identifying the novelty boundary. We agree that PCTree is a direct adaptation of established dynamic-tree construction to DSpark, rather than a new dynamic-tree algorithm. In particular, frontier expansion, joint path scoring, pruning, and budgeted prefix-closed selection follow prior dynamic-tree methods such as EAGLE-2. We will revise the paper to make this relationship explicit and substantially narrow the novelty claim.
Our contribution is practical and empirical: DSpark’s pretrained Markov head can be reused, without an additional backbone pass or retraining for tree expansion, to score branches conditioned on their parent tokens. The controlled Shared-Markov comparison shows that this simple conversion yields a measurable end-to-end gain beyond ordinary tree branching. We do not claim a fundamentally new tree-search algorithm.
We added the requested wall-clock comparison. For the B=16 study, DSpark chain, Shared-Markov, and PCTree all use our own target-matched DSpark B=16 checkpoint, trained on the same training dataset as the corresponding DSpark setting; only the decoding/tree-construction policy differs. The target is Qwen3-4B; evaluation uses GSM8K, BF16, greedy decoding, k=4, and N=32.
Controlled effect of parent-conditioned scoring. Under the same DSpark checkpoint, target, verifier, tree budget, and implementation, Shared-Markov and PCTree differ only in whether each tree parent is rescored by DSpark’s Markov head. Parent-conditioned scoring improves acceptance from 10.224 to 11.070, reduces rounds/sample from 25.270 to 23.370, and increases throughput from 330.73 to 358.39 tok/s (+8.4%). The target-verification and total per-round latencies remain essentially unchanged. This result does not claim a new tree-search algorithm; it validates the practical benefit of applying DSpark’s existing parent-conditioned scores to tree branches.
The result is consistent at B=7, where all controls use the same official
dspark_qwen3_4b_block7checkpoint: Shared-Markov versus PCTree improves acceptance from 6.800 to 7.247, reduces rounds/sample from 37.520 to 35.250, and improves throughput from 230.40 to 245.97 tok/s (+6.8%).