mlsanityData to 14 Oct 2026

GIO: Gradient Information Optimization for Training Dataset Selection

arXiv 2306.11670 ↗First posted 20 Jun 2023cs.LG cs.AIcited by 13

Not on the map. Why?

Abstract (arXiv)

It is often advantageous to train models on a subset of the available train examples, because the examples are of variable quality or because one would like to train with fewer examples, without sacrificing performance. We present Gradient Information Optimization (GIO), a scalable, task-agnostic approach to this data selection problem that requires only a small set of (unlabeled) examples representing a target distribution. GIO begins from a natural, information-theoretic objective that is intractable in practice. Our contribution is in showing that it can be made highly scalable through a simple relaxation of the objective and a highly efficient implementation. In experiments with machine translation, spelling correction, and image recognition, we show that GIO delivers outstanding results with very small train sets. These findings are robust to different representation models and hyperparameters for GIO itself. GIO is task- and domain-agnostic and can be applied out-of-the-box to new datasets and domains. We open source a pip-installable implementation of the algorithm as "pip install grad-info-opt".

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 26 of its 49 references that are in the map. First posted on arXiv 20 Jun 2023.

Builds on

26 of 49 references.

References · 26

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  4. 2020Language Models are Few-Shot Learnerscited by 32,419
  5. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,893
  6. 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
  7. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
  8. 2017Billion-scale similarity search with GPUscited by 2,497
  9. 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,488
  10. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,463
  11. 2020MPNet: Masked and Permuted Pre-training for Language Understandingcited by 981
  12. 2017Deep Bayesian Active Learning with Image Datacited by 819
14 more
  1. 2019CCNet: Extracting High Quality Monolingual Datasets from Web Crawl Datacited by 548
  2. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
  3. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
  4. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 476
  5. 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 432
  6. 2023Data Selection for Language Models via Importance Resamplingcited by 329
  7. 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 133
  8. 2021The Perils of Using Mechanical Turk to Evaluate Open-Ended Text Generationcited by 97
  9. 2021What's in the Box? A Preliminary Analysis of Undesirable Content in the Common Crawl Corpuscited by 80
  10. 2019Scalable and Generalizable Social Bot Detection through Data Selectioncited by 59
  11. 2021NLP From Scratch Without Large-Scale Pretraining: A Simple and Efficient Frameworkcited by 34
  12. 2020NeuSpell: A Neural Spelling Correction Toolkitcited by 32
  13. 2017Spelling Correction as a Foreign Languagecited by 7
  14. 2019Impact of Data Pruning on Machine Learning Algorithm Performancecited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 4; 2025: 7; 2026: 2.

13 papers.

Sort:

By area: