QFFT, Question-Free Fine-Tuning for Adaptive Reasoning
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918060012601344 |
|---|---|
| author | Liu, Wanlong Xu, Junxiao Yu, Fei Lin, Yukang Ji, Ke Chen, Wenyu Xu, Yan Wang, Yasheng Shang, Lifeng Wang, Benyou |
| author_facet | Liu, Wanlong Xu, Junxiao Yu, Fei Lin, Yukang Ji, Ke Chen, Wenyu Xu, Yan Wang, Yasheng Shang, Lifeng Wang, Benyou |
| contents | Recent advancements in Long Chain-of-Thought (CoT) reasoning models have improved performance on complex tasks, but they suffer from overthinking, which generates redundant reasoning steps, especially for simple questions. This paper revisits the reasoning patterns of Long and Short CoT models, observing that the Short CoT patterns offer concise reasoning efficiently, while the Long CoT patterns excel in challenging scenarios where the Short CoT patterns struggle. To enable models to leverage both patterns, we propose Question-Free Fine-Tuning (QFFT), a fine-tuning approach that removes the input question during training and learns exclusively from Long CoT responses. This approach enables the model to adaptively employ both reasoning patterns: it prioritizes the Short CoT patterns and activates the Long CoT patterns only when necessary. Experiments on various mathematical datasets demonstrate that QFFT reduces average response length by more than 50\%, while achieving performance comparable to Supervised Fine-Tuning (SFT). Additionally, QFFT exhibits superior performance compared to SFT in noisy, out-of-domain, and low-resource scenarios. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_12860 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | QFFT, Question-Free Fine-Tuning for Adaptive Reasoning Liu, Wanlong Xu, Junxiao Yu, Fei Lin, Yukang Ji, Ke Chen, Wenyu Xu, Yan Wang, Yasheng Shang, Lifeng Wang, Benyou Computation and Language Recent advancements in Long Chain-of-Thought (CoT) reasoning models have improved performance on complex tasks, but they suffer from overthinking, which generates redundant reasoning steps, especially for simple questions. This paper revisits the reasoning patterns of Long and Short CoT models, observing that the Short CoT patterns offer concise reasoning efficiently, while the Long CoT patterns excel in challenging scenarios where the Short CoT patterns struggle. To enable models to leverage both patterns, we propose Question-Free Fine-Tuning (QFFT), a fine-tuning approach that removes the input question during training and learns exclusively from Long CoT responses. This approach enables the model to adaptively employ both reasoning patterns: it prioritizes the Short CoT patterns and activates the Long CoT patterns only when necessary. Experiments on various mathematical datasets demonstrate that QFFT reduces average response length by more than 50\%, while achieving performance comparable to Supervised Fine-Tuning (SFT). Additionally, QFFT exhibits superior performance compared to SFT in noisy, out-of-domain, and low-resource scenarios. |
| title | QFFT, Question-Free Fine-Tuning for Adaptive Reasoning |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2506.12860 |