Q*: Improving Multi-step Reasoning for LLMs with Deliberative Planning
FreeImprove LLM multi-step reasoning with deliberative planning and no fine-tuning
About Q*: Improving Multi-step Reasoning for LLMs with Deliberative Planning
Q* is a general, versatile, and agile framework that improves multi-step reasoning in Large Language Models (LLMs) by casting the reasoning process as a heuristic search problem. It introduces a plug-and-play Q-value model that serves as a heuristic function to estimate expected future rewards, guiding the LLM's decoding process to select the most promising next reasoning step. Unlike fine-tuning approaches, Q* avoids significant computational overhead and the risk of performance degeneration on other tasks. The method is evaluated on mathematical reasoning benchmarks (GSM8K, MATH) and a code generation benchmark (MBPP), demonstrating consistent improvements in reasoning accuracy for open-source LLMs.
Key Features
Pros & Cons
- Plug-and-play approach requires no fine-tuning of the base LLM
- Avoids computational overhead and risk of catastrophic forgetting on other tasks
- General framework applicable to various multi-step reasoning tasks
- Demonstrated improvements across math and code benchmarks
- Compatible with open-source LLMs without modification
- Requires training a separate Q-value model, which may need additional data and computation
- Effectiveness may depend on the quality of the Q-value model and the search strategy used
- Not evaluated on a wide range of non-reasoning tasks; generality beyond math and code is unproven