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. |
Similar Papers
Semantic Exploration with Adaptive Gating for Efficient Problem Solving with Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for multi-step reasoning suffer from inefficiency and redundancy . existing methods neglect the diversity of task difficulties leading to extensive searches even for easy tasks . |
| Approach: | They propose a method that explores reasoning paths with a gating mechanism that decides whether to conduct a tree search based on the confidence level of answers from a previous simple reasoning method. |
| Outcome: | The proposed method significantly improves accuracy by 4.3% on average while requiring only 31% of computational costs. |
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. |
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. |
Exploring Graph Learning Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent studies focus on performance benchmarks without fully comparing LLMs to graph learning models. |
| Approach: | They evaluate off-the-shelf and instruction-tuned graph learning models across a variety of scenarios. |
| Outcome: | The proposed models outperform traditional graph learning models in few-shot settings, the authors show . their models out perform models with instruction tuning, and they show excellent generalization and robustness. |
A Reward-Guided Dual-Phase Framework for Adaptive Inference-Time Reasoning (2026.findings-acl)
Copied to clipboard
Yingqian Cui, Zhenwei Dai, Pengfei He, Bing He, Hui Liu, Zhan Shi, Xianfeng Tang, Jingying Zeng, Suhang Wang, Yue Xing, Jiliang Tang, Benoit Dumoulin
| Challenge: | Large Language Models (LLMs) have made strong progress in reasoning. |
| Approach: | They propose a dual-phase test-time scaling framework that separates planning and execution and performs search over each phase independently. |
| Outcome: | Experiments on math reasoning and code generation benchmarks show that the proposed approach improves accuracy while reducing redundant computation. |
ExpandR: Teaching Dense Retrievers Beyond Queries with LLM Guidance (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for enhancing dense retrieval with query augmentation ignore the alignment between generation and ranking objectives. |
| Approach: | They propose a unified LLM-augmented dense retrieval framework that jointly optimizes both the LLM and the retriever. |
| Outcome: | Experimental results show that ExpandR outperforms strong baselines, achieving more than 5% improvement in retrieval performance. |
Over-Searching in Search-Augmented Large Language Models (2026.eacl-long)
Copied to clipboard
| Challenge: | Search-augmented large language models (LLMs) excel at knowledge-intensive tasks by integrating external retrieval. |
| Approach: | They conduct a systematic evaluation of over-searching across multiple dimensions including query types, model categories, retrieval conditions, and multi-turn conversations. |
| Outcome: | The proposed model improves answer accuracy on answerable queries but harms abstention on unanswerable ones . |
Chain-in-Tree: Back to Sequential Reasoning in LLM Tree Search (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models excel at tasks such as mathematical and commonsense reasoning, but their performance improves further when additional test-time compute is allocated. |
| Approach: | They propose a plug-in framework that decides when to branch during search instead of expanding at every step. |
| Outcome: | The proposed framework reduces token generation, model calls, and runtime by 75-85% on GSM8K and Math500, with negligible or no accuracy loss. |
Do LLMs Really Need 10+ Thoughts for “Find the Time 1000 Days Later”? Towards Structural Understanding of LLM Overthinking (2026.acl-long)
Copied to clipboard
Xinliang Frederick Zhang, Anhad Mohananey, Alexandra Chronopoulou, Pinelopi Papalampidi, Somit Gupta, Tsendsuren Munkhdalai, Lu Wang, Shyam Upadhyay
| Challenge: | Existing studies on LLMs' thought processes are limited to superficial, profiling-based observations, failing to delve into their inner workings. |
| Approach: | They propose a utility-based definition of overthinking that moves beyond length-based metrics and provides a more insightful understanding of LLMs' thought progression. |
| Outcome: | The proposed model decomposes the LLM thought process into minimally complete sub-thoughts and identifies common thinking patterns for topically similar queries. |
From Implicit Exploration to Structured Reasoning: Guideline and Refinement for LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models rely on implicit exploration, which leads to unstable reasoning paths and lack of error correction. |
| Approach: | They propose a framework that shifts from implicit exploration to structured reasoning through guideline and refinement. |
| Outcome: | The proposed model outperforms strong baselines on the Big-Bench Hard benchmark. |