资源论文ON THE GLOBAL CONVERGENCE OF TRAIN -ING DEEP LINEAR RES NETS

ON THE GLOBAL CONVERGENCE OF TRAIN -ING DEEP LINEAR RES NETS

2020-01-02 | |  124 |   54 |   0

Abstract

We study the convergence of gradient descent (GD) and stochastic gradient descent (SGD) for training L-hidden-layer linear residual networks (ResNets). We prove that for training deep residual networks with certain linear transformations at input and output layers, which are fixed throughout training, both GD and SGD with zero initialization on all hidden weights can converge to the global minimum of the training loss. Moreover, when specializing to appropriate Gaussian random linear transformations, GD and SGD provably optimize wide enough deep linear ResNets. Compared with the global convergence result of GD for training standard deep linear networks (Du & Hu, 2019), our condition on the neural network width is sharper by a factor of 图片.png, where 图片.pngdenotes the condition number of the covariance matrix of the training data. We further propose a modified identity input and output transformations, and show that a 图片.png-wide neural network is sufficient to guarantee the global convergence of GD/SGD, where d, k are the input and output dimensions respectively.

上一篇:NOVELTY DETECTION VIA BLURRING

下一篇:STATE -ONLY IMITATION WITH TRANSITION DYNAM -ICS MISMATCH

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...