Adaptive-Solver Framework for Dynamic Strategy Selection in Large Language Model Reasoning
Jianpeng Zhou, Wanjun Zhong, Yanlin Wang, Jiahai Wang

TL;DR
The paper introduces an Adaptive-Solver framework that dynamically adjusts problem-solving strategies in large language models, reducing computational costs and enhancing accuracy by tailoring approaches based on problem complexity.
Contribution
It presents a novel adaptive framework for LLM reasoning that intelligently switches strategies at test time, unlike traditional fixed-method approaches.
Findings
Reduces API costs by up to 85%.
Achieves up to 4.5% higher accuracy at the same cost.
Effectively adapts to various problem complexities.
Abstract
Large Language Models (LLMs) demonstrate impressive ability in handling reasoning tasks. However, unlike humans who can instinctively adapt their problem-solving strategies to the complexity of task, most LLM-based methods adopt a one-size-fits-all approach. These methods employ consistent models, sample sizes, prompting methods and levels of problem decomposition, regardless of the problem complexity. The inflexibility of these methods can bring unnecessary computational overhead or sub-optimal performance. To address this limitation, we introduce an Adaptive-Solver (AS) framework tha dynamically adapts solving strategies to suit various problems, enabling the flexible allocation of test-time computational resources. The framework functions with two primary modules. The initial evaluation module assesses the reliability of the current solution using answer consistency. If the solution…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Software Engineering Research
