Pith. sign in

REVIEW 1 cited by

Pathological spectra of the Fisher information metric and its variants in deep neural networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.05992 v2 pith:4BTJGAKT submitted 2019-10-14 stat.ML cond-mat.dis-nncs.LG

classification stat.MLcond-mat.dis-nncs.LG
keywords variantsfimsmetricneuraloutputpathologicalspectradeep
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The Fisher information matrix (FIM) plays an essential role in statistics and machine learning as a Riemannian metric tensor or a component of the Hessian matrix of loss functions. Focusing on the FIM and its variants in deep neural networks (DNNs), we reveal their characteristic scale dependence on the network width, depth and sample size when the network has random weights and is sufficiently wide. This study covers two widely-used FIMs for regression with linear output and for classification with softmax output. Both FIMs asymptotically show pathological eigenvalue spectra in the sense that a small number of eigenvalues become large outliers depending the width or sample size while the others are much smaller. It implies that the local shape of the parameter space or loss landscape is very sharp in a few specific directions while almost flat in the other directions. In particular, the softmax output disperses the outliers and makes a tail of the eigenvalue density spread from the bulk. We also show that pathological spectra appear in other variants of FIMs: one is the neural tangent kernel; another is a metric for the input signal and feature space that arises from feedforward signal propagation. Thus, we provide a unified perspective on the FIM and its variants that will lead to more quantitative understanding of learning in large-scale DNNs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Training-free Neural Architecture Search through Variance of Knowledge of Deep Network Weights

    cs.CV 2025-02 conditional novelty 6.0 of 10

    VKDNW scores untrained image classifiers by the entropy of eigenvalue deciles of a Fisher information matrix sampled from one weight per layer, and this ranking outperforms prior zero-cost NAS proxies.

Pith tools