Pruning-based Data Selection and Network Fusion for Efficient Deep Learning

Humaira Kousar, Hasnain Irshad Bhatti, Jaekyun Moon
1/2/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Efficient data selection is essential for improving the training efficiency of deep neural networks and reducing the associated annotation costs. However, traditional methods tend to be computationally expensive, limiting their scalability and real-world applicability. We introduce PruneFuse, a novel method that combines pruning and network fusion to enhance data selection and accelerate network training. In PruneFuse, the original dense network is pruned to generate a smaller surrogate model that efficiently selects the most informative samples from the dataset. Once this iterative data selection selects sufficient samples, the insights learned from the pruned model are seamlessly integrated with the dense model through network fusion, providing an optimized initialization that accelerates training. 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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kousar2025pruningbased,
  title  = {Pruning-based Data Selection and Network Fusion for Efficient Deep Learning},
  author = {Humaira Kousar and Hasnain Irshad Bhatti and Jaekyun Moon},
  year   = {2025},
  eprint = {2501.01118},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.01118v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.01118.svg)](https://codeofpaper.com/paper/2501.01118)

Discussion