Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published December 1, 1987 | Published
Journal Article Open

Learning algorithms and probability distributions in feed-forward and feed-back networks

Abstract

Learning algorithms have been used both on feed-forward deterministic networks and on feed-back statistical networks to capture input-output relations and do pattern classification. These learning algorithms are examined for a class of problems characterized by noisy or statistical data, in which the networks learn the relation between input data and probability distributions of answers. In simple but nontrivial networks the two learning rules are closely related. Under some circumstances the learning problem for the statistical networks can be solved without Monte Carlo procedures. The usual arbitrary learning goals of feed-forward networks can be given useful probabilistic meaning.

Additional Information

© 1987 by the National Academy of Sciences. Contributed by J. J. Hopfield, August 17, 1987. I acknowledge helpful conversations with D.W. Tank, E. Baum, and S. Solla. This work was supported by contract N00014-K-0377 from the Office of Naval Research. The publication costs of this article were defrayed in part by page charge payment. This article must therefore be hereby marked "advertisement" in accordance with 18 U.S.C. §1734 solely to indicate this fact.

Attached Files

Published - HOPpnas87.pdf

Files

HOPpnas87.pdf
Files (868.1 kB)
Name Size Download all
md5:2847f65f12e1f21b2304a68d6fc9e878
868.1 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023