pith. sign in

arxiv: 1711.01530 · v2 · pith:FLEBEIX4new · submitted 2017-11-05 · 💻 cs.LG · cs.AI· stat.ML

Fisher-Rao Metric, Geometry, and Complexity of Neural Networks

classification 💻 cs.LG cs.AIstat.ML
keywords capacitygeometrymeasurenetworkscomplexityfisher-raoinvariancemeasures
0
0 comments X
read the original abstract

We study the relationship between geometry and capacity measures for deep neural networks from an invariance viewpoint. We introduce a new notion of capacity --- the Fisher-Rao norm --- that possesses desirable invariance properties and is motivated by Information Geometry. We discover an analytical characterization of the new capacity measure, through which we establish norm-comparison inequalities and further show that the new measure serves as an umbrella for several existing norm-based complexity measures. We discuss upper bounds on the generalization error induced by the proposed measure. Extensive numerical experiments on CIFAR-10 support our theoretical findings. Our theoretical analysis rests on a key structural lemma about partial derivatives of multi-layer rectifier networks.

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.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Deep network as memory space: complexity, generalization, disentangled representation and interpretability

    cs.LG 2019-07 unverdicted novelty 5.0

    Deep networks are framed as memory spaces whose complexity is defined by a Fisher metric, with the least action principle linking this complexity to generalization and disentanglement for better interpretability.