Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.11365 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908960008699904 |
|---|---|
| author | Liu, Peiyang Chen, Zhirui Wang, Xi Liang, Di Li, Youru Cai, Zhi Ye, Wei |
| author_facet | Liu, Peiyang Chen, Zhirui Wang, Xi Liang, Di Li, Youru Cai, Zhi Ye, Wei |
| contents | Monte Carlo Tree Search (MCTS) has been widely used for automated reasoning data exploration, but current supervision extraction methods remain inefficient. Standard approaches retain only the single highest-reward trajectory, discarding the comparative signals present in the many explored paths. Here we introduce \textbf{Contrastive Reasoning Path Synthesis (CRPS)}, a framework that transforms supervision extraction from a filtering process into a synthesis procedure. CRPS uses a structured reflective process to analyze the differences between high- and low-quality search trajectories, extracting explicit information about strategic pivots and local failure modes. These insights guide the synthesis of reasoning chains that incorporate success patterns while avoiding identified pitfalls. We show empirically that models fine-tuned on just 60K CRPS-synthesized examples match or exceed the performance of baselines trained on 590K examples derived from standard rejection sampling, a 20$\times$ reduction in dataset size. Furthermore, CRPS improves generalization on out-of-domain benchmarks, demonstrating that learning from the contrast between success and failure produces more transferable reasoning capabilities than learning from success alone. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_11365 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Learning from Contrasts: Synthesizing Reasoning Paths from Diverse Search Trajectories Liu, Peiyang Chen, Zhirui Wang, Xi Liang, Di Li, Youru Cai, Zhi Ye, Wei Artificial Intelligence Computation and Language Monte Carlo Tree Search (MCTS) has been widely used for automated reasoning data exploration, but current supervision extraction methods remain inefficient. Standard approaches retain only the single highest-reward trajectory, discarding the comparative signals present in the many explored paths. Here we introduce \textbf{Contrastive Reasoning Path Synthesis (CRPS)}, a framework that transforms supervision extraction from a filtering process into a synthesis procedure. CRPS uses a structured reflective process to analyze the differences between high- and low-quality search trajectories, extracting explicit information about strategic pivots and local failure modes. These insights guide the synthesis of reasoning chains that incorporate success patterns while avoiding identified pitfalls. We show empirically that models fine-tuned on just 60K CRPS-synthesized examples match or exceed the performance of baselines trained on 590K examples derived from standard rejection sampling, a 20$\times$ reduction in dataset size. Furthermore, CRPS improves generalization on out-of-domain benchmarks, demonstrating that learning from the contrast between success and failure produces more transferable reasoning capabilities than learning from success alone. |
| title | Learning from Contrasts: Synthesizing Reasoning Paths from Diverse Search Trajectories |
| topic | Artificial Intelligence Computation and Language |
| url | https://arxiv.org/abs/2604.11365 |