## Abstract The back propagation of error in multi‐layer perceptrons when used for supervised training is a non‐local algorithm in space, that is it needs the knowledge of the network topology. On the other hand, learning rules in biological systems with many hidden units, seem to be local in both
A scaled conjugate gradient algorithm for fast supervised learning
✍ Scribed by Martin Fodslette Møller
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 771 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0893-6080
No coin nor oath required. For personal study only.
✦ Synopsis
A supervised learning algorithm (Scaled Conjugate Gradient, SCG) is introduced TIw pelformance of SCG is benchmarked against that of the standard back propagation algorithm (BP) ( Rumelhart. Hinton. & 14"illiams. 1986 ), the conjugate gradient algorithm with line search ( CGL ) ( Johansson, Dowla. & Goodman, 1990) and the one-step Broyden-Fletcher-Gold./arb-Shanno memoriless quasi-Newton algorithm ( BFGS) . SCG is lhlly-automated, inJudes no critical user-dependent parametepw, and avoids a time consuming line search, which CGL and BFGS use in each iteration in order to determine an appropriate step size. E.¥periments show that SCG is considerablyJhster than BP, CGL, and BFGS.
📜 SIMILAR VOLUMES
Datasets in modern High Energy Physics (HEP) experiments are often described by dozens or even hundreds of input variables. Reducing a full variable set to a subset that most completely represents information about data is therefore an important task in analysis of HEP data. We compare various varia
## Abstract In this article we present a semi‐supervised active learning algorithm for pattern discovery in information extraction from textual data. The patterns are reduced regular expressions composed of various characteristics of features useful in information extraction. Our major contribution
A new conjugate gradient algorithm is presented for extracting eigenvalues from large systems of equations encountered in finite element analysis. The new algorithm involves applying the conjugate gradient method (CGM) to a static problem to generate an equivalent tridiagonal matrix used for eigenva