LGAICLOct 19, 2025

Utility-Diversity Aware Online Batch Selection for LLM Supervised Fine-tuning

Tsinghua
arXiv:2510.16882v14 citationsh-index: 10Has Code
Originality Incremental advance
AI Analysis

This addresses the problem of efficient data curation for LLM fine-tuning, offering a practical solution for researchers and practitioners, though it appears incremental as it builds on existing online batch selection approaches.

The paper tackles the problem of computationally expensive supervised fine-tuning (SFT) for large language models by developing UDS, an online batch selection method that dynamically selects valuable data during training. The result shows that UDS outperforms state-of-the-art methods under varying data budgets and significantly reduces training time compared to full-dataset fine-tuning.

Supervised fine-tuning (SFT) is a commonly used technique to adapt large language models (LLMs) to downstream tasks. In practice, SFT on a full dataset is computationally expensive and sometimes suffers from overfitting or bias amplification. This facilitates the rise of data curation in SFT, which prioritizes the most valuable data to optimze. This work studies the online batch selection family that dynamically scores and filters samples during the training process. However, existing popular methods often (i) rely merely on the utility of data to select a subset while neglecting other crucial factors like diversity, (ii) rely on external resources such as reference models or validation sets, and (iii) incur extra training time over full-dataset training. To address these limitations, this work develops \textbf{UDS (Utility-Diversity Sampling)}, a framework for efficient online batch selection in SFT. UDS leverages the nuclear norm of the logits matrix to capture both data utility and intra-sample diversity, while estimating inter-sample diversity through efficient low-dimensional embedding comparisons with a lightweight memory buffer of historical samples. Such a design eliminates the need for external resources and unnecessary backpropagation, securing computational efficiency. Experiments on multiple benchmarks demonstrate that UDS consistently outperforms state-of-the-art online batch selection methods under varying data budgets, and significantly reduces training time compared to full-dataset fine-tuning. Code is available at https://github.com/gfyddha/UDS.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes