arXiv:2506.07642cs.CL2025-06EMNLP综述被引 34

用动态提问树提升大模型审稿深度与效率

TreeReview: A Dynamic Tree of Questions Framework for Deep and Efficient LLM-based Scientific Peer Review

  • 将审稿转化为递归分解问题的树状问答过程
  • 生成更深入评审,同时减少80%的模型调用耗能
  • 适合需要高效高质量审稿的科研人员使用

尽管大语言模型在辅助同行评审方面展现出巨大潜力,但现有方法往往难以兼顾评审的深度与效率。本文提出TreeReview框架,将论文评审建模为分层双向的问题-回答过程:先递归分解高层问题为细粒度子问题构建评审问题树,再从叶节点向根节点逐级聚合答案生成最终评审。关键创新在于动态问题扩展机制,可在必要时生成追问以深化探查。我们基于ICLR和NeurIPS会议数据构建了评测基准,涵盖完整评审生成与可操作反馈生成任务。实验表明,无论是大模型还是人工评估,TreeReview均优于强基线,在提供全面、深入且符合专家标准的评审意见的同时,相较计算密集型方法降低高达80%的令牌消耗。代码与数据集已开源。

原文摘要 · Abstract (English)

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.

大模型审稿效率优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。