Xinbang Dai, Zheyu Xin, Huikang Hu, Lin Ren, Rihui Jin, Guohui Xiao, Guilin Qi, Kuicai Dong
Competent, timely contribution to efficient reasoning with a genuinely useful from-wrong-to-right insight, but incremental novelty and noisy small-benchmark evaluation cap its impact
Large Reasoning Models (LRMs) often suffer from overthinking due to redundant verification steps. Existing approaches for mitigating overthinking, such as fast-slow thinking switching and reasoning trajectory compression, fail to make a fine-grained distinction between beneficial and redundant steps within the LRM's reasoning process, and may thus impair reasoning capability in their pursuit of efficiency. To simultaneously improve reasoning efficiency and capability, we propose EvoThink, a framework that reduces redundant verification and encourages the exploration of new reasoning paths. EvoThink comprises two key components: Self-Pruning Training (SPT), an unsupervised method that iteratively prunes redundant reasoning steps and self-trains on the concise trajectories; and Aha-Moment Preference Optimization (AMPO), which, inspired by genetic algorithms, identifies valuable failed reasoning attempts, synthesizes from-wrong-to-right aha-moment data, and optimizes the model to internalize this reasoning pattern. Extensive evaluations across mathematical reasoning and code generation benchmarks demonstrate that EvoThink not only substantially reduces inference-time token usage but also improves the reasoning capability of LRMs.
Core Contribution. EvoThink targets the "overthinking" problem in Large Reasoning Models — the tendency to burn tokens on redundant self-verification. Its central claim is unusual: it aims to improve efficiency *and* reasoning capability simultaneously, whereas most compression methods accept an accuracy drop. The framework has two parts. Self-Pruning Training (SPT) introduces the notion of an "atomic reasoning unit," prompts the model to segment its own trace, removes units that merely re-derive a prior local conclusion, and iteratively self-trains on the pruned traces (unsupervised, no gold answers). Aha-Moment Preference Optimization (AMPO) treats a pool of failed reasoning attempts as a genetic-algorithm population, uses a diversity-based fitness (count of distinct local conclusions) to select high-potential failures, synthesizes "from-wrong-to-right" transitions by grafting a corrective continuation onto the flawed prefix, and applies DPO. The from-wrong-to-right data-construction idea is the freshest element.
Methodological Rigor. The evaluation is reasonably thorough: three backbones (Distill-Qwen-1.5B, DeepScaleR-1.5B, QwQ-32B), four benchmarks (MATH-500, AIME24/25, TACO), and three baseline families (vanilla, SFT/DPO à la Kimi, and RL-based O1-Pruner/ThinkPrune/DIET). Ablations isolate SPT vs. AMPO, study population size K, contrast high- vs. low-diversity trajectory selection, and include a transfer-learning setting (train on MATH, test on AIME) to argue against mere memorization. These are the right experiments to support the claims. However, rigor is weakened by (1) no error bars or significance testing — AIME24/25 have only 30 problems each, so Pass@1 swings of a few points (the paper's headline gains) sit within plausible sampling noise even with 8 samples; (2) the "genetic algorithm" framing is loose — it amounts to single-generation selection of the highest-diversity failure with no crossover or iterated evolution; and (3) many core steps depend on the model itself acting as annotator (segmenting units, judging conclusion equivalence, counting distinct conclusions), whose reliability is asserted rather than measured.
A key nuance in the results: AMPO alone *increases* token count (e.g., DeepScaleR MATH500: 3441 vs. 3171 vanilla; QwQ AIME24: 8019 vs. 7290) while boosting accuracy — so the efficiency gains come almost entirely from SPT, and the combined method is a balancing act, not a strict Pareto improvement on both axes. The abstract's framing slightly oversells simultaneity; the honest picture is that SPT buys efficiency and AMPO buys accuracy, and the combination lands in between.
Potential Impact. Efficient reasoning is a very active subfield in 2025, and the paper slots cleanly into it with well-chosen baselines. The most transferable insight — that grafting from-wrong-to-right corrective data outperforms direct SFT/DPO on condensed gold solutions, because the model internalizes an exploratory recovery pattern rather than a mismatched style — is a genuinely useful observation others may adopt for reasoning-data curation. This is likely to be cited and possibly built upon within the efficient-reasoning / reasoning-data community, but it is an incremental advance in a crowded space rather than a paradigm shift.
Timeliness & Relevance. Highly timely. Inference cost of long chain-of-thought is a real deployment bottleneck, and the "don't indiscriminately compress" critique of prior length-penalty RL methods is well-motivated.
Reproducibility & Resources. Training uses veRL on 8×H100 including a 32B model — a meaningful barrier for smaller labs, though the 1.5B experiments are more accessible. Datasets are public; the annotation prompts and code are not, so exact replication would require nontrivial reconstruction.
Overall. A competent, well-motivated, moderately novel contribution to efficient reasoning. Its most durable value is the empirical finding that from-wrong-to-right preference data teaches more generalizable reasoning than direct gold-solution supervision. Its impact is capped by incremental novelty, noisy evaluation on small benchmarks, and the somewhat overstated "improve both simultaneously" framing.
Generated Jul 23, 2026
Paper 2 solves a critical infrastructure bottleneck in AI: training complex, stateful agents end-to-end via RL. While Paper 1 offers a clever algorithmic optimization for reasoning models, Paper 2 provides a foundational, open-source framework (OpenForgeRL) enabling the broader community to train and scale agents across diverse real-world environments (GUI, browsers, tool-use). By unblocking RL for multi-process agent harnesses, Paper 2 will likely catalyze widespread advancements in agentic AI, offering broader and more transformative utility across the field.
Paper 1 tackles overthinking in Large Reasoning Models, a highly timely and broadly relevant problem affecting inference efficiency and cost across all LRM applications. Its dual contribution of improving both efficiency and capability addresses a fundamental tension in the field, with impact spanning math, code, and general reasoning. Paper 2 addresses multimodal emotion recognition with a specialized agentic framework; while methodologically sophisticated (P-GRPO), its impact is narrower and domain-specific. Paper 1's broader applicability to the rapidly growing reasoning-model ecosystem gives it higher potential cross-field impact and relevance.
Paper 1 addresses a critical bottleneck in Large Reasoning Models (LRMs): inference efficiency and overthinking. Its novel approach of synthesizing 'aha-moment' data and self-pruning offers broad applicability across the rapidly expanding field of generative AI. While Paper 2 presents a rigorous and highly valuable multimodal foundation model for clinical EEG analysis, Paper 1's focus on foundational AI reasoning capabilities provides a significantly wider breadth of impact. Improvements in LRMs immediately benefit numerous downstream domains, making Paper 1 more timely and universally impactful.
Paper 1 addresses a highly critical and timely challenge in modern AI: optimizing inference-time compute and reducing overthinking in Large Reasoning Models. Its novel integration of Self-Pruning and 'Aha-Moment' Preference Optimization offers immediate, broad real-world applications in LLMs, math, and coding. While Paper 2 presents a rigorous and innovative neuro-symbolic architecture, Paper 1's alignment with the current explosive focus on inference scaling laws and reasoning capabilities gives it significantly higher potential for widespread scientific impact and adoption.
Paper 1 targets Large Reasoning Models, an extremely timely area following the rise of inference-time scaling. Its novel 'Aha-Moment Preference Optimization' and self-pruning directly address critical bottlenecks in computational efficiency and LLM reasoning capability. This offers broader real-world applications across NLP and software engineering compared to Paper 2's focus on latent world models for RL control. While Paper 2 introduces a rigorous disentanglement method, Paper 1's immediate relevance to the booming generative AI field and highly innovative genetic-inspired training paradigm give it a higher potential for widespread scientific impact.
Paper 2 (MAGE) likely has higher scientific impact due to strong real-world applicability and timeliness in industrial chip physical design, with sizable improvements over commercial tools and even human experts across multiple technology nodes. Its multimodal multi-agent methodology, rule/criteria encoding without labeled data, and new human-likeness metrics broaden impact to EDA, agentic AI, and human-in-the-loop optimization. Paper 1 is novel for LRM efficiency and training signals, but its impact may be more incremental within a crowded LLM reasoning-efficiency space and less directly tied to high-stakes industrial deployment.
Paper 2 presents an interdisciplinary benchmark bridging AI, genomics, and biosecurity. By addressing a critical bottleneck in pathogen surveillance—essential for global pandemic preparedness—it offers profound real-world applications and broad societal impact. While Paper 1 introduces a valuable algorithmic improvement for AI reasoning, its impact is largely confined to the machine learning domain. Paper 2's focus on standardized evaluation in a high-stakes, life-saving domain ensures enduring relevance and a wider scientific footprint across multiple fields.
Paper 1 addresses a critical bottleneck in Large Reasoning Models—inference efficiency and overthinking—which is highly relevant to current mainstream AI development. Its novel 'Aha-Moment Preference Optimization' and 'Self-Pruning Training' offer scalable ways to enhance both reasoning capability and efficiency. While Paper 2 provides rigorous vulnerability analysis for Graph Foundation Models, Paper 1 has significantly broader applicability, higher commercial relevance, and tackles a more pressing challenge in the rapidly expanding field of general-purpose LLMs, ensuring a wider and more immediate scientific impact.
Paper 2 likely has higher impact due to stronger timeliness and broader cross-field applicability: improving LRM reasoning efficiency/capability affects many AI tasks, products, and research areas. Its methods (self-pruning of reasoning trajectories and preference optimization using synthesized “aha” corrections) are broadly reusable and can translate to immediate real-world gains (latency/cost reductions) while potentially improving accuracy. Paper 1 is novel and practically important for safe IT-Ops, but its domain is narrower and validation on a benchmark microservice setting may limit perceived generality versus foundational LRM training techniques.
While Paper 1 presents a valuable application for materials science, Paper 2 has significantly higher potential scientific impact due to its vast breadth. Advancements in Large Reasoning Models affect nearly all computational fields. By addressing the critical bottleneck of inference-time overthinking through novel Self-Pruning Training and Aha-Moment Preference Optimization, Paper 2 improves both AI efficiency and fundamental reasoning capabilities. This foundational contribution to general AI architectures will likely be widely adopted and cited across diverse domains, whereas Paper 1's impact is largely confined to computational chemistry.
Competent, timely contribution to efficient reasoning with a genuinely useful from-wrong-to-right insight, but incremental novelty and noisy small-benchmark evaluation cap its impact