mlsanityData to 7 Oct 2026

Towards Sustainable Learning: Coresets for Data-efficient Deep Learning

arXiv 2306.01244 ↗First posted 2 Jun 2023cs.LGcited by 44

Not on the map. Why?

Abstract (arXiv)

To improve the efficiency and sustainability of learning deep models, we propose CREST, the first scalable framework with rigorous theoretical guarantees to identify the most valuable examples for training non-convex models, particularly deep networks. To guarantee convergence to a stationary point of a non-convex function, CREST models the non-convex loss as a series of quadratic functions and extracts a coreset for each quadratic sub-region. In addition, to ensure faster convergence of stochastic gradient methods such as (mini-batch) SGD, CREST iteratively extracts multiple mini-batch coresets from larger random subsets of training data, to ensure nearly-unbiased gradients with small variances. Finally, to further improve scalability and efficiency, CREST identifies and excludes the examples that are learned from the coreset selection pipeline. Our extensive experiments on several deep networks trained on vision and NLP datasets, including CIFAR-10, CIFAR-100, TinyImageNet, and SNLI, confirm that CREST speeds up training deep networks on very large datasets, by 1.7x to 2.5x with minimum loss in the performance. By analyzing the learning difficulty of the subsets selected by CREST, we show that deep models benefit the most by learning from subsets of increasing difficulty levels.

Key facts. Cited by 44 papers in the map (data through 7 Oct 2026). Builds on 28 of its 40 references that are in the map. First posted on arXiv 2 Jun 2023.

Builds on

28 of 40 references.

References · 28

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  4. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  5. 2015A large annotated corpus for learning natural language inferencecited by 1,837
  6. 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,242
  7. 2021Scaling Vision Transformerscited by 993
  8. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
  9. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
  10. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
  11. 2019Green AIcited by 620
  12. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
16 more
  1. 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 337
  2. 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 323
  3. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  4. 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 233
  5. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
  6. 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 201
  7. 2015Online Batch Selection for Faster Training of Neural Networkscited by 121
  8. 2015Variance Reduction in SGD by Distributed Importance Samplingcited by 79
  9. 2022Adaptive Second Order Coresets for Data-efficient Machine Learningcited by 60
  10. 2018On the Ineffectiveness of Variance Reduced Optimization for Deep Learningcited by 48
  11. 2019Semantic Redundancies in Image-Classification Datasets: The 10% You Don't Needcited by 43
  12. 2017Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian Informationcited by 41
  13. 2016Exact and Inexact Subsampled Newton Methods for Optimizationcited by 38
  14. 2019The importance of better models in stochastic optimizationcited by 32
  15. 2018Inexact Non-Convex Newton-Type Methodscited by 11
  16. 2017Stochastic Nonconvex Optimization with Large Minibatchescited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 5; 2024: 13; 2025: 17; 2026: 9.

44 papers.

Sort:

  1. 2024SmallToLarge (S2L): Scalable Data Selection for Fine-tuning Large Language Models by Summarizing Training Trajectories of Small Modelscited by 43
  2. 2023Spanning Training Progress: Temporal Dual-Depth Scoring (TDDS) for Enhanced Dataset Pruningcited by 38
  3. 2025A Coreset Selection of Coreset Selection Literature: Introduction and Recent Advancescited by 28
  4. 2024A CLIP-Powered Framework for Robust and Generalizable Data Selectioncited by 20
  5. 2025Model Predictive Task Sampling for Efficient and Robust Adaptationcited by 20
  6. 2024Data-Efficient Contrastive Language-Image Pretraining: Prioritizing Data Quality over Quantitycited by 19
  7. 2023Data Distillation Can Be Like Vodka: Distilling More Times For Better Qualitycited by 17
  8. 2024Mini-batch Coresets for Memory-efficient Language Model Training on Data Mixturescited by 12
  9. 2023Selectivity Drives Productivity: Efficient Dataset Pruning for Enhanced Transfer Learningcited by 11
  10. 2024BWS: Best Window Selection Based on Sample Scores for Data Pruning across Broad Rangescited by 8
  11. 2024Evolution-aware VAriance (EVA) Coreset Selection for Medical Image Classificationcited by 7
  12. 2024Influential Language Data Selection via Gradient Trajectory Pursuitcited by 7
32 more
  1. 2023Data Optimization in Deep Learning: A Surveycited by 6
  2. 2024Dataset Distillation via Knowledge Distillation: Towards Efficient Self-Supervised Pre-Training of Deep Networkscited by 6
  3. 2025When Dynamic Data Selection Meets Data Augmentationcited by 6
  4. 2025Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learningcited by 5
  5. 2025Subsampling Graphs with GNN Performance Guaranteescited by 4
  6. 2025Ferret: An Efficient Online Continual Learning Framework under Varying Memory Constraintscited by 4
  7. 2025Poisoning Bayesian Inference via Data Deletion and Replicationcited by 3
  8. 2024Data-Efficient and Robust Task Selection for Meta-Learningcited by 2
  9. 2024A framework for measuring the training efficiency of a neural architecturecited by 2
  10. 2026UniPROT: Uniform Prototype Selection via Partial Optimal Transport with Submodular Guaranteescited by 2
  11. 2023KAKURENBO: Adaptively Hiding Samples in Deep Neural Network Trainingcited by 1
  12. 2026GRACE: A Dynamic Coreset Selection Framework for Large Language Model Optimizationcited by 1
  13. 2026Provable Pruning for Efficient 3D Gaussian Splatting via Coresetscited by 1
  14. 2024Diverse Subset Selection via Norm-Based Sampling and Orthogonalitycited by 0
  15. 2024Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimizationcited by 0
  16. 2024Federated Learning with Workload Reduction through Partial Training of Client Models and Entropy-Based Data Selectioncited by 0
  17. 2025Data Efficient Subset Training with Differential Privacycited by 0
  18. 2025PEAKS: Selecting Key Training Examples Incrementally via Prediction Error Anchored by Kernel Similaritycited by 0
  19. 2025BenchMake: Turn any scientific data set into a reproducible benchmarkcited by 0
  20. 2025Coreset selection based on Intra-class diversitycited by 0
  21. 2025Spatio-temporal Multivariate Time Series Forecast with Chosen Variablescited by 0
  22. 2025Data Efficiency and Transfer Robustness in Biomedical Image Segmentation: A Study of Redundancy and Forgetting with Cellposecited by 0
  23. 2025Diffusion Reconstruction-based Data Likelihood Estimation for Core-Set Selectioncited by 0
  24. 2025Efficient Hyperparameter Search for Non-Stationary Model Trainingcited by 0
  25. 2025DiRe: Diversity-promoting Regularization for Dataset Condensationcited by 0
  26. 2025MODE: Multi-Objective Adaptive Coreset Selectioncited by 0
  27. 2026Efficient Content-based Recommendation Model Training via Noise-aware Coreset Selectioncited by 0
  28. 2026Position: Stop Preaching and Start Practising Data Frugality for Responsible Development of AIcited by 0
  29. 2026Data Agent: Learning to Select Data via End-to-End Dynamic Optimizationcited by 0
  30. 2026Beyond What to Select: A Plug-and-play Oscillatory Data-Volume Scheduling for Efficient Model Trainingcited by 0
  31. 2026NodeImport: Imbalanced Node Classification with Node Importance Assessmentcited by 0
  32. 2026Every Batch Is Its Own Validation Set: Leave-One-Out Gradient Matching for Online Data Selection in LLM Fine-Tuningcited by 0