On an Interpretation of ResNets via Solution Constructions
Changcun Huang

TL;DR
This paper provides a theoretical interpretation of ResNet architectures through solution constructions, explaining their performance mechanism and proving their universal approximation capability.
Contribution
It introduces a novel solution-based interpretation of ResNets and demonstrates their universal approximation property.
Findings
ResNet solutions can be constructed via gate-network controls.
The interpretation explains ResNet's performance mechanism.
ResNets are proven to have universal approximation capabilities.
Abstract
This paper first constructs a typical solution of ResNets for multi-category classifications by the principle of gate-network controls and deep-layer classifications, from which a general interpretation of the ResNet architecture is given and the performance mechanism is explained. We then use more solutions to further demonstrate the generality of that interpretation. The universal-approximation capability of ResNets is proved.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Fault Detection and Control Systems
Methods*Communicated@Fast*How Do I Communicate to Expedia? · 1x1 Convolution · Batch Normalization · Max Pooling · Residual Connection · Residual Block · Bottleneck Residual Block · Kaiming Initialization · Average Pooling · Convolution
