Pruning Early Exit Networks

Alperen Görmez, Erdem Koyuncu
7/8/2022
cs.LGcs.CVcs.NE

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Deep learning models that perform well often have high computational costs. In this paper, we combine two approaches that try to reduce the computational cost while keeping the model performance high: pruning and early exit networks. We evaluate two approaches of pruning early exit networks: (1) pruning the entire network at once, (2) pruning the base network and additional linear classifiers in an ordered fashion. Experimental results show that pruning the entire network at once is a better strategy in general. However, at high accuracy rates, the two approaches have a similar performance, which implies that the processes of pruning and early exit can be separated without loss of optimality.

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. 1 weaker match is hidden by default — 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{grmez2022pruning,
  title  = {Pruning Early Exit Networks},
  author = {Alperen Görmez and Erdem Koyuncu},
  year   = {2022},
  eprint = {2207.03644},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.03644v1}
}

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

Discussion