Complexity-aware fine-tuning

Andrey Goncharov, Daniil Vyazhev, Petr Sychev, Edvard Khalafyan, Alexey Zaytsev
6/26/2025
cs.LGcs.CL

No official code found. Best implementation: LabARSS/complexity-aware-fine-tuning (2 stars, last commit 2026-01-20). 1 more below.

Abstract

General-purpose Large Language Models (LLMs) are frequently fine-tuned through supervised fine-tuning (SFT) to enhance performance in specific domains. Better results can be achieved by distilling the chain-of-thought of a larger model at the cost of numerous expensive calls and a much greater amount of data. We propose a novel blueprint for efficient fine-tuning that uses reasoning only for complex data identified by entropy. Specifically, across two small open models ($~3B$) we split the training data into complexity categories by a single token answer entropy (ROC AUC $0.73$), fine-tune large language models (LLMs) via SFT and distillation, and show that our pipeline significantly outperforms the standard SFT approach ($0.58$ vs $0.45$ average accuracy) and outperforms the distillation approach ($0.58$ vs $0.56$ average accuracy) while using $81%$ less data.

View on arXivView PDF

Code Implementations(2)

22Python, Jupyter NotebookMar 11, 20259 months ago
00Python, Jupyter NotebookMay 20, 20251 years ago

Similar Papers

Cite this paper

@article{goncharov2025complexityaware,
  title  = {Complexity-aware fine-tuning},
  author = {Andrey Goncharov and Daniil Vyazhev and Petr Sychev and Edvard Khalafyan and Alexey Zaytsev},
  year   = {2025},
  eprint = {2506.21220},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.21220v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.21220.svg)](https://codeofpaper.com/paper/2506.21220)

Discussion