Unlocking Recursive Thinking of LLMs: Alignment via Refinement

The OpenAI o1-series models have demonstrated that leveraging long-form Chain of Thought (CoT) can substantially enhance performance.However, the recursive thinking capabilities of Large Language Models (LLMs) remain limited, particularly in the absence of expert-curated data for distillation.In this paper, we propose AvR: Alignment via Refinement, a novel method aimed at unlocking the potential of LLMs for recursive reasoning through long-form CoT.AvR introduces a refinement process that integrates criticism and improvement actions, guided by differentiable learning techniques to optimize refinementaware rewards.As a result, the synthesized multi-round data can be organized as a long refinement thought, further enabling test-time scaling.Experimental results show that AvR significantly outperforms conventional preference optimization methods.Notably, with only 3k synthetic samples, our method boosts the performance of the LLaMA-3-8B-Instruct model by over 20% in win rate on AlpacaEval 2.0.Our code is available at Github 1 .

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.findings-acl.582
Primary Topic
Artificial Intelligence in Law
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Unlocking Recursive Thinking of LLMs: Alignment via Refinement

Cunxiang Wang, Haoke Zhang, Xiaobo Liang, Juntao Li et al.
Artificial Intelligence in Law
article

Unlocking Recursive Thinking of LLMs: Alignment via Refinement

Cunxiang Wang, Haoke Zhang, Xiaobo Liang, Juntao Li, Min Zhang
article en

Abstract

The OpenAI o1-series models have demonstrated that leveraging long-form Chain of Thought (CoT) can substantially enhance performance.However, the recursive thinking capabilities of Large Language Models (LLMs) remain limited, particularly in the absence of expert-curated data for distillation.In this paper, we propose AvR: Alignment via Refinement, a novel method aimed at unlocking the potential of LLMs for recursive reasoning through long-form CoT.AvR introduces a refinement process that integrates criticism and improvement actions, guided by differentiable learning techniques to optimize refinementaware rewards.As a result, the synthesized multi-round data can be organized as a long refinement thought, further enabling test-time scaling.Experimental results show that AvR significantly outperforms conventional preference optimization methods.Notably, with only 3k synthetic samples, our method boosts the performance of the LLaMA-3-8B-Instruct model by over 20% in win rate on AlpacaEval 2.0.Our code is available at Github 1 .

National Science Foundation, National Natural Science Foundation of China, Government of Jiangsu Province, Natural Science Foundation of Jiangsu Province
Reduced inequalities
Openalex Percentile: Top 77%
Artificial Intelligence in Law
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Unlocking Recursive Thinking of LLMs: Alignment via Refinement — Cunxiang Wang, Haoke Zhang, et al. · (2025) | TGRS Research Map | TGRS