Pith. sign in

REVIEW 3 cited by

On the Power-Law Hessian Spectrums in Deep Learning

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 2201.13011 v2 pith:CB77XFHP submitted 2022-01-31 cs.LG physics.bio-phq-bio.BM

classification cs.LGphysics.bio-phq-bio.BM
keywords deephessianlearningpower-lawspectraleigenvalueslargenetworks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

It is well-known that the Hessian of deep loss landscape matters to optimization, generalization, and even robustness of deep learning. Recent works empirically discovered that the Hessian spectrum in deep learning has a two-component structure that consists of a small number of large eigenvalues and a large number of nearly-zero eigenvalues. However, the theoretical mechanism or the mathematical behind the Hessian spectrum is still largely under-explored. To the best of our knowledge, we are the first to demonstrate that the Hessian spectrums of well-trained deep neural networks exhibit simple power-law structures. Inspired by the statistical physical theories and the spectral analysis of natural proteins, we provide a maximum-entropy theoretical interpretation for explaining why the power-law structure exist and suggest a spectral parallel between protein evolution and training of deep neural networks. By conducing extensive experiments, we further use the power-law spectral framework as a useful tool to explore multiple novel behaviors of deep learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Sketched Gaussian Mechanism for Private Federated Learning

    cs.LG 2025-09 conditional novelty 6.0 of 10

    A sketched Gaussian mechanism is shown to have privacy loss that shrinks as the sketch dimension grows, giving communication-efficient federated learning with stronger privacy per noise budget.

  2. Models of Heavy-Tailed Mechanistic Universality

    stat.ML 2025-06 conditional novelty 6.0 of 10

    A new random matrix model with one structure parameter explains heavy-tailed spectra in trained networks, and yields scaling laws, optimizer-tail behavior, and a description of the five-plus-one phases of training.

  3. Commute Your Domains: Trajectory Optimality Criterion for Multi-Domain Learning

    cs.LG 2025-01 conditional novelty 6.0 of 10

    Training-order effects in multi-domain learning are governed by the Lie bracket of the per-domain gradient flows, yielding a local optimality criterion for weight schedules.

Pith tools