ELSA: Partial Weight Freezing for Overhead-Free Sparse Network Deployment

Paniz Halvachi, Alexandra Peste, Dan Alistarh, Christoph H. Lampert
12/11/2023
cs.LG

No confident code implementation found for this paper.

Abstract

We present ELSA, a practical solution for creating deep networks that can easily be deployed at different levels of sparsity. The core idea is to embed one or more sparse networks within a single dense network as a proper subset of the weights. At prediction time, any sparse model can be extracted effortlessly simply be zeroing out weights according to a predefined mask. ELSA is simple, powerful and highly flexible. It can use essentially any existing technique for network sparsification and network training. In particular, it does not restrict the loss function, architecture or the optimization technique. Our experiments show that ELSA's advantages of flexible deployment comes with no or just a negligible reduction in prediction quality compared to the standard way of using multiple sparse networks that are trained and stored independently.

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{halvachi2023elsa,
  title  = {ELSA: Partial Weight Freezing for Overhead-Free Sparse Network Deployment},
  author = {Paniz Halvachi and Alexandra Peste and Dan Alistarh and Christoph H. Lampert},
  year   = {2023},
  eprint = {2312.06872},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.06872v2}
}

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

Discussion