PruneFuse: Efficient Data Selection via Weight Pruning and Network Fusion
Not on the map. Why?
Abstract (arXiv)
Efficient data selection is crucial for enhancing the training efficiency of deep neural networks and minimizing annotation requirements. Traditional methods often face high computational costs, limiting their scalability and practical use. We introduce PruneFuse, a novel strategy that leverages pruned networks for data selection and later fuses them with the original network to optimize training. PruneFuse operates in two stages: First, it applies structured pruning to create a smaller pruned network that, due to its structural coherence with the original network, is well-suited for the data selection task. This small network is then trained and selects the most informative samples from the dataset. Second, the trained pruned network is seamlessly fused with the original network. This integration leverages the insights gained during the training of the pruned network to facilitate the learning process of the fused network while leaving room for the network to discover more robust solutions. Extensive experimentation on various datasets demonstrates that PruneFuse significantly reduces computational costs for data selection, achieves better performance than baselines, and accelerates the overall training process.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 44 of its 68 references that are in the map. First posted on arXiv 27 Mar 2026.
Builds on
44 of 68 references.
References · 44
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
- 2014Fully Convolutional Networks for Semantic Segmentationcited by 4,859
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,593
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,499
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2017Revisiting Unreasonable Effectiveness of Data in Deep Learning Eracited by 919
- 2017Deep Bayesian Active Learning with Image Datacited by 819
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
32 more
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2016DoReFa-Net: Training Low Bitwidth Convolutional Neural Networks with Low Bitwidth Gradientscited by 569
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 432
- 2019Dreaming to Distill: Data-free Knowledge Transfer via DeepInversioncited by 423
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 339
- 2023Data Selection for Language Models via Importance Resamplingcited by 329
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
- 2019HAWQ-V2: Hessian Aware trace-Weighted Quantization of Neural Networkscited by 261
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
- 2016Dynamic Network Surgery for Efficient DNNscited by 233
- 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 221
- 2023DepGraph: Towards Any Structural Pruningcited by 203
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 182
- 2020FBNetV2: Differentiable Neural Architecture Search for Spatial and Channel Dimensionscited by 152
- 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
- 2022Coverage-centric Coreset Selection for High Pruning Ratescited by 117
- 2017Deep Active Learning for Named Entity Recognitioncited by 108
- 2024MATES: Model-Aware Data Selection for Efficient Pretraining with Data Influence Modelscited by 100
- 2019Centripetal SGD for Pruning Very Deep Convolutional Networks with Complicated Structurecited by 76
- 2019Pruning from Scratchcited by 72
- 2020Lookahead: A Far-Sighted Alternative of Magnitude-based Pruningcited by 61
- 2016Faster CNNs with Direct Sparse Convolutions and Guided Pruningcited by 39
- 2015Text Understanding from Scratchcited by 25
- 2020Single Shot Structured Pruning Before Trainingcited by 19
- 2016Active and Continuous Exploration with Deep Neural Networks and Expected Model Output Changescited by 18
- 2024Efficient Data Subset Selection to Generalize Training Across Models: Transductive and Inductive Networkscited by 13
- 2025LLM Data Selection and Utilization via Dynamic Bi-level Optimizationcited by 7
Built on by
Not cited yet.