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.
Reasoning While Asking: Transforming Reasoning Large Language Models from Passive Solvers to Proactive Inquirers
National Key Laboratory for Novel Software Technology(新型软件技术国家重点实验室);Artificial Intelligence Research Institute(人工智能研究院);Shenzhen Institutes of Advanced Technology(深圳先进技术研究院);University of California, Santa Cruz(加州大学圣克鲁兹分校);University of Texas, Dallas(德克萨斯大学达拉斯分校);University of Minnesota(明尼苏达大学)
Adaptive LLM-Symbolic Reasoning via Dynamic Logical Solver Composition
Idiap Research Institute(Idiap研究机构);École Polytechnique Fédérale de Lausanne(联邦理工学院洛桑分校);School of Computer Science, University of Sheffield(谢菲尔德大学计算机科学学院);Department of Computer Science, University of Manchester(曼彻斯特大学计算机科学系);Cancer Biomarker Centre, CRUK Manchester Institute(癌症生物标志物中心,CRUK曼彻斯特研究所)
Know Your Limits : On the Faithfulness of LLMs as Solvers and Autoformalizers in Legal Reasoning
UC Santa Cruz(加州大学圣克鲁兹分校);Univ. Helsinki(赫尔辛基大学);CodeX, Stanford(斯坦福大学CodeX中心);Stanford University(斯坦福大学);Canyon Crest Academy(峡谷峰学院);Monta Vista High School(蒙塔维斯塔高中);Los Altos High School(洛斯阿尔托斯高中)
Rewarding Novel Deductions: Solver-guided Process Supervision for Logical Reasoning
Information Technology University(信息技术大学);Huazhong Agricultural University(华中农业大学);Qatar Computing Research Institute, Hamad Bin Khalifa University(卡塔尔计算研究所,哈马德·本·哈利法大学)
Matrix as Plan: Structured Logical Reasoning with Feedback-Driven Replanning
Faculty of Arts and Sciences(艺术与科学学院);Beijing Normal University(北京师范大学);Institute of Artificial Intelligence and Future Networks(人工智能与未来网络研究所);Engineering Research Center of Cloud-Edge Intelligent Collaboration on Big Data, Ministry of Education(教育部云-边智能协同大数据工程研究中心)
Seeing with You: Perception-Reasoning Coevolution for Multimodal Reasoning
Shanghai Artificial Intelligence Laboratory(上海人工智能实验室);Gaoling School of Artificial Intelligence, Renmin University of China(中国人民大学高瓴人工智能学院);Zhejiang University(浙江大学)
R-Zero: Self-Evolving Reasoning LLM from Zero Data
Tencent AI Seattle Lab(腾讯AI西雅图实验室);Washington University in St. Louis(华盛顿大学圣路易斯分校);University of Maryland, College Park(马里兰大学科廷分校);The University of Texas at Dallas(德克萨斯大学达拉斯分校)
Mixture-of-Visual-Thoughts: Exploring Context-Adaptive Reasoning Mode Selection for General Visual Reasoning
Fudan University(复旦大学);Alibaba Group Holding Limited(阿里巴巴集团控股有限公司);Future Living Lab of Alibaba(阿里巴巴未来生活实验室);University of Southern California(南加州大学);Shanghai Innovation Institute(上海创新研究院)
CAP-CoT: Cycle Adversarial Prompt for Improving Chain of Thoughts in LLM Reasoning
Department of Electronic Engineering, Kyung Hee University(韩国庆熙大学电子工程系);School of Computer Science and Engineering, University of Electronic Science and Technology of China(中国电子科技大学计算机科学与工程学院);Henan Polytechnic University(河南理工大学);School of Computing, Kyung Hee University(韩国庆熙大学计算机学院)
AutoPRM: Automating Procedural Supervision for Multi-Step Reasoning via Controllable Question Decomposition
University of Chicago(芝加哥大学);Peking University(北京大学);University of California, Berkeley(加州大学伯克利分校);Carnegie Mellon University(卡内基梅隆大学);UNC-Chapel Hill(北卡罗来纳大学教堂山分校)
Yale University(耶鲁大学);Stanford University(斯坦福大学);University of Chicago(芝加哥大学);Toyota Technological Institute at Chicago(芝加哥丰田技术研究所);University of California, San Diego(圣地亚哥大学)