Stochastic learning algorithm for generalization problems

C. V. Ramamoorthy, Shashi Shekhar

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Summary form only given, as follows. Neural networks have traditionally been applied to recognition problems, and most learning algorithms are tailored to those problems. The authors discuss the requirements of learning for generalization, which is NP-complete and cannot be approached by traditional methods based on gradient descent. They present a stochastic learning algorithm based on simulated annealing in weight space. The authors verify the convergence properties and feasibility of the algorithm.

Original languageEnglish (US)
Title of host publicationIJCNN Int Jt Conf Neural Network
Editors Anon
PublisherPubl by IEEE
Number of pages1
StatePublished - Dec 1 1989
EventIJCNN International Joint Conference on Neural Networks - Washington, DC, USA
Duration: Jun 18 1989Jun 22 1989


OtherIJCNN International Joint Conference on Neural Networks
CityWashington, DC, USA


Dive into the research topics of 'Stochastic learning algorithm for generalization problems'. Together they form a unique fingerprint.

Cite this