Differentiable Branching In Deep Networks for Fast Inference
By Simone Scardapane, Danilo Comminiello, Michele Scarpiniti, Enzo Baccarelli, Aurelio Uncini. 2020
32 citations recorded by the source corpus.
In this paper, we consider the design of deep neural networks augmented with multiple auxiliary classifiers departing from the main (backbone) network. These classifiers can be used to perform early-exit from the network at various layers, making them convenient for energy-constrained applications such as IoT, embedded devices, or Fog computing. However, designing an optimized early-exit strategy is a difficult task, generally requiring a large amount of manual fine-tuning. In this paper, we propose a way to jointly optimize this strategy together with the branches, providing an end-to-end trainable algorithm for this emerging class of neural networks. We achieve this by replacing the original output of the branches with a ‘soft’, differentiable approximation. In addition, we also propose a regularization approach to trade-off the computational efficiency of the early-exit strategy with respect to the overall classification accuracy. We evaluate our proposed design approach on a set of image classification benchmarks, showing significant gains in accuracy and inference time.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Model Architectures, Efficiency & Compression
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Simone Scardapane
- Michele Scarpiniti
- Aurelio Uncini
- Enzo Baccarelli
- Jiangpeng He
- Feng Zhu
- Laura Palagi
In Computer Vision and Pattern Recognition
- Michele Scarpiniti
- Enzo Baccarelli
- Simone Scardapane
- Aurelio Uncini
- Feng Zhu
- Jiangpeng He
- Laura Palagi
In Model Architectures
In Efficiency & Compression
Citations in the corpus
- Why Should We Add Early Exits to Neural Networks? (2020, methodology): “Alternatively, the different predictions can be combined to obtain an ensemble almost for free [ 61 ] .”