mlsanityData to 7 Oct 2026

Evaluating Sample Utility for Efficient Data Selection by Mimicking Model Weights

arXiv 2501.06708 ↗First posted 12 Jan 2025cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Large-scale web-crawled datasets contain noise, bias, and irrelevant information, necessitating data selection techniques. Existing methods depend on hand-crafted heuristics, downstream datasets, or require expensive influence-based computations -- all of which limit scalability and introduce unwanted data dependencies. To address this, we introduce the Mimic Score, a simple and geometry-based data-quality metric that evaluates utility by measuring alignment between a sample's gradients and a target direction induced by a pre-trained reference model. This leverages readily available model weights, avoids needing validation datasets, and incurs minimal computational overheads. Building on this metric, we propose Grad-Mimic, a two-stage framework that re-weights samples online to accelerate training and aggregates sample utilities offline to construct effective data filters. Empirically, we show that using mimic scores to guide training improves data efficiency, accelerates convergence, yields consistent performance gains across six image datasets, and enhances CLIP models with 20.7% fewer training steps. Additionally, mimic score-based filters augment existing filtering techniques, enabling improved CLIP models trained with 4.7 million fewer samples.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 58 of its 83 references that are in the map. First posted on arXiv 12 Jan 2025.

Builds on

58 of 83 references.

References · 58

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2022LAION-5B: An open large-scale dataset for training next generation image-text modelscited by 4,131
  6. 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,848
  7. 2023Sigmoid Loss for Language Image Pre-Trainingcited by 3,048
  8. 2021CLIPScore: A Reference-free Evaluation Metric for Image Captioningcited by 2,388
  9. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  10. 2013Describing Textures in the Wildcited by 2,110
  11. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
  12. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
38 more
  1. 2022Reproducible scaling laws for contrastive language-image learningcited by 1,163
  2. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
  3. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  4. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
  5. 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 514
  6. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
  7. 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 385
  8. 2023Detecting Pretraining Data from Large Language Modelscited by 375
  9. 2017Snorkel: Rapid Training Data Creation with Weak Supervisioncited by 370
  10. 2023Data Selection for Language Models via Importance Resamplingcited by 322
  11. 2023SemDeDup: Data-efficient learning at web-scale through semantic deduplicationcited by 295
  12. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  13. 2023Data Filtering Networkscited by 247
  14. 2016Data Programming: Creating Large Training Sets, Quicklycited by 246
  15. 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 233
  16. 2024A Survey on Data Selection for Language Modelscited by 230
  17. 2023Proving Test Set Contamination in Black Box Language Modelscited by 227
  18. 2023Interpreting CLIP's Image Representation via Text-Based Decompositioncited by 189
  19. 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 178
  20. 2023Time Travel in LLMs: Tracing Data Contamination in Large Language Modelscited by 175
  21. 2024QuRating: Selecting High-Quality Data for Training Language Modelscited by 153
  22. 2024Rho-1: Not All Tokens Are What You Needcited by 132
  23. 2024Multimodal Autoregressive Pre-training of Large Vision Encoderscited by 108
  24. 2018Training Complex Models with Multi-Task Weak Supervisioncited by 106
  25. 2024Data-efficient Fine-tuning for LLM-based Recommendationcited by 103
  26. 2020Fast and Three-rious: Speeding Up Weak Supervision with Triplet Methodscited by 98
  27. 2024MATES: Model-Aware Data Selection for Efficient Pretraining with Data Influence Modelscited by 96
  28. 2023DoGE: Domain Reweighting with Generalization Estimationcited by 87
  29. 2022What do Vision Transformers Learn? A Visual Explorationcited by 75
  30. 2024A Survey of Multimodal Large Language Model from A Data-centric Perspectivecited by 73
  31. 2024Improving Pretraining Data Using Perplexity Correlationscited by 46
  32. 2018Model-based Pricing for Machine Learning in a Data Marketplacecited by 37
  33. 2023Self-Influence Guided Data Reweighting for Language Model Pre-trainingcited by 37
  34. 2024Aioli: A Unified Optimization Framework for Language Model Data Mixingcited by 33
  35. 2024ICONS: Influence Consensus for Vision-Language Data Selectioncited by 28
  36. 2021Universalizing Weak Supervisioncited by 27
  37. 2024Automated Data Curation for Robust Language Model Fine-Tuningcited by 27
  38. 2024CLIPLoss and Norm-Based Data Selection Methods for Multimodal Contrastive Learningcited by 20

50 most cited of 58 All 58 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.