Abstract
We consider the convergence characteristics of a perceptron learning algorithm,
taking into account the decay of photorefractive holograms during the process of
interconnection weight changes. As a result of the hologram erasure, the
convergence of the learning process is dependent on the exposure time during the
weight changes. A mathematical proof of the conditional convergence, as well as
computer simulations of the photorefractive perceptrons, is presented and
discussed.
© 1993 Optical Society of America
Full Article |
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Figures (3)
You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Tables (1)
You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Equations (15)
You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription