pith. sign in

arxiv: 1412.5896 · v3 · pith:C5XVBNOZnew · submitted 2014-12-18 · 📊 stat.ML · cs.IT· cs.LG· cs.NE· math.IT· math.MG

On the Stability of Deep Networks

classification 📊 stat.ML cs.ITcs.LGcs.NEmath.ITmath.MG
keywords datanetworksdeepdistance-preservingembeddingformallylongerperform
0
0 comments X
read the original abstract

In this work we study the properties of deep neural networks (DNN) with random weights. We formally prove that these networks perform a distance-preserving embedding of the data. Based on this we then draw conclusions on the size of the training data and the networks' structure. A longer version of this paper with more results and details can be found in (Giryes et al., 2015). In particular, we formally prove in the longer version that DNN with random Gaussian weights perform a distance-preserving embedding of the data, with a special treatment for in-class and out-of-class data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.