Residual neural network

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Canonical form of a residual neural network. A layer   − 1 is skipped over activation from  − 2.

A residual neural network is an artificial neural network (ANN) of a kind that builds on constructs known from pyramidal cells in the cerebral cortex[citation needed]. Residual neural networks do this by utilizing skip connections or short-cuts to jump over some layers. In its limit as ResNets it will only skip over a single layer.[1] With an additional weight matrix to learn the skip weights it is referred to as HighwayNets.[2] With several parallel skips it is referred to as DenseNets.[3] In comparison, a non-residual neural network is described as a plain network in the context of residual neural networks.

A reconstruction of a pyramidal cell. Soma and dendrites are labeled in red, axon arbor in blue. (1) Soma, (2) Basal dendrite, (3) Apical dendrite, (4) Axon, (5) Collateral axon.

The brain has structures similar to residual nets, as cortical layer VI neurons gets input from layer I, skipping over all intermediary layers[citation needed]. In the figure (below, on the right), this compares to signals from the (3) apical dendrite skipping over layers, while the (2) basal dendrite collecting signals from the previous and/or same layer.[note 1][4] Similar structures exists for other layers.[5] How many layers in the cerebral cortex compare to layers in an artificial neural network is not clear, neither if every area in cerebral cortex exhibits the same structure, but over large areas they look quite similar.

One motivation for skipping over layers in ANNs is to avoid the problem of vanishing gradients by reusing activations from a previous layer until the layer next to the current one have learned its weights. During training the weights will adapt to mute the previous layer and amplify the layer next to the current. In the simplest case only the weights for the connection to the next to the current layer is adapted, with no explicit weights for the upstream previous layer. This usually works properly when a single non-linear layer is stepped over, or in the case when the intermediate layers are all linear. If not, then an explicit weight matrix should be learned for the skipped connection.

The intuition on why this works is that the neural network collapses into fewer layers in the initial phase, which makes it easier to learn, and thus gradually expands the layers as it learns more of the feature space. During later learning, when all layers are expanded, it will stay closer to the manifold and thus learn faster. A neural network without residual parts will explore more of the feature space. This makes it more vulnerable to small perturbations that cause it to leave the manifold altogether, and require extra training data to get back on track.

Forward propagation[edit]

For single skips, the layers may be indexed either as to or as to . (Script used for clarity, usually it is written as a simple l.) The two indexing systems are convenient when describing skips as going backward or forward. As signal flows forward through the network it is easier to describe the skip as from a given layer, but as a learning rule (back propagation) it is easier to describe which activation layer you reuse as , where is the skip number.

If there is a weight matrix for connection weights from layer to , and a weight matrix for connection weights from layer to , then the forward propagation through the activation function would be (aka HighwayNets)

where we have

the activations (outputs) of neurons in layer ,
the activation function for layer ,
the weight matrix for neurons between layer and , and

If there is no explicit matrix (aka ResNets), then the forward propagation through the activation function simplifies to

Another way to formulate this is to substitute an identity matrix for , but that is only valid when the dimensions match. This is somewhat confusingly called an identity block, which means that the activations from layer are passed to layer without a weight matrix.

In the cerebral cortex such forward skips are done for several layers. Usually all forward skips start from the same layer, and successively connect to later layers. In the general case this will be expressed as (aka DenseNets)

Backward propagation[edit]

During backpropagation learning for the normal path

and for the skip paths (note that they are close to identical)

In both cases we have

a learning rate (,
the error signal of neurons at layer , and
the activation of neurons at layer

If the skip path has fixed weights (e.g. the identity matrix, see above), then they will not be updated. If they can be updated, then the rule will be an ordinary backprop update rule.

In the general case there can be skip path weight matrices, thus

As the learning rules are similar the weight matrices can be merged and learned in the same step.

See also[edit]


  1. ^ Some research indicates that there are additional structures here, so this explanation is somewhat simplified.

like Bridged Multilayer Perceptron?


  1. ^ He, Kaiming; Zhang, Xiangyu; Ren, Shaoqing; Sun, Jian (2015-12-10). "Deep Residual Learning for Image Recognition". arXiv:1512.03385 [cs.CV].
  2. ^ Srivastava, Rupesh Kumar; Greff, Klaus; Schmidhuber, Jürgen (2015-05-02). "Highway Networks". arXiv:1505.00387 [cs.LG].
  3. ^ Huang, Gao; Liu, Zhuang; Weinberger, Kilian Q.; van der Maaten, Laurens (2016-08-24). "Densely Connected Convolutional Networks". arXiv:1608.06993 [cs.CV].
  4. ^ Winterer, Jochen; Maier, Nikolaus; Wozny, Christian; Beed, Prateep; Breustedt, Jörg; Evangelista, Roberta; Peng, Yangfan; D’Albis, Tiziano; Kempter, Richard (2017). "Excitatory Microcircuits within Superficial Layers of the Medial Entorhinal Cortex". Cell Reports. 19 (6): 1110–1116. doi:10.1016/j.celrep.2017.04.041. PMID 28494861.
  5. ^ Fitzpatrick, David (1996-05-01). "The Functional Organization of Local Circuits in Visual Cortex: Insights from the Study of Tree Shrew Striate Cortex". Cerebral Cortex. 6 (3): 329–341. doi:10.1093/cercor/6.3.329. ISSN 1047-3211.