On Functional Dimension and Persistent Pseudodimension

J. Elisenda Grigsby, Kathryn Lindsey
10/22/2024
cs.LGmath.AGmath.CO

No confident code implementation found for this paper.

Abstract

For any fixed feedforward ReLU neural network architecture, it is well-known that many different parameter settings can determine the same function. It is less well-known that the degree of this redundancy is inhomogeneous across parameter space. In this work, we discuss two locally applicable complexity measures for ReLU network classes and what we know about the relationship between them: (1) the local functional dimension [14, 18], and (2) a local version of VC dimension that we call persistent pseudodimension. The former is easy to compute on finite batches of points; the latter should give local bounds on the generalization gap, which would inform an understanding of the mechanics of the double descent phenomenon [7].

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. Any repos shown below are weak matches — 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{grigsby2024functional,
  title  = {On Functional Dimension and Persistent Pseudodimension},
  author = {J. Elisenda Grigsby and Kathryn Lindsey},
  year   = {2024},
  eprint = {2410.17191},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.17191v2}
}

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/2410.17191.svg)](https://codeofpaper.com/paper/2410.17191)

Discussion