arXiv · cond-mat/9611027
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Walter Nadler, Wolfgang Fink. 1996-11-05. Finite size scaling in neural networks. https://doi.org/10.1103/physrevlett.78.555
Cite the original work for its findings. Save a collection to share your selection of sources.