LGAIDBMay 12, 2025

LEAD: Iterative Data Selection for Efficient LLM Instruction Tuning

arXiv:2505.07437v116 citationsh-index: 56Has Code
Originality Highly original
AI Analysis

This addresses a bottleneck in efficient LLM training for researchers and practitioners, offering a significant speedup and data reduction over existing methods.

The paper tackles the computational inefficiency of iterative data selection for LLM instruction tuning by proposing LEAD, a framework that eliminates costly additional model inference, achieving a 6.1%-10.8% performance improvement with only 2.5% of training data and 5-10x faster training.

Instruction tuning has emerged as a critical paradigm for improving the capabilities and alignment of large language models (LLMs). However, existing iterative model-aware data selection methods incur significant computational overhead, as they rely on repeatedly performing full-dataset model inference to estimate sample utility for subsequent training iterations, creating a fundamental efficiency bottleneck. In this paper, we propose LEAD, an efficient iterative data selection framework that accurately estimates sample utility entirely within the standard training loop, eliminating the need for costly additional model inference. At its core, LEAD introduces Instance-Level Dynamic Uncertainty (IDU), a theoretically grounded utility function combining instantaneous training loss, gradient-based approximation of loss changes, and exponential smoothing of historical loss signals. To further scale efficiently to large datasets, LEAD employs a two-stage, coarse-to-fine selection strategy, adaptively prioritizing informative clusters through a multi-armed bandit mechanism, followed by precise fine-grained selection of high-utility samples using IDU. Extensive experiments across four diverse benchmarks show that LEAD significantly outperforms state-of-the-art methods, improving average model performance by 6.1%-10.8% while using only 2.5% of the training data and reducing overall training time by 5-10x.

Code Implementations1 repo
Foundations

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

Your Notes