Efficient Training of Deep Networks using Guided Spectral Data Selection: A Step Toward Learning What You Need
Not on the map. Why?
Abstract (arXiv)
Effective data curation is essential for optimizing neural network training. In this paper, we present the Guided Spectrally Tuned Data Selection (GSTDS) algorithm, which dynamically adjusts the subset of data points used for training using an off-the-shelf pre-trained reference model. Based on a pre-scheduled filtering ratio, GSTDS effectively reduces the number of data points processed per batch. The proposed method ensures an efficient selection of the most informative data points for training while avoiding redundant or less beneficial computations. Preserving data points in each batch is performed based on spectral analysis. A Fiedler vector-based scoring mechanism removes the filtered portion of the batch, lightening the resource requirements of the learning. The proposed data selection approach not only streamlines the training process but also promotes improved generalization and accuracy. Extensive experiments on standard image classification benchmarks, including CIFAR-10, Oxford-IIIT Pet, and Oxford-Flowers, demonstrate that GSTDS outperforms standard training scenarios and JEST, a recent state-of-the-art data curation method, on several key factors. It is shown that GSTDS achieves notable reductions in computational requirements, up to four times, without compromising performance. GSTDS exhibits a considerable growth in terms of accuracy under the limited computational resource usage, in contrast to other methodologies. These promising results underscore the potential of spectral-based data selection as a scalable solution for resource-efficient deep learning and motivate further exploration into adaptive data curation strategies. You can find the code at https://github.com/rezasharifi82/GSTDS.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 38 of its 76 references that are in the map. First posted on arXiv 6 Jul 2025.
Builds on
38 of 76 references.
References · 38
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,864
- 2016SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model sizecited by 1,060
- 2017Revisiting Unreasonable Effectiveness of Data in Deep Learning Eracited by 919
- 2017Deep Bayesian Active Learning with Image Datacited by 819
26 more
- 2021MedMNIST v2 -- A large-scale lightweight benchmark for 2D and 3D biomedical image classificationcited by 690
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 339
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 320
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
- 2021Curriculum Learning: A Surveycited by 259
- 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 133
- 2022Coverage-centric Coreset Selection for High Pruning Ratescited by 117
- 2018SpectralNet: Spectral Clustering using Deep Neural Networkscited by 94
- 2019Dynamic Curriculum Learning for Imbalanced Data Classificationcited by 93
- 2024How to Train Data-Efficient LLMscited by 93
- 2021SIMILAR: Submodular Information Measures Based Active Learning In Realistic Scenarioscited by 84
- 2021RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learningcited by 74
- 2023Large-scale Dataset Pruning with Dynamic Uncertaintycited by 63
- 2021PRISM: A Rich Class of Parameterized Submodular Information Measures for Guided Subset Selectioncited by 51
- 2016Importance Sampling for Minibatchescited by 36
- 2024Data curation via joint example selection further accelerates multimodal learningcited by 33
- 2016Faster Eigenvector Computation via Shift-and-Invert Preconditioningcited by 18
- 2022BERT on a Data Diet: Finding Important Examples by Gradient-Based Pruningcited by 17
- 2024Distilling the Knowledge in Data Pruningcited by 11
- 2024AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methodscited by 8
- 2025Training-Free Dataset Pruning for Instance Segmentationcited by 7
- 2025Efficient Self-Supervised Learning for Earth Observation via Dynamic Dataset Curationcited by 7
- 2023Randomized Greedy Algorithms and Composable Coreset for k-Center Clustering with Outlierscited by 1
Built on by
Not cited yet.