Advancing Process Verification for Large Language Models via Tree-Based Preference Learning (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for generating step-by-step rationales fail to fully utilize the relative merits of intermediate steps, limiting the effectiveness of feedback provided. |
| Approach: | They propose a tree-based preference learning verifier that constructs reasoning trees via a best-first search algorithm and collects step-level paired data for preference training. |
| Outcome: | The proposed approach outperforms existing benchmarks on arithmetic and commonsense reasoning tasks. |
Similar Papers
Making Language Models Better Reasoners with Step-Aware Verifier (2023.acl-long)
Copied to clipboard
| Challenge: | Large language models have made impressive progress in few-shot learning but still face difficulties in reasoning tasks such as GSM8K. |
| Approach: | They propose a new approach that uses a verifier to filter out incorrect answers based on a weighted voting scheme to improve reasoning ability of language models. |
| Outcome: | The proposed approach improves GSM8K reasoning rate by 17.9% to 58.1%. |
LLM2: Let Large Language Models Harness System 2 Reasoning (2025.naacl-short)
Copied to clipboard
| Challenge: | Empirical results on mathematical reasoning benchmarks substantiate the efficacy of Large language models (LLMs). |
| Approach: | They propose a framework that combines an LLM with a process-based verifier to generate plausible candidates and provide timely process-driven feedback to distinguish desirable and undesirable outputs. |
| Outcome: | Empirical results show that LLM2 improves accuracy on GSM8K and self-consistency increases major@20 accuracy. |
Don’t Get Lost in the Trees: Streamlining LLM Reasoning by Overcoming Tree Search Exploration Pitfalls (2025.acl-long)
Copied to clipboard
Ante Wang, Linfeng Song, Ye Tian, Dian Yu, Haitao Mi, Xiangyu Duan, Zhaopeng Tu, Jinsong Su, Dong Yu
| Challenge: | Recent advances in tree search algorithms guided by verifiers have significantly enhanced the reasoning capabilities of large language models (LLMs), but at the cost of increased computational resources. |
| Approach: | They propose an e ffici ent tree sear ch framework that is a plug-and-play system compatible with various tree search algorithms. |
| Outcome: | The proposed framework reduces computational costs and prioritizes resource allocation to harder tasks (Levels 3-4) over simpler ones (Level 1-2), addressing both over-exploration in basic problems and under-exploation in complex cases. |
PORT: Preference Optimization on Reasoning Traces (2025.naacl-long)
Copied to clipboard
| Challenge: | Preference optimization methods have been successfully applied to improve the alignment of large language models with human values. |
| Approach: | They propose to use preference optimization methods to generate rejected answers using weak LLM prompting and digit corruption to improve the mathematical reasoning abilities of language models. |
| Outcome: | The proposed method leads to increased accuracy on the GSM8K and AQuA-RAT benchmarks without annotations. |
Ensembling Large Language Models with Process Reward-Guided Tree Search for Better Complex Reasoning (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing methods for ensembling language models fail to address complex reasoning tasks. |
| Approach: | They propose a framework for process-level ensembling of large language models using Monte Carlo tree search. |
| Outcome: | The proposed framework outperforms both language model decoding and language model ensemble methods on five reasoning benchmarks. |
LongDPO: Unlock Better Long-form Generation Abilities for LLMs via Critique-augmented Stepwise Information (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in large language models have improved their capacity to handle long text inputs, but current models still exhibit unsatisfactory performance in long-form generation. |
| Approach: | They propose a method to enhance long-form text generation through step-level supervision by leveraging Monte Carlo Tree Search to collect stepwise preference pairs and employ a global memory pool to maintain factual accuracy. |
| Outcome: | The proposed method improves performance on long-form generation benchmarks while maintaining lossless performance on several general benchmarks. |
Stepwise Verification and Remediation of Student Reasoning Errors with Large Language Model Tutors (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for dialog tutoring fail to detect student errors and tailor their feedback to them. |
| Approach: | They propose to build dialog tutoring models to scaffold students' problem-solving and verify student solutions by using automatic and human evaluation. |
| Outcome: | The proposed model improves the quality of the tutor response generation by detecting student errors and adjusting the feedback to the errors. |
Step-level Value Preference Optimization for Mathematical Reasoning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for generating preference-level annotations do not capture the fine-grained quality of model outputs in multi-step reasoning tasks. |
| Approach: | They propose an algorithm to automatically annotate step-level preferences for multi-step reasoning using Monte Carlo Tree Search. |
| Outcome: | The proposed algorithm achieves state-of-the-art performance on in-domain and out-of domain mathematical reasoning benchmarks. |
LM2: A Simple Society of Language Models Solves Complex Reasoning (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies show that providing guidance via decomposing the original question into multiple subproblems elicits more robustness in LLM reasoning. |
| Approach: | They propose a language-based decomposition, solution and verification framework that modularizes the decomposer, solution, and verification into three different language models. |
| Outcome: | The proposed model outperforms existing methods on in- and out-domain reasoning problems, outperforming the best baselines by 8.1% on MATH, 7.71% on JEEBench, and 9.7% on MedQA problems. |
Learning Planning-based Reasoning by Trajectories Collection and Process Reward Synthesizing (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have raised concerns regarding the hallucination and flaws in their reasoning process. |
| Approach: | They propose a framework to learn planning-based reasoning through Direct Preference Optimization on collected trajectories, which are ranked according to synthesized process rewards. |
| Outcome: | The proposed model surpasses GPT-3.5-Turbo on logical reasoning benchmarks on a set of logically-based reasoning tasks. |