资源分类
》 资源 》论文》The Loss Surface of Deep and Wide Neural Networks

The Loss Surface of Deep and Wide Neural Networks

2020-03-10 | |  68 |   41 |   0

Abstract

While the optimization problem behind deep neural networks is highly non-convex, it is frequently observed in practice that training deep networks seems possible without getting stuck in suboptimal points. It has been argued that this is the case as all local minima are close to being globally optimal. We show that this is (almost) true, in fact almost all local minima are globally optimal, for a fully connected network with squared loss and analytic activation function given that the number of hidden units of one layer of the network is larger than the number of training points and the network structure from this layer on is pyramidal.

上一篇：Orthogonalized ALS: A Theoretically Principled Tensor Decomposition Algorithm for Practical Use

下一篇：Schema Networks: Zero-shot Transfer with a Generative Causal Model of Intuitive Physics

用户评价
全部评价

热门资源

  • 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...