Where Larger Models Excel: The Primacy of Constraint-Guided Reasoning
- URL: http://arxiv.org/abs/2606.26108v1
- Date: Sat, 09 May 2026 09:54:59 GMT
- Title: Where Larger Models Excel: The Primacy of Constraint-Guided Reasoning
- Abstract summary: We develop an automated framework that identifies questions where the larger model shows a stable advantage.<n>Our analysis yields a systematic taxonomy of larger model reasoning advantages, spanning both common advantages that recur across domains and specialized advantages associated with particular domains.<n>Across these patterns, a recurring theme is Constraint-Guided Reasoning: larger models are better at identifying explicit and implicit constraints, organizing them into structured reasoning, and using them to rule out infeasible paths and verify intermediate steps.
- Score: 15.328262855516689
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Larger language models consistently outperform smaller ones on reasoning benchmarks, yet the reasoning differences underlying this gap remain underexplored. Across benchmarks in mathematics, physics, chemistry, and programming, we observe stable performance gaps: averaged over datasets, Qwen3-32B outperforms Qwen3-8B by 6.43%, while GPT-OSS-120B exceeds GPT-OSS-20B by 7.38%. To study the reasoning differences behind these gains, we develop AdvCluster, an automated framework that identifies questions where the larger model shows a stable advantage, extracts fine-grained advantage descriptions from paired reasoning traces produced by larger and smaller models, and organizes them through semantic clustering with quantitative evaluation and selection guided by a reviewer model. Our analysis yields a systematic taxonomy of larger model reasoning advantages, spanning both common advantages that recur across domains and specialized advantages associated with particular domains. Across these patterns, a recurring theme is Constraint-Guided Reasoning: larger models are better at identifying explicit and implicit constraints, organizing them into structured reasoning, and using them to rule out infeasible paths and verify intermediate steps.
Related papers
- Preference Data Selection for Mitigating the Alignment Tax in Large Language Models [52.18310687523229]
BALIGN is a balanced data selection strategy that mitigates catastrophic forgetting while optimizing alignment efficacy.<n>By aggregating three key data-centric features into a unified composite risk score, BALIGN systematically filters out high-risk preference samples.<n>Experiments on standard human preference datasets demonstrate that BALIGN strongly preserves foundational capabilities without compromising alignment gains.
arXiv Detail & Related papers (2026-08-25T07:58:42Z) - CDRRM: Contrast-Driven Rubric Generation for Reliable and Interpretable Reward Modeling [61.75914342638658]
CDRRM (Contrast-Driven Reward Model) is a framework for high-quality rubric generation and guided preference judgment.<n>This work offers a scalable, interpretable, and data-efficient path for reward modeling.
arXiv Detail & Related papers (2026-03-09T07:15:23Z) - Reasoning-Driven Multimodal LLM for Domain Generalization [72.00754603114187]
We study the role of reasoning in domain generalization using DomainBed-Reasoning dataset.<n>We propose RD-MLDG, a framework with two components: MTCT (Multi-Task Cross-Training) and SARR (Self-Aligned Reasoning Regularization)<n>Experiments on standard DomainBed datasets demonstrate that RD-MLDG achieves complementary state-of-the-art performances.
arXiv Detail & Related papers (2026-02-27T08:10:06Z) - Evaluating and Enhancing the Vulnerability Reasoning Capabilities of Large Language Models [15.849480549367684]
We propose DAGVul, a novel framework that models vulnerability reasoning as a Directed Acyclic Graph (DAG) generation task.<n>By further introducing Reinforcement Learning with Verifiable Rewards (RLVR), we align model reasoning trace with program-intrinsic logic.<n>Our framework improves the reasoning F1-score by an average of 18.9% over all the baselines.
arXiv Detail & Related papers (2026-02-06T13:19:45Z) - Group Pattern Selection Optimization: Let LRMs Pick the Right Pattern for Reasoning [38.16271055029922]
Group Pattern Selection Optimization (GPSO) is a reinforcement learning framework for large reasoning models.<n>GPSO incorporates multi-pattern rollouts, verifier-guided optimal pattern selection per problem, and attention masking to prevent the leakage of explicit pattern suffixes into the learned policy.<n>Extensive experiments demonstrate that GPSO delivers consistent and substantial performance gains across various model backbones and benchmarks.
arXiv Detail & Related papers (2026-01-12T06:19:09Z) - BRAID: Bounded Reasoning for Autonomous Inference and Decisions [0.0]
This paper presents a study on structured prompting using BRAID (Bounded Reasoning for Au tonomous Inference and Decisions)<n>BRAID introduces a bounded reasoning framework using Mermaid-based instruction graphs.<n>We show that structured machine-readable prompts substantially increase reasoning accuracy and cost efficiency for agents in production systems.
arXiv Detail & Related papers (2025-12-17T20:46:44Z) - Topology of Reasoning: Understanding Large Reasoning Models through Reasoning Graph Properties [48.56470855119906]
We introduce the notion of a reasoning graph, extracted by clustering hidden-state representations at each reasoning step.<n>We analyze three key graph-theoretic properties: cyclicity, diameter, and small-world index, across multiple tasks.
arXiv Detail & Related papers (2025-06-06T05:05:11Z) - Structured Thinking Matters: Improving LLMs Generalization in Causal Inference Tasks [0.7988085110283119]
Recent results from the Corr2Cause dataset benchmark reveal that state-of-the-art LLMs only marginally outperform random baselines.<n>We provide the model with the capability to structure its thinking by guiding the model to build a structured knowledge graph.<n> Experiments on the test subset of the Corr2Cause dataset benchmark with Qwen3-32B model (reasoning model) show substantial gains over standard direct prompting methods.
arXiv Detail & Related papers (2025-05-23T15:37:40Z) - GenBench: A Benchmarking Suite for Systematic Evaluation of Genomic Foundation Models [56.63218531256961]
We introduce GenBench, a benchmarking suite specifically tailored for evaluating the efficacy of Genomic Foundation Models.
GenBench offers a modular and expandable framework that encapsulates a variety of state-of-the-art methodologies.
We provide a nuanced analysis of the interplay between model architecture and dataset characteristics on task-specific performance.
arXiv Detail & Related papers (2024-06-01T08:01:05Z) - Advancing LLM Reasoning Generalists with Preference Trees [119.57169648859707]
We introduce Eurus, a suite of large language models (LLMs) optimized for reasoning.
Eurus models achieve state-of-the-art results among open-source models on a diverse set of benchmarks.
arXiv Detail & Related papers (2024-04-02T16:25:30Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.