Papers › Adaptive-Solver Framework for Dynamic Strategy Selection in Large Language Model Reasoning

Adaptive-Solver Framework for Dynamic Strategy Selection in Large Language Model Reasoning

1 Oct 2023arXiv:2310.01446archive 2025-07-28

Jianpeng Zhou, Wanjun Zhong, Yanlin Wang, Jiahai Wang

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 is deemed unreliable, the subsequent adaptation module comes into play. Within this module, various types of adaptation strategies are employed collaboratively. Through such dynamic and multi-faceted adaptations, our framework can help reduce computational consumption and improve performance. Experimental results from complex reasoning benchmarks reveal that our method can significantly reduce API costs (up to 85%) while maintaining original performance. Alternatively, it achieves up to 4.5% higher accuracy compared to the baselines at the same cost. The code and dataset are available at https://github.com/john1226966735/Adaptive-Solver.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2310.01446")

Code

Syntology Ran 4 of 11 code samples harvested from 1 repository linked to this paper; 7 have no recorded run. Of those that ran: 4 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 4 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

john1226966735/adaptive-solver officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 4 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

4ran
7unverified

Licence: 11 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from john1226966735/adaptive-solver. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

evaluate_answer john1226966735/adaptive-solver/run_pipeline_configuration/main_base_adaptation.py official repository ran no licence file found · pointer only · 6174daf23f325f31 · report
extract_finance john1226966735/adaptive-solver/extracter.py official repository ran no licence file found · pointer only · 016092b3d2d43161 · report
read_result john1226966735/adaptive-solver/run_pipeline_configuration/main_base_adaptation.py official repository ran no licence file found · pointer only · 35fd87a2e8c0a97d · report
remove_duplicates john1226966735/adaptive-solver/utils.py official repository ran fingerprinted no licence file found · pointer only · dc4174baa18a4b99 · report
basic_runner john1226966735/adaptive-solver/prediction_runner.py official repository unverified no licence file found · pointer only · b9a1b806f4a7105a · report
decoder_for_gpt3_chat john1226966735/adaptive-solver/prediction_runner.py official repository unverified no licence file found · pointer only · 74cd70e257cd69be · report
get_prompts john1226966735/adaptive-solver/prompt.py official repository unverified no licence file found · pointer only · 7c79771a8d17e4a8 · report
load_data john1226966735/adaptive-solver/loader.py official repository unverified no licence file found · pointer only · 9d94add410b8ada0 · report
print_exp john1226966735/adaptive-solver/utils.py official repository unverified no licence file found · pointer only · f1a772f125f7b119 · report
print_now john1226966735/adaptive-solver/utils.py official repository unverified no licence file found · pointer only · 28145bbcf1d4f9ea · report
run john1226966735/adaptive-solver/run_pipeline_configuration/main_base_adaptation.py official repository unverified no licence file found · pointer only · f1c8ab92016ab662 · report

Tasks

Computational EfficiencyLanguage ModelingLanguage ModellingLarge Language ModelProblem Decomposition

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections