Explore and Establish Synergistic Effects Between Weight Pruning and Coreset Selection in Neural Network Training
Not on the map. Why?
Abstract (arXiv)
Modern deep neural networks rely heavily on massive model weights and training samples, incurring substantial computational costs. Weight pruning and coreset selection are two emerging paradigms proposed to improve computational efficiency. In this paper, we first explore the interplay between redundant weights and training samples through a transparent analysis: redundant samples, particularly noisy ones, cause model weights to become unnecessarily overtuned to fit them, complicating the identification of irrelevant weights during pruning; conversely, irrelevant weights tend to overfit noisy data, undermining coreset selection effectiveness. To further investigate and harness this interplay in deep learning, we develop a Simultaneous Weight and Sample Tailoring mechanism (SWaST) that alternately performs weight pruning and coreset selection to establish a synergistic effect in training. During this investigation, we observe that when simultaneously removing a large number of weights and samples, a phenomenon we term critical double-loss can occur, where important weights and their supportive samples are mistakenly eliminated at the same time, leading to model instability and nearly irreversible degradation that cannot be recovered in subsequent training. Unlike classic machine learning models, this issue can arise in deep learning due to the lack of theoretical guarantees on the correctness of weight pruning and coreset selection, which explains why these paradigms are often developed independently. We mitigate this by integrating a state preservation mechanism into SWaST, enabling stable joint optimization. Extensive experiments reveal a strong synergy between pruning and coreset selection across varying prune rates and coreset sizes, delivering accuracy boosts of up to 17.83% alongside 10% to 90% FLOPs reductions.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 32 of its 48 references that are in the map. First posted on arXiv 13 Nov 2025.
Builds on
32 of 48 references.
References · 32
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,315
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,257
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,017
- 2016Pruning Filters for Efficient ConvNetscited by 1,138
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 809
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 675
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 574
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 572
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 532
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 525
- 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 518
20 more
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 493
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 476
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
- 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 191
- 2022Datamodels: Predicting Predictions from Training Datacited by 187
- 2016A Kronecker-factored approximate Fisher matrix for convolution layerscited by 141
- 2024DsDm: Model-Aware Dataset Selection with Datamodelscited by 103
- 2016Training Sparse Neural Networkscited by 73
- 2021Effective Sparsification of Neural Networks with Global Sparsity Constraintcited by 45
- 2023Self-Influence Guided Data Reweighting for Language Model Pre-trainingcited by 37
- 2021SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruningcited by 30
- 2020DAIS: Automatic Channel Pruning via Differentiable Annealing Indicator Searchcited by 21
- 2023Robust Data Pruning under Label Noise via Maximizing Re-labeling Accuracycited by 20
- 2016Simultaneous Safe Screening of Features and Samples in Doubly Sparse Modelingcited by 17
- 2021A Probabilistic Approach to Neural Network Pruningcited by 15
- 2023GIO: Gradient Information Optimization for Training Dataset Selectioncited by 13
- 2015Auto-Sizing Neural Networks: With Applications to n-gram Language Modelscited by 9
- 2016Scaling Up Sparse Support Vector Machines by Simultaneous Feature and Sample Reductioncited by 5
Built on by
Not cited yet.