Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Tang, Z.
Right arrow Articles by Ishii, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Tang, Z.
Right arrow Articles by Ishii, M.
(Neural Computation. 2003;15:1125-1142.)
© 2003 The MIT Press


Letter

An Algorithm of Supervised Learning for Multilayer Neural Networks

Zheng Tang

tang{at}iis.toyama-u.ac.jp, Faculty of Engineering, Toyama University, 3190 Gofuku Toyama 930-8555, Japan

XuGang Wang

xugunw76{at}hotmail.com, Faculty of Engineering, Toyama University, 3190 Gofuku Toyama 930-8555, Japan

Hiroki Tamura

tamura{at}iis.toyama-u.ac.jp, Faculty of Engineering, Toyama University, 3190 Gofuku Toyama 930-8555, Japan

Masahiro Ishii

ishii{at}iis.toyama-u.ac.jp, Faculty of Engineering, Toyama University, 3190 Gofuku Toyama 930-8555, Japan

A method of supervised learning for multilayer artificial neural networks to escape local minima is proposed. The learning model has two phases: a backpropagation phase and a gradient ascent phase. The backpropagation phase performs steepest descent on a surface in weight space whose height at any point in weight space is equal to an error measure, and it finds a set of weights minimizing this error measure. When the backpropagation gets stuck in local minima, the gradient ascent phase attempts to fill up the valley by modifying gain parameters in a gradient ascent direction of the error measure. The two phases are repeated until the network gets out of local minima. The algorithm has been tested on benchmark problems, such as exclusive-or (XOR), parity, alphabetic characters learning, Arabic numerals with a noise recognition problem, and a realistic real-world problem: classification of radar returns from the ionosphere. For all of these problems, the systems are shown to be capable of escaping from the backpropagation local minima and converge faster when using the new proposed method than using the simulated annealing techniques.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2003 by The MIT Press.