Distilled Pruning: Using Synthetic Data to Win the Lottery

Luke McDermott, Daniel Cummings
7/7/2023
cs.LG

No confident code implementation found for this paper.

Abstract

This work introduces a novel approach to pruning deep learning models by using distilled data. Unlike conventional strategies which primarily focus on architectural or algorithmic optimization, our method reconsiders the role of data in these scenarios. Distilled datasets capture essential patterns from larger datasets, and we demonstrate how to leverage this capability to enable a computationally efficient pruning process. Our approach can find sparse, trainable subnetworks (a.k.a. Lottery Tickets) up to 5x faster than Iterative Magnitude Pruning at comparable sparsity on CIFAR-10. The experimental results highlight the potential of using distilled data for resource-efficient neural network pruning, model compression, and neural architecture search.

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{mcdermott2023distilled,
  title  = {Distilled Pruning: Using Synthetic Data to Win the Lottery},
  author = {Luke McDermott and Daniel Cummings},
  year   = {2023},
  eprint = {2307.03364},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.03364v3}
}

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/2307.03364.svg)](https://codeofpaper.com/paper/2307.03364)

Discussion