Identity Mappings in Deep Residual Networks Identity Mappings in Deep Residual Networks
Paper summary * The authors reevaluate the original residual design of neural networks. * They compare various architectures of residual units and actually find one that works quite a bit better. ### How * The new variation starts the transformation branch of each residual unit with BN and a ReLU. * It removes BN and ReLU after the last convolution. * As a result, the information from previous layers can flow completely unaltered through the shortcut branch of each residual unit. * The image below shows some variations (of the position of BN and ReLU) that they tested. The new and better design is on the right: ![BN and ReLU positions]( "BN and ReLU positions") * They also tried various alternative designs for the shortcut connections. However, all of these designs performed worse than the original one. Only one (d) came close under certain conditions. Therefore, the recommendation is to stick with the old/original design. ![Shortcut designs]( "Shortcut designs") ### Results * Significantly faster training for very deep residual networks (1001 layers). * Better regularization due to the placement of BN. * CIFAR-10 and CIFAR-100 results, old vs. new design: ![Old vs new results]( "Old vs new results")

Summary by Abhishek Das 11 months ago
Your comment:
Summary by Alexander Jung 9 months ago
Your comment: allows researchers to publish paper summaries that are voted on and ranked!

Sponsored by: and