A class of asymptotically stable algorithms for learning-rate adaptation

Rüger, Stefan (1998). A class of asymptotically stable algorithms for learning-rate adaptation. Algorithmica, 22(1-2) pp. 198–210.

DOI (Digital Object Identifier) Link:	https://doi.org/10.1007/PL00013830
Google Scholar:	Look up in Google Scholar

Abstract

A stability criterion for learning is given. In the case of learning-rate adaptation of backpropagation, a class of asymptotically stable algorithms is presented and studied, including a convergence proof. Simulations demonstrate relevance and limitations.

Item Type:	Article
Copyright Holders:	1998 Springer-Verlag
ISSN:	1432-0541
Keywords:	convex optimization; neural learning; learning-rate adaptation; line search; stability criterion
Academic Unit/School:	Faculty of Science, Technology, Engineering and Mathematics (STEM) > Knowledge Media Institute (KMi) Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID:	11955
Depositing User:	Users 8580 not found.
Date Deposited:	08 Oct 2008 13:13
Last Modified:	04 Oct 2016 10:13
URI:	http://oro.open.ac.uk/id/eprint/11955
Share this page:

Altmetrics	Scopus Citations

Actions (login may be required)

RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationRefMan RIS Format (UTF-8)OpenURL ContextObjectEndNoteMODSOpenURL ContextObject in SpanMPEG-21 DIDLEP3 XMLRefMan RIS FormatRDF+N3