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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
