dorsal/arxiv
View SchemaGroup Pattern Selection Optimization: Let LRMs Pick the Right Pattern for Reasoning
| Authors | Hanbin Wang, Jingwei Song, Jinpeng Li, Fei Mi, Lifeng Shang |
|---|---|
| Categories | |
| ArXiv ID | 2601.07238vv1 |
| URL | https://arxiv.org/abs/2601.07238 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Large reasoning models (LRMs) exhibit diverse high-level reasoning patterns (e.g., direct solution, reflection-and-verification, and exploring multiple solutions), yet prevailing training recipes implicitly bias models toward a limited set of dominant patterns. Through a systematic analysis, we identify substantial accuracy variance across these patterns on mathematics and science benchmarks, revealing that a model's default reasoning pattern is often sub-optimal for a given problem. To address this, we introduce Group Pattern Selection Optimization (GPSO), a reinforcement learning framework that extends GRPO by incorporating multi-pattern rollouts, verifier-guided optimal pattern selection per problem, and attention masking during optimization to prevent the leakage of explicit pattern suffixes into the learned policy. By exploring a portfolio of diverse reasoning strategies and optimizing the policy on the most effective ones, GPSO enables the model to internalize the mapping from problem characteristics to optimal reasoning patterns. Extensive experiments demonstrate that GPSO delivers consistent and substantial performance gains across various model backbones and benchmarks, effectively mitigating pattern sub-optimality and fostering more robust, adaptable reasoning. All data and codes are available at https://github.com/wanghanbinpanda/GPSO.
{
"annotation_id": "bd5f207e-1f00-4d1a-a9cf-834c45e9e3da",
"date_created": "2026-02-17T05:53:12.546000Z",
"date_modified": "2026-02-17T05:53:12.546000Z",
"file_hash": "a05c857e021cd5646836669c334d0c2af21f27738dbe25833e36379e2392464f",
"private": false,
"record": {
"abstract": "Large reasoning models (LRMs) exhibit diverse high-level reasoning patterns (e.g., direct solution, reflection-and-verification, and exploring multiple solutions), yet prevailing training recipes implicitly bias models toward a limited set of dominant patterns. Through a systematic analysis, we identify substantial accuracy variance across these patterns on mathematics and science benchmarks, revealing that a model\u0027s default reasoning pattern is often sub-optimal for a given problem. To address this, we introduce Group Pattern Selection Optimization (GPSO), a reinforcement learning framework that extends GRPO by incorporating multi-pattern rollouts, verifier-guided optimal pattern selection per problem, and attention masking during optimization to prevent the leakage of explicit pattern suffixes into the learned policy. By exploring a portfolio of diverse reasoning strategies and optimizing the policy on the most effective ones, GPSO enables the model to internalize the mapping from problem characteristics to optimal reasoning patterns. Extensive experiments demonstrate that GPSO delivers consistent and substantial performance gains across various model backbones and benchmarks, effectively mitigating pattern sub-optimality and fostering more robust, adaptable reasoning. All data and codes are available at https://github.com/wanghanbinpanda/GPSO.",
"arxiv_id": "2601.07238",
"authors": [
"Hanbin Wang",
"Jingwei Song",
"Jinpeng Li",
"Fei Mi",
"Lifeng Shang"
],
"categories": [
"cs.AI"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Group Pattern Selection Optimization: Let LRMs Pick the Right Pattern for Reasoning",
"url": "https://arxiv.org/abs/2601.07238",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "2af24dad-2259-4341-8a54-7d28992a658c",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}