arXiv · cond-mat/9710178
Comment on "Finite size scaling in Neural Networks"
Abstract
We use a binary search tree and the simplex algorithm to measure the fraction of patterns that can be stored by an Ising perceptron. The algorithm is much faster than exhaustive search and allows us to obtain accurate statistics up to a system size of N=42. The results show that the finite size scaling ansatz Nadler and Fink suggest in [1] cannot be applied to estimate accurately the storage capacity from small systems. [1] W.Nadler and W.Fink: Phys.Rev.Lett. 78, 555 (1997)
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
M. Schroeder, R. Urbanczik. 1997-12-11. Comment on "Finite size scaling in Neural Networks". https://doi.org/10.1103/physrevlett.80.4109
Cite the original work for its findings. Save a collection to share your selection of sources.