Saved in:
Bibliographic Details
Main Authors: Chang, Yuan, Li, Ziyue, Zhang, Hengyuan, Kong, Yuanbo, Wu, Yanru, So, Hayden Kwok-Hay, Guo, Zhijiang, Zhu, Liya, Wong, Ngai
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2506.07642
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916941583613952
author Chang, Yuan
Li, Ziyue
Zhang, Hengyuan
Kong, Yuanbo
Wu, Yanru
So, Hayden Kwok-Hay
Guo, Zhijiang
Zhu, Liya
Wong, Ngai
author_facet Chang, Yuan
Li, Ziyue
Zhang, Hengyuan
Kong, Yuanbo
Wu, Yanru
So, Hayden Kwok-Hay
Guo, Zhijiang
Zhu, Liya
Wong, Ngai
contents While Large Language Models (LLMs) have shown significant potential in assisting peer review, current methods often struggle to generate thorough and insightful reviews while maintaining efficiency. In this paper, we propose TreeReview, a novel framework that models paper review as a hierarchical and bidirectional question-answering process. TreeReview first constructs a tree of review questions by recursively decomposing high-level questions into fine-grained sub-questions and then resolves the question tree by iteratively aggregating answers from leaf to root to get the final review. Crucially, we incorporate a dynamic question expansion mechanism to enable deeper probing by generating follow-up questions when needed. We construct a benchmark derived from ICLR and NeurIPS venues to evaluate our method on full review generation and actionable feedback comments generation tasks. Experimental results of both LLM-based and human evaluation show that TreeReview outperforms strong baselines in providing comprehensive, in-depth, and expert-aligned review feedback, while reducing LLM token usage by up to 80% compared to computationally intensive approaches. Our code and benchmark dataset are available at https://github.com/YuanChang98/tree-review.
format Preprint
id arxiv_https___arxiv_org_abs_2506_07642
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle TreeReview: A Dynamic Tree of Questions Framework for Deep and Efficient LLM-based Scientific Peer Review
Chang, Yuan
Li, Ziyue
Zhang, Hengyuan
Kong, Yuanbo
Wu, Yanru
So, Hayden Kwok-Hay
Guo, Zhijiang
Zhu, Liya
Wong, Ngai
Computation and Language
While Large Language Models (LLMs) have shown significant potential in assisting peer review, current methods often struggle to generate thorough and insightful reviews while maintaining efficiency. In this paper, we propose TreeReview, a novel framework that models paper review as a hierarchical and bidirectional question-answering process. TreeReview first constructs a tree of review questions by recursively decomposing high-level questions into fine-grained sub-questions and then resolves the question tree by iteratively aggregating answers from leaf to root to get the final review. Crucially, we incorporate a dynamic question expansion mechanism to enable deeper probing by generating follow-up questions when needed. We construct a benchmark derived from ICLR and NeurIPS venues to evaluate our method on full review generation and actionable feedback comments generation tasks. Experimental results of both LLM-based and human evaluation show that TreeReview outperforms strong baselines in providing comprehensive, in-depth, and expert-aligned review feedback, while reducing LLM token usage by up to 80% compared to computationally intensive approaches. Our code and benchmark dataset are available at https://github.com/YuanChang98/tree-review.
title TreeReview: A Dynamic Tree of Questions Framework for Deep and Efficient LLM-based Scientific Peer Review
topic Computation and Language
url https://arxiv.org/abs/2506.07642