guest ::
| Home > Publications database > Optimal signal propagation in ResNets through residual scaling |
| Home > Publications database > Optimal signal propagation in ResNets through residual scaling |
| Preprint | FZJ-2023-03175 |
; ;
2023
arXiv
This record in other databases:
Please use a persistent id in citations: doi:10.48550/ARXIV.2305.07715 doi:10.34734/FZJ-2023-03175
Abstract: Residual networks (ResNets) have significantly better trainability and thus performance than feed-forward networks at large depth. Introducing skip connections facilitates signal propagation to deeper layers. In addition, previous works found that adding a scaling parameter for the residual branch further improves generalization performance. While they empirically identified a particularly beneficial range of values for this scaling parameter, the associated performance improvement and its universality across network hyperparameters yet need to be understood. For feed-forward networks (FFNets), finite-size theories have led to important insights with regard to signal propagation and hyperparameter tuning. We here derive a systematic finite-size theory for ResNets to study signal propagation and its dependence on the scaling for the residual branch. We derive analytical expressions for the response function, a measure for the network's sensitivity to inputs, and show that for deep networks the empirically found values for the scaling parameter lie within the range of maximal sensitivity. Furthermore, we obtain an analytical expression for the optimal scaling parameter that depends only weakly on other network hyperparameters, such as the weight variance, thereby explaining its universality across hyperparameters. Overall, this work provides a framework for theory-guided optimal scaling in ResNets and, more generally, provides the theoretical framework to study ResNets at finite widths.
Keyword(s): Disordered Systems and Neural Networks (cond-mat.dis-nn) ; Machine Learning (cs.LG) ; Machine Learning (stat.ML) ; FOS: Physical sciences ; FOS: Computer and information sciences
|
The record appears in these collections: |
PDF
Fulltext