NaN.

Paper Summary: Identity Mappings in Deep Residual Networks

Link to paper: [1603.05027] Identity Mappings in Deep Residual Networks

This is follow-up work to the ResNets paper. It studies the propagation formulations behind the connections of deep residual networks and performs ablation experiments. A residual block can be represented with the equations y_l = h(x_l) + F(x_l, W_l); x_{l+1} = f(y_l). x_l is the input to the l-th unit and x_{l+1} is the output of the l-th unit. In the original ResNets paper, h(x_l) = x_l, f is ReLu, and F consists of 2-3 convolutional layers (bottleneck architecture) with BN and ReLU in between. In this paper, they propose a residual block with both h(x) and f(x) as identity mappings, which trains faster and performs better than their earlier baseline. Main contributions:

- Identity skip connections work much better than other multiplicative interactions that they experiment with:
- Scaling (h(x) = \lambda x): Gradients can explode or vanish depending on whether modulating scalar \lambda > 1 or < 1.
- Gating (1-g(x) for skip connection and g(x) for function F): For gradients to propagate freely, g(x) should approach 1, but F gets suppressed, hence suboptimal. This is similar to highway networks. g(x) is a 1x1 convolutional layer.
- Gating (shortcut-only): Setting high biases pushes initial g(x) towards identity mapping, and test error is much closer to baseline.
- 1x1 convolutional shortcut: These work well for shallower networks (~34 layers), but training error becomes high for deeper networks, probably because they impede gradient propagation.
- Experiments on activations.
- BN after addition messes up information flow, and performs considerably worse.
- ReLU before addition forces the signal to be non-negative, so the signal is monotonically increasing, while ideally a residual function should be free to take values in (-inf, inf).
- BN + ReLU pre-activation works best. This also prevents overfitting, due to BN's regularizing effect. Input signals to all weight layers are normalized.

- Thorough set of experiments to show that identity shortcut connections are easiest for the network to learn. Activation of any deeper unit can be written as the sum of the activation of a shallower unit and a residual function. This also implies that gradients can be directly propagated to shallower units. This is in contrast to usual feedforward networks, where gradients are essentially a series of matrix-vector products, that may vanish, as networks grow deeper.
- Improved accuracies than their previous ResNets paper.

- Residual units are useful and share the same core idea that worked in LSTM units. Even though stacked non-linear layers are capable of asymptotically approximating any arbitrary function, it is clear from recent work that residual functions are much easier to approximate than the complete function. The latest Inception paper also reports that training is accelerated and performance is improved by using identity skip connections across Inception modules.
- It seems like the degradation problem, which serves as motivation for residual units, exists in the first place for non-idempotent activation functions such as sigmoid, hyperbolic tan. This merits further investigation, especially with recent work on function-preserving transformations such as Network Morphism, which expands the Net2Net idea to sigmoid, tanh, by using parameterized activations, initialized to identity mappings.

Read more…(518 words)

About the author:

Abhishek Das

Loading…

Join the discussion. Add a reply…

Post

Table of contents

- Strengths
- Weaknesses / Notes

Ready to join our community?

Sign up below to automatically get notified of new courses, get **reminders** to finish ones you subscribe to, and **bookmark** lessons to read later.

Continue with Facebook

— OR —

Your Full Name

Email address

I have an account. Log in instead

By signing up, you agree to our Terms and our Privacy Policy.

Popular Courses

New Courses

About Us

Get in touch

Copyright 2016-18, Compose Labs Inc. All rights reserved.