Efficient Data Selection at Scale via Influence Distillation

Mahdi Nikdan, Vincent Cohen-Addad, Dan Alistarh, Vahab Mirrokni
5/25/2025
cs.CLcs.LG

No official code found. Best implementation: IST-DASLab/influence_distillation (3 stars, last commit 2025-05-29).

Abstract

Effective data selection is critical for efficient training of modern Large Language Models (LLMs). This paper introduces Influence Distillation, a novel, mathematically-justified framework for data selection that employs second-order information to optimally weight training samples. By distilling each sample's influence on a target distribution, our method assigns model-specific weights that are used to select training data for LLM fine-tuning, guiding it toward strong performance on the target domain. We derive these optimal weights for both Gradient Descent and Adam optimizers. To ensure scalability and reduce computational cost, we propose a $\textit{landmark-based approximation}$: influence is precisely computed for a small subset of "landmark" samples and then efficiently propagated to all other samples to determine their weights. We validate Influence Distillation by applying it to instruction tuning on the Tulu V2 dataset, targeting a range of tasks including GSM8k, SQuAD, and MMLU, across several models from the Llama and Qwen families. Experiments show that Influence Distillation matches or outperforms state-of-the-art performance while achieving up to $3.5\times$ faster selection.

View on arXivView PDF

Code Implementations(1)

Official implementation of Influence Distillation: https://www.arxiv.org/abs/2505.19051

30PythonMay 29, 20251 years ago

Similar Papers

Cite this paper

@article{nikdan2025efficient,
  title  = {Efficient Data Selection at Scale via Influence Distillation},
  author = {Mahdi Nikdan and Vincent Cohen-Addad and Dan Alistarh and Vahab Mirrokni},
  year   = {2025},
  eprint = {2505.19051},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.19051v1}
}

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/2505.19051.svg)](https://codeofpaper.com/paper/2505.19051)

Discussion