Pith. sign in

REVIEW 11 cited by

Q*: Improving Multi-step Reasoning for LLMs with Deliberative Planning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.14283 v4 pith:NAUDZCYG submitted 2024-06-20 cs.AI

classification cs.AI
keywords llmsreasoningmulti-stepdeliberativeheuristicimprovinglanguageperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large Language Models (LLMs) have demonstrated impressive capability in many natural language tasks. However, the auto-regressive generation process makes LLMs prone to produce errors, hallucinations and inconsistent statements when performing multi-step reasoning. In this paper, by casting multi-step reasoning of LLMs as a heuristic search problem, we aim to alleviate the pathology by introducing Q*, a general, versatile and agile framework for guiding LLMs decoding process with deliberative planning. By learning a plug-and-play Q-value model as heuristic function for estimating expected future rewards, our Q* can effectively guide LLMs to select the most promising next reasoning step without fine-tuning LLMs for the current task, which avoids the significant computational overhead and potential risk of performance degeneration on other tasks. Extensive experiments on GSM8K, MATH and MBPP demonstrate the superiority of our method, contributing to improving the reasoning performance of existing open-source LLMs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Reasoning LLMs are Wandering Solution Explorers

    cs.CL 2025-05 conditional novelty 6.0 of 10

    Six current reasoning LLMs, including commercial systems, exhibit structured-search failures on verifiable computation tasks and degrade as the solution space grows.

  2. Self-Critique Guided Iterative Reasoning for Multi-hop Question Answering

    cs.CL 2025-05 conditional novelty 6.0 of 10

    SiGIR trains a language model to decompose multi-hop questions, self-critique each retrieval and reasoning step, and use cumulative self-rewards in a beam search, beating prior methods by up to 14.4 F1 points on MuSiQue.

  3. Engineering Trustworthy Agentic AI for Critical Systems

    cs.AI 2026-07 conditional novelty 5.0 of 10

    A survey claiming that agentic AI trustworthiness is a single cross-domain problem and outlining a framework for graded, certifiable assurance.

  4. DeepResearch-9K: A Challenging Benchmark Dataset of Deep-Research Agent

    cs.AI 2026-03 conditional novelty 5.0 of 10

    A synthetic benchmark of 9,000 multi-hop web-research questions with difficulty tiers and teacher-generated search trajectories, plus an open-source RL training framework that reportedly lets 3B-parameter agents beat ...

  5. Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs

    cs.CL 2025-08 unverdicted novelty 5.0 of 10

    The abstract claims a new local search framework for code generation, but the manuscript body is a different mathematics paper.

  6. FreePRM: Training Process Reward Models Without Ground Truth Process Labels

    cs.CL 2025-06 conditional novelty 5.0 of 10

    A weakly supervised PRM training method using outcome-only pseudo-labels plus a buffer probability reaches 53.0% F1 on ProcessBench, beating supervised baselines in the paper's comparisons.

  7. One Missing Piece for Open-Source Reasoning Models: A Dataset to Mitigate Cold-Starting Short CoT LLMs in RL

    cs.CL 2025-06 conditional novelty 5.0 of 10

    A pipeline converts short-CoT LLM outputs into o1-style long chain-of-thought rationales using 1K seed reasoning flows, and SFT on the resulting dataset improves downstream RLVR cold-start.

  8. On the Emergence of Thinking in LLMs I: Searching for the Right Intuition

    cs.AI 2025-02 conditional novelty 5.0 of 10

    A post-training framework called RLSP, decoupling exploration from correctness rewards, induces backtracking and self-correction in LLMs and improves math reasoning performance.

  9. Holistically Guided Monte Carlo Tree Search for Intricate Information Seeking

    cs.IR 2025-02 reject novelty 5.0 of 10

    HG-MCTS guides Monte Carlo tree search with an adaptive checklist and self-generated rewards to improve multi-hop information seeking, claiming better benchmark accuracy.

  10. Bag of Tricks for Inference-time Computation of LLM Reasoning

    cs.AI 2025-02 conditional novelty 4.0 of 10

    An empirical study showing that inference-time LLM reasoning methods are highly sensitive to sampling hyperparameters and reward-model choices, with recommended defaults of temperature 0.8 and top-p 0.9.

  11. Large Language Models for Planning: A Comprehensive and Systematic Survey

    cs.AI 2025-05 conditional novelty 3.0 of 10

    A structured survey of LLM planning methods, benchmarks, and interpretability work, organized around a three-way taxonomy.

Pith tools