- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
TreeSpark studies conditional draft-tree allocation using DSpark, separating acceptance prediction, branch selection, and executed work. It preserves a primary chain and adds optional leaves using existing confidence scores, with batch-dependent thresholds controlling admission.
Critical strengths
- Careful comparisons against independently tuned static trees and constant-threshold controls, with paired confidence intervals.
- Useful accounting of retained nodes, prepared parent distributions, and executed work.
- Transparent reporting of negative results and limitations.
Critical weaknesses
1.Limited methodological novelty. The conditional drafter, tree topology, confidence head, and recursive rejection mechanism build on existing work. The additional policy primarily combines a heuristic confidence score with a two-bin threshold rule. The paper does not sufficiently establish a substantial algorithmic advance beyond these components.
-
No consistent incremental benefit over simpler controls. Although confidence-guided trees improve throughput over chain decoding, their gains relative to the optimized static tree are −1.38% and +0.63% in the primary sampling comparisons, with both confidence intervals containing zero. Fixed-rate serving likewise does not establish an advantage over the constant high-bin threshold. The results therefore support efficient tree construction more strongly than the proposed adaptive allocation mechanisms.
-
Limited generality of the diagnostic contribution. The study offers useful negative findings, but the evidence centers on one GPU platform and the DSpark architecture. Moreover, the load controller spends approximately 98–100% of measured request-rounds in its high-batch bin, limiting what these experiments establish about adaptation across changing operating conditions. The paper provides limited guidance on when adaptive selection should outperform a well-tuned static policy.
Questions for authors
1.What is the principal transferable insight beyond the established need to balance acceptance gains against execution costs? 2.Do any evaluated conditions demonstrate a reproducible advantage over both the strongest static tree and constant-threshold controls?
Thanks for the response. I still believe the submission is below the bar for ICLR. It would be great if the authors could incorporate the explanation and add the discussion/experiments on the existing methods to the review.