{
  "id": "cond-mat/9710178",
  "version": "v2",
  "published": "1997-10-17T13:38:52.000Z",
  "updated": "1997-12-11T11:21:19.000Z",
  "title": "Comment on \"Finite size scaling in Neural Networks\"",
  "authors": [
    "M. Schroeder",
    "R. Urbanczik"
  ],
  "comment": "LaTeX with 1 postscript figure, using REVTeX",
  "doi": "10.1103/PhysRevLett.80.4109",
  "categories": [
    "cond-mat.dis-nn"
  ],
  "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)",
  "revisions": [
    {
      "version": "v2",
      "updated": "1997-12-11T11:21:19.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "neural networks",
      "finite size scaling ansatz nadler",
      "binary search tree",
      "simplex algorithm",
      "accurate statistics"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Phys. Rev. Lett."
    },
    "note": {
      "typesetting": "RevTeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}