Title :
A stochastic learning algorithm for generalization problems
Author :
Ramamoorthy, C.V. ; Shekhar, Shashi
Author_Institution :
Div. of Comput. Sci., California Univ., Berkeley, CA, USA
Abstract :
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.<>
Keywords :
learning systems; neural nets; NP-complete; convergence properties; feasibility; generalization problems; learning for generalization; requirements; simulated annealing in weight space; stochastic learning algorithm; Learning systems; Neural networks;
Conference_Titel :
Neural Networks, 1989. IJCNN., International Joint Conference on
Conference_Location :
Washington, DC, USA
DOI :
10.1109/IJCNN.1989.118446