A Two-Scale Complexity Measure for Deep Learning Models

Massimiliano Datres, Gian Paolo Leonardi, Alessio Figalli, David Sutter
1/17/2024
stat.MLcs.LG

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

We introduce a novel capacity measure 2sED for statistical models based on the effective dimension. The new quantity provably bounds the generalization error under mild assumptions on the model. Furthermore, simulations on standard data sets and popular model architectures show that 2sED correlates well with the training error. For Markovian models, we show how to efficiently approximate 2sED from below through a layerwise iterative approach, which allows us to tackle deep learning models with a large number of parameters. Simulation results suggest that the approximation is good for different prominent models and data sets.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{datres2024twoscale,
  title  = {A Two-Scale Complexity Measure for Deep Learning Models},
  author = {Massimiliano Datres and Gian Paolo Leonardi and Alessio Figalli and David Sutter},
  year   = {2024},
  eprint = {2401.09184},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2401.09184},
  url    = {http://arxiv.org/abs/2401.09184v3},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.09184.svg)](https://codeofpaper.com/paper/2401.09184)

Discussion