GRAFT: Gradient-Aware Fast MaxVol Technique for Dynamic Data Sampling

Ashish Jha, Anh huy Phan, Razan Dibo, Valentin Leplat
8/19/2025
cs.LGcs.AImath.NA

No official code found. Best implementation: ashishjv1/GRAFT (8 stars, MIT, last commit 2025-09-25).

Abstract

Training modern neural networks on large datasets is computationally and environmentally costly. We introduce GRAFT, a scalable in-training subset selection method that (i) extracts a low-rank feature representation for each batch, (ii) applies a Fast MaxVol sampler to select a small, diverse subset that spans the batch's dominant subspace, and (iii) dynamically adjusts the subset size using a gradient-approximation criterion. By operating in low-rank subspaces and training on carefully chosen examples instead of full batches, GRAFT preserves the training trajectory while reducing wall-clock time, energy consumption, and $\mathrm{CO}_2$ emissions. Across multiple benchmarks, GRAFT matches or exceeds recent selection baselines in both accuracy and efficiency, providing a favorable trade-off between accuracy, efficiency, and emissions.

View on arXivView PDF

Code Implementations(1)

ashishjv1/GRAFTCommunity62%
MIT

This is the code implementation of the paper GRAFT: Gradient-Aware Fast MaxVol technique for Dynamic Data Sampling

80PythonMay 26, 20251 years agoMIT

Similar Papers

Cite this paper

@article{jha2025graft,
  title  = {GRAFT: Gradient-Aware Fast MaxVol Technique for Dynamic Data Sampling},
  author = {Ashish Jha and Anh huy Phan and Razan Dibo and Valentin Leplat},
  year   = {2025},
  eprint = {2508.13653},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.13653v2}
}

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

Discussion