Finding the Muses: Identifying Coresets through Loss Trajectories
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 Loss Trajectory Correlation (LTC), a novel metric for coreset selection that identifies critical training samples driving generalization. LTC quantifies the alignment between training sample loss trajectories and validation set loss trajectories, enabling the construction of compact, representative subsets. Unlike traditional methods with computational and storage overheads that are infeasible to scale to large datasets, LTC achieves superior efficiency as it can be computed as a byproduct of training. Our results on CIFAR-100 and ImageNet-1k show that LTC consistently achieves accuracy on par with or surpassing state-of-the-art coreset selection methods, with any differences remaining under 1%. LTC also effectively transfers across various architectures, including ResNet, VGG, DenseNet, and Swin Transformer, with minimal performance degradation (<2%). Additionally, LTC offers insights into training dynamics, such as identifying aligned and conflicting sample behaviors, at a fraction of the computational cost of traditional methods. This framework paves the way for scalable coreset selection and efficient dataset optimization.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 48 references that are in the map. First posted on arXiv 12 Mar 2025.
Builds on
29 of 48 references.
References · 29
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
- 2018End-to-End Incremental Learningcited by 596
- 2019Gradient based sample selection for online continual learningcited by 568
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
- 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 492
- 2022Dataset Distillation by Matching Training Trajectoriescited by 437
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 337
17 more
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
- 2020Influence Functions in Deep Learning Are Fragilecited by 247
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
- 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 191
- 2022Datamodels: Predicting Predictions from Training Datacited by 186
- 2021Active Learning by Acquiring Contrastive Examplescited by 154
- 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 146
- 2021Scaling Up Influence Functionscited by 130
- 2023D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruningcited by 68
- 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
- 2021Core-set Sampling for Efficient Neural Architecture Searchcited by 23
- 2016"Influence Sketching": Finding Influential Samples In Large-Scale Regressionscited by 17
- 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
Built on by
Citing papers per year: 2026: 1.
1 paper.