Large language models often fail on multi-step reasoning due to fixed reasoning strategies that ignore problem specific difficulty. We introduce CARD (Complexity Agnostic Recursive Decomposition), a framework that predicts problem complexity before generation and adapts decomposition accordingly. Our system comprises MRCE (Multi-dimensional Reasoning Complexity Estimator), a 0.6B Qwen model predicting 30 fine-grained features from question text and a two-stage recursive solver: (1) hierarchical decomposition into K steps based on task profile and (2) per-step thought budget allocation (1, 5-9, or 10 thoughts) via recursive MRCE profiling. Evaluated on three reasoning models (Qwen3-0.6B, DeepSeek-R1-Distill-Qwen-1.5B, Qwen3-1.7B), CARD achieves 81.4% to 89.2% accuracy on GSM8K while reducing token cost by 1.88x to 2.40x compared to fixed decomposition baselines. On MATH-500, CARD reaches 75.1 to 86.8% accuracy using 1.71x to 5.74x fewer tokens. Our results demonstrate that preemptive complexity estimation enables both higher accuracy and significant efficiency gains.
Unlocking Recursive Thinking of LLMs: Alignment via Refinement
Soochow University(苏州大学);Zhipu AI(智谱AI);Tsinghua University(清华大学);Key Laboratory of Data Intelligence and Advanced Computing, Soochow University(苏州大学数据智能与先进计算重点实验室)
The Emergence of Abstract Thought in Large Language Models Beyond Any Language
National University of Singapore(新加坡国立大学);Salesforce AI Research(Salesforce AI研究院);Peking University(北京大学);Singapore University of Technology and Design(新加坡科技设计大学)
SCOUT: Teaching Pre-trained Language Models to Enhance Reasoning via Flow Chain-of-Thought
SIGS, Tsinghua University(清华大学信息科学与技术学院);Southern University of Science and Technology(南方科技大学);Guangdong Laboratory of AI and Digital Economy (SZ)(广东人工智能与数字经济实验室);The Hong Kong University of Science and Technology(香港科技大学);Peking University(北京大学)
The Markovian Thinker: Architecture-Agnostic Linear Scaling of Reasoning
Mila;Microsoft Research(微软研究院);McGill University(麦吉尔大学);ServiceNow Research(ServiceNow研究院);Canada CIFAR AI Chair(加拿大CIFAR人工智能主席);Chandar Research Lab(Chandar研究实验室);Polytechnique Montréal(蒙特利尔理工学院);Université de Montréal(蒙特利尔大学)
SoT: Structured-of-Thought Prompting Guides Multilingual Reasoning in Large Language Models
Key Laboratory of Big Data & Artificial Intelligence in Transportation (Beijing Jiaotong University), Ministry of Education(大数据与人工智能交通 key laboratory(北京交通大学));School of Computer Science and Technology, Beijing Jiaotong University(计算机科学与技术学院(北京交通大学));University of Montreal(蒙特利尔大学)
To Reason or Not to: Selective Chain-of-Thought in Medical Question Answering
Department of Electrical and Computer Engineering(电气与计算机工程系);University of Minnesota(明尼苏达大学);Division of Computational Health Sciences, Department of Surgery(计算健康科学 division,外科系);Department of Computer Science and Engineering(计算机科学与工程系);Health Data Science, School of Public Health(公共卫生学院健康数据科学系)
Latent Thinking Optimization: Your Latent Reasoning Language Model Secretly Encodes Reward Signals in Its Latent Thoughts
Department of Computer Science and Engineering, The Ohio State University, USA(计算机科学与工程系,俄亥俄州立大学);Department of Biomedical Informatics, The Ohio State University, USA(生物医学信息学系,俄亥俄州立大学);Translational Data Analytics Institute, The Ohio State University, USA(转化数据分析研究所,俄亥俄州立大学)
LifeGPT: Topology-Agnostic Generative Pretrained Transformer Model for Cellular Automata
Massachusetts Institute of Technology(麻省理工学院);Schwarzmann College of Computing(施瓦茨曼计算学院);Laboratory for Atomistic and Molecular Mechanics (LAMM)(原子与分子力学实验室);Center for Computational Science and Engineering(计算科学与工程中心)
本文提出拓扑无关的仅解码器GPT模型LifeGPT,在无网格拓扑先验下以近乎完美准确度模拟Conway's Game of Life,并引入自回归自回归器实现递归,为大型语言模型框架内的通用计算及生物逆问题求解铺路。
Beyond Context Limits: Subconscious Threads for Long-Horizon Reasoning
MIT CSAIL(麻省理工学院计算机科学与人工智能实验室);Subconscious Systems Technologies, Inc.(Subconscious Systems Technologies公司);Princeton University(普林斯顿大学);Tel Aviv University(特拉维夫大学)