Comment on "Finite size scaling in Neural Networks"

Details Comment on "Finite size scaling in Neural Networks" Comment on "Finite size scaling in Neural Networks"

1997-10-17

arxiv.org/abs/cond-mat/9710178v2

Physics

Condensed Matter

Disordered Systems and Neural Networks

LaTeX with 1 postscript figure, using REVTeX

Scientific paper

10.1103/PhysRevLett.80.4109

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)

Affiliated with

Also associated with

No associations

Rating

Comment on "Finite size scaling in Neural Networks" does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comment on "Finite size scaling in Neural Networks", we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comment on "Finite size scaling in Neural Networks" will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-83766