Self-Reasoning Language Models: Unfold Hidden Reasoning Chains with Few Reasoning Catalyst
원문 초록
Inference-time scaling has attracted much attention which significantly enhance the performance of Large Language Models (LLMs) in complex reasoning tasks by increasing the length of Chain-of-Thought. These longer intermediate reasoning rationales embody various meta-reasoning skills in human cognition, such as reflection and decomposition, being difficult to create and acquire. In this work, we introduce \textit{Self-Reasoning Language Model} (SRLM), where the model itself can synthesize longer CoT data and iteratively improve performance through self-training. By incorporating a few demonstration examples (i.e., 1,000 samples) on how to unfold hidden reasoning chains from existing responses, which act as a reasoning catalyst, we demonstrate that SRLM not only enhances the model's initial performance but also ensures more stable and consistent improvements in subsequent iterations. Our proposed SRLM achieves an average absolute improvement of more than $+2.5$ points across five reasoning tasks: MMLU, GSM8K, ARC-C, HellaSwag, and BBH on two backbone models. Moreover, it brings more improvements with more times of sampling during inference, such as absolute $+7.89$ average improvement with $64$ sampling times, revealing the in-depth, diverse and creative reasoning paths in SRLM against the strong baseline.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Elastic Weight Consolidation for Full-Parameter Continual Pre-Training of Gemma2
Slimming Down LLMs Without Losing Their Minds
DataDecide: How to Predict Best Pretraining Data with Small Experiments
More is Less: The Pitfalls of Multi-Model Synthetic Preference Data in DPO Safety Alignment
any4: Learned 4-bit Numeric Representation for LLMs
Simulating Training Data Leakage in Multiple-Choice Benchmarks for LLM Evaluation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.