Revisiting Residual Networks with Nonlinear Shortcuts

Chaoning Zhang (KAIST), Francois Rameau (KAIST), Seokju Lee (KAIST), Junsik Kim (KAIST), Philipp Benz (KAIST), Dawit Mureja Argaw (KAIST), Jean-Charles Bazin (KAIST), In So Kweon (KAIST)

Abstract
Residual networks (ResNets) with an identity shortcut have been widely used in various computer vision tasks due to their compelling performance and simple design. In this paper we revisit ResNet identity shortcut and propose RGSNets which are based on a new nonlinear ReLU Group Normalization (RG) shortcut, outperforming the existing ResNet by a relatively large margin. Our work is inspired by previous findings that there is a trade-off between representational power and gradient stability in deep networks and that the identity shortcut reduces the representational power. Our proposed nonlinear RG shortcut can contribute to effectively utilizing the representational power of relatively shallow networks and outperform much (3 or 4 times) deeper ResNets, which demonstrates the high efficiency of RG shortcut. Moreover, we have explored variations of RGSNets, and our experimental result shows that Res-RGSNet combining the proposed RG shortcut with the existing identity shortcut achieves the best performance and is robust to network depth. Our code and model will be publicly available.

DOI
10.5244/C.33.152
https://dx.doi.org/10.5244/C.33.152

Files
Paper (PDF)

BibTeX