- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
ReTree achieves an approximate tree inference decoding strategy with zero additional inference overhead by reusing the already-scored sibling nodes when the exact match fails (based on frequency and probability gating).
Critical strengths
Precise and under-explored problem formulation. Rigorous and honest cost decomposition.
Critical weaknesses
- The writing is extremely poor, with numerous traces of AI-generated content. Phrases like "A rather than B", "not establish". The defensive writing style are also quite prominent. The overall writing is very unclear, obscure and difficult to understand.
- The text has already pointed out multiple times that authors are not performing lossless decoding, but only tested the accuracy rate on some mathematical tasks. Since authors have already tested so many datasets in Table 1, why don't report the accuracy?
- There are insufficient comparison methods, such as DFlash2 and DSpark. Only tests were conducted on the Qwen3 series, lacking comparisons among different series of models.
- The text does not explain the inference backend. From the algorithm design principle, the modification of nodes in ReTree has a natural "compatibility conflict" with the standard static CUDA Graph.
- Similarly, under a large batch size, whether ReTree brings benefits is also questionable.
- The author directly hard-code default hyperparameters (λ and ρ) in all main experiments, budget scans (Budget Sweep), and component ablation (Path and Recovery ablation in Table 2) throughout the entire paper. No any ablation experiments were provided to explain why chosen this.
- According to the explanation in Appendix B.3, if the generated text by the model cannot be extracted with regular expressions (\boxed{}), this sample will be directly excluded from the denominator. This evaluation method is totally incorrect.
- Finally, even without the above issues, the improvement brought by this article is negligible. In Table 3, when allowing an increase of 10% and 15% in the accepted length, the speeds of other methods all exceeded ReTree.
Questions for authors
Please see weakness. Before being accepted as a formal conference paper, this article needs to undergo significant revisions in its writing, methodology design, and experimental results.