SubZeroCore: A Submodular Approach with Zero Training for Coreset Selection
Not on the map. Why?
Abstract (arXiv)
The goal of coreset selection is to identify representative subsets of datasets for efficient model training. Yet, existing approaches paradoxically require expensive training-based signals, e.g., gradients, decision boundary estimates or forgetting counts, computed over the entire dataset prior to pruning, which undermines their very purpose by requiring training on samples they aim to avoid. We introduce SubZeroCore, a novel, training-free coreset selection method that integrates submodular coverage and density into a single, unified objective. To achieve this, we introduce a sampling strategy based on a closed-form solution to optimally balance these objectives, guided by a single hyperparameter that explicitly controls the desired coverage for local density measures. Despite no training, extensive evaluations show that SubZeroCore matches training-based baselines and significantly outperforms them at high pruning rates, while dramatically reducing computational overhead. SubZeroCore also demonstrates superior robustness to label noise, highlighting its practical effectiveness and scalability for real-world scenarios.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 48 of its 76 references that are in the map. First posted on arXiv 26 Sep 2025.
Builds on
48 of 76 references.
References · 48
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2016Wide Residual Networkscited by 3,070
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
- 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,028
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 675
- 2019Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Boundscited by 610
- 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
36 more
- 2020Reliable Fidelity and Diversity Metrics for Generative Modelscited by 434
- 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 432
- 2020Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamicscited by 425
- 2017Variational Continual Learningcited by 339
- 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 328
- 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
- 2018Dataset Distillationcited by 230
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
- 2022Predictability and Surprise in Large Generative Modelscited by 210
- 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 192
- 2018Adversarial Active Learning for Deep Networks: a Margin Based Approachcited by 158
- 2021Active Learning by Acquiring Contrastive Examplescited by 156
- 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 147
- 2021Online Coreset Selection for Rehearsal-based Continual Learningcited by 117
- 2020Submodular Combinatorial Information Measures with Applications in Machine Learningcited by 88
- 2017Practical Coreset Constructions for Machine Learningcited by 78
- 2021ACAV100M: Automatic Curation of Large-Scale Datasets for Audio-Visual Video Representation Learningcited by 50
- 2013Submodular Optimization with Submodular Cover and Submodular Knapsack Constraintscited by 41
- 2016Importance Sampling for Minibatchescited by 36
- 2024Effective pruning of web-scale datasets based on complexity of concept clusterscited by 34
- 2025A Coreset Selection of Coreset Selection Literature: Introduction and Recent Advancescited by 28
- 2021Accelerating Neural Architecture Search via Proxy Datacited by 14
- 2022Less is More: Proxy Datasets in NAS approachescited by 9
- 2021Submodular Mutual Information for Targeted Data Subset Selectioncited by 8
- 2013Fast Semidifferential-based Submodular Function Optimizationcited by 7
- 2022Adaptive Ranking-based Sample Selection for Weakly Supervised Class-imbalanced Text Classificationcited by 7
- 2023Near-Optimal Quantum Coreset Construction Algorithms for Clusteringcited by 6
- 2024Gradient Coreset for Federated Learningcited by 6
- 2024A Study in Dataset Pruning for Image Super-Resolutioncited by 6
- 2025Unifying Dataset Pruning and Distillation for Efficient Large-scale Compressioncited by 6
- 2022Performance analysis of coreset selection for quantum implementation of K-Means clustering algorithmcited by 5
- 2024Distill the Best, Ignore the Rest: Improving Dataset Distillation with Loss-Value-Based Pruningcited by 5
- 2023Coreset selection can accelerate quantum machine learning models with provable generalizationcited by 4
- 2025A Tight VC-Dimension Analysis of Clustering Coresets with Applicationscited by 4
- 2023ASP: Automatic Selection of Proxy dataset for efficient AutoMLcited by 3
Built on by
Not cited yet.