Finite size scaling in neural networks
Abstract
We demonstrate that the fraction of pattern sets that can be stored in single- and hidden-layer perceptrons exhibits finite size scaling. This feature allows to estimate the critical storage capacity αc from simulations of relatively small systems. We illustrate this approach by determining αc, together with the finite size scaling exponent , for storing Gaussian patterns in committee and parity machines with binary couplings and up to K=5 hidden units.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.