pith. sign in

arxiv: 1711.00753 · v2 · pith:DWP26TEXnew · submitted 2017-11-02 · 💻 cs.LG · stat.ML

Network-size independent covering number bounds for deep networks

classification 💻 cs.LG stat.ML
keywords coveringnumberbounddeepindependentlinearnetworkspart
0
0 comments X
read the original abstract

We give a covering number bound for deep learning networks that is independent of the size of the network. The key for the simple analysis is that for linear classifiers, rotating the data doesn't affect the covering number. Thus, we can ignore the rotation part of each layer's linear transformation, and get the covering number bound by concentrating on the scaling part.

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.