Coresets from Trajectories: Selecting Data via Correlation of Loss Differences
Not on the map. Why?
Abstract (arXiv)
Deep learning models achieve state-of-the-art performance across domains but face scalability challenges in real-time or resource-constrained scenarios. To address this, we propose Correlation of Loss Differences (CLD), a simple and scalable metric for coreset selection that identifies the most impactful training samples by measuring their alignment with the loss trajectories of a held-out validation set. CLD is highly efficient, requiring only per-sample loss values computed at training checkpoints, and avoiding the costly gradient and curvature computations used in many existing subset selection methods. We develop a general theoretical framework that establishes convergence guarantees for CLD-based coresets, demonstrating that the convergence error is upper-bounded by the alignment of the selected samples and the representativeness of the validation set. On CIFAR-100 and ImageNet-1k, CLD-based coresets typically outperform or closely match state-of-the-art methods across subset sizes, and remain within 1% of more computationally expensive baselines even when not leading. CLD transfers effectively across architectures (ResNet, VGG, DenseNet), enabling proxy-to-target selection with <1% degradation. Moreover, CLD is stable when using only early checkpoints, incurring negligible accuracy loss. Finally, CLD exhibits inherent bias reduction via per-class validation alignment, obviating the need for additional stratified sampling. Together, these properties make CLD a principled, efficient, stable, and transferable tool for scalable dataset optimization.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 43 of its 55 references that are in the map. First posted on arXiv 27 Aug 2025.
Builds on
43 of 55 references.
References · 43
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
- 2018End-to-End Incremental Learningcited by 597
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 580
- 2019Gradient based sample selection for online continual learningcited by 571
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
- 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 532
31 more
- 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 497
- 2022Dataset Distillation by Matching Training Trajectoriescited by 442
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 339
- 2023TRAK: Attributing Model Behavior at Scalecited by 283
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
- 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 261
- 2020Influence Functions in Deep Learning Are Fragilecited by 252
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
- 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 192
- 2022Datamodels: Predicting Predictions from Training Datacited by 189
- 2018Representer Point Selection for Explaining Deep Neural Networkscited by 187
- 2021Active Learning by Acquiring Contrastive Examplescited by 156
- 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 147
- 2021Scaling Up Influence Functionscited by 132
- 2022Coverage-centric Coreset Selection for High Pruning Ratescited by 117
- 2024Learning Dynamics of LLM Finetuningcited by 95
- 2020Submodular Combinatorial Information Measures with Applications in Machine Learningcited by 88
- 2023D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruningcited by 69
- 2019Data Cleansing for Models Trained with SGDcited by 67
- 2023Large-scale Dataset Pruning with Dynamic Uncertaintycited by 63
- 2021Revisiting Methods for Finding Influential Examplescited by 39
- 2023Spanning Training Progress: Temporal Dual-Depth Scoring (TDDS) for Enhanced Dataset Pruningcited by 38
- 2021Deep Active Learning by Leveraging Training Dynamicscited by 32
- 2021Core-set Sampling for Efficient Neural Architecture Searchcited by 23
- 2025Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertaintycited by 22
- 2016"Influence Sketching": Finding Influential Samples In Large-Scale Regressionscited by 17
- 2022Data Representativity for Machine Learning and AI Systemscited by 15
- 2021Accelerating Neural Architecture Search via Proxy Datacited by 14
- 2023Refined Coreset Selection: Towards Minimal Coreset Size under Model Performance Constraintscited by 13
- 2020Initial Classifier Weights Replay for Memoryless Class Incremental Learningcited by 11
- 2020The Data Representativeness Criterion: Predicting the Performance of Supervised Classification Based on Data Set Similaritycited by 5
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.