BPP-Search: Enhancing Tree of Thought Reasoning for Mathematical Modeling Problem Solving (2025.acl-long)
Copied to clipboard
Teng Wang, Wing Yin Yu, Zhenqi He, Zehua Liu, HaileiGong HaileiGong, Han Wu, Xiongwei Han, Wei Shi, Ruifeng She, Fangzhou Zhu, Tao Zhong
| Challenge: | Existing datasets in operations research domain lack detailed annotations of the modeling process, focusing only on objective values. |
| Approach: | They propose an annotation-based tree-of-thought tree-based reasoning algorithm that integrates reinforcement learning into a tree- of-though. |
| Outcome: | The proposed algorithm outperforms state-of-the-art methods on StructuredOR, NL4OPT, and MAMO-ComplexLP datasets. |
Similar Papers
Graph Reasoning Paradigm: Structured and Symbolic Reasoning with Topology-Aware Reinforcement Learning for Large Language Models (2026.acl-long)
Copied to clipboard
Runxuan Liu, Xianhao Ou, Xinyan Ma, Jiyuan Wang, Jiafeng Liang, Jiaqi Li, Tao He, Zheng Chu, Rongchuan Mu, Zekun Wang, Baoxin Wang, Dayong Wu, Ming Liu, Shijin Wang, Guoping Hu, Bing Qin
| Challenge: | Existing methods for long chain-of-thought (LCoT) are coarse-grained, reward hacking, and poor generalization. |
| Approach: | They propose a Long Chain-of-Thought (LCoT) model that integrates reinforcement learning with verifiable rewards with a process-aware verification approach. |
| Outcome: | The proposed model improves reasoning and code generation tasks while reducing the cost of training and performance bottlenecks. |
ThoughtProbe: Classifier-Guided LLM Thought Space Exploration via Probing Representations (2025.emnlp-main)
Copied to clipboard
| Challenge: | Unlike previous works that manipulate representations to steer LLM generation, ThoughtProbe harnesses them as discriminative signals to guide the tree-structured response space exploration. |
| Approach: | They propose a tree-structured inference-time framework that leverages the hidden reasoning features of Large Language Models to improve their reasoning performance. |
| Outcome: | The proposed framework improves reasoning performance across multiple arithmetic reasoning benchmarks and covers valid reasoning chains and identifies optimal answers. |
R-Search: Empowering LLM Reasoning with Search via Multi-Reward Reinforcement Learning (2026.findings-acl)
Copied to clipboard
Qingfei Zhao, Ruobing Wang, Dingling Xu, Daren Zha, Ma Bowen, Zhichun Wang, Shijie Jia, Limin Liu, Xin Wang
| Challenge: | Large language models (LLMs) have demonstrated impressive capabilities in multi-step and long-chain reasoning, but extending their reasoning capabilities to encompass deep interactions with search remains a non-trivial challenge. |
| Approach: | They propose a framework for Reasoning–Search integration that integrates multi-reward signals to optimize the reasoning–search interaction trajectories. |
| Outcome: | Experiments on seven datasets show that R-Search significantly outperforms mainstream RAG baselines. |
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. |
Reason in Chains, Learn in Trees: Self-Rectification and Grafting for Multi-turn Agent Policy Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to reinforcement learning for Large Language Models treat trajectories as independent chains and ignore critical steps that may disproportionally impact reasoning outcome. |
| Approach: | They propose a framework that recovers latent correlated reward structure across seemingly independent trajectories by identifying and merging functionally similar steps/nodes. |
| Outcome: | The proposed framework recovers latent correlated reward structure across seemingly independent trajectories. |
Towards Hierarchical Multi-Step Reward Models for Enhanced Reasoning in Large Language Models (2026.findings-acl)
Copied to clipboard
Teng Wang, Jiang Zhangyi, Zhenqi He, Hailei Gong, Shenyang Tong, Wenhan Yang, Zeyu Li, Yanan Zheng, Zifan He, Zewen Ye, Shengjie Ma, Jianping Zhang
| Challenge: | Existing Process Reward Models (PRMs) are vulnerable to reward hacking and require expensive, large-scale annotation of reasoning steps. |
| Approach: | They propose a reward model approach which evaluates both individual and consecutive reasoning steps from fine-grained and coarse-grounded level. |
| Outcome: | Empirical results show that the proposed model performs better than existing PRMs and is more robust than existing models. |
LLaMA-Berry: Pairwise Optimization for Olympiad-level Mathematical Reasoning via O1-like Monte Carlo Tree Search (2025.naacl-long)
Copied to clipboard
Di Zhang, Jianbo Wu, Jingdi Lei, Tong Che, Jiatong Li, Tong Xie, Xiaoshui Huang, Shufei Zhang, Marco Pavone, Yuqiang Li, Wanli Ouyang, Dongzhan Zhou
| Challenge: | LLaMA-Berry is an advanced mathematical reasoning framework to enhance the problem-solving ability of large language models (LLMs). |
| Approach: | They propose a Monte Carlo Tree Search and Self-Refine framework to optimize reasoning paths and a pairwise reward model to evaluate different paths globally. |
| Outcome: | The proposed framework overcomes inefficiencies and limitations of step-wise and greedy search algorithms, enabling more efficient exploration of solution spaces. |
TCPO: Thought-Centric Preference Optimization for Effective Embodied Decision-making (2025.emnlp-main)
Copied to clipboard
Kechen Jiao, Zhirui Fang, Jiahao Liu, Bei Li, Qifan Wang, Xinyu Liu, Junhao Ruan, Zhongjian Qiao, Yifan Zhu, Yaxin Xu, Jingang Wang, Xiu Li
| Challenge: | Existing post-SFT methods for embodied AI are constrained by sparse rewards and action-only optimization, resulting in low sample efficiency, poor consistency, and model degradation. |
| Approach: | They propose to integrate Thought-Centric Preference Optimization (TCPO) into embodied decision-making by transforming sparse reward signals into richer step sample pairs. |
| Outcome: | The proposed approach achieves an average success rate of 26.67% in the ALFWorld environment, and a 6% improvement over RL4VLM. |
A Comprehensive Survey of Process Reward Models: Data Generation, Model Construction, and Usage (2026.acl-long)
Copied to clipboard
Congmin Zheng, Jiachen Zhu, Zhuoying Ou, Yuxiang Chen, Kangning Zhang, Rong Shan, Zeyu Zheng, Mengyue Yang, Jianghao Lin, Yong Yu, Weinan Zhang
| Challenge: | Large Language Models (LLMs) have advanced reasoning ability, yet conventional alignment remains dominated by outcome reward models that judge only final answers. |
| Approach: | They summarize applications across math, code, text, multimodal reasoning, robotics, and agents . goal is to clarify design spaces, reveal open challenges, and guide future research toward fine-grained, robust reasoning alignment. |
| Outcome: | The proposed model enables finer credit assignment, richer diagnostics, and improved robustness. |
Reinforced Efficient Reasoning via Semantically Diverse Exploration (2026.acl-long)
Copied to clipboard
Ziqi Zhao, Zhaochun Ren, Jiahong Zou, Liu Yang, Zhiwei Xu, Xuri Ge, Zhumin Chen, Xinyu Ma, Daiting Shi, Shuaiqiang Wang, Dawei Yin, Xin Xin
| Challenge: | Existing methods for reinforcement learning with verifiable rewards suffer from limited exploration diversity and inefficient reasoning. |
| Approach: | They propose a method that rewards concise and correct reasoning while penalizing unnecessarily long reasoning chains. |
| Outcome: | Extensive experiments on Qwen and Llama models validate the effectiveness and efficiency of ROSE. |