title: Exploring and comparing the best "direct methods" for the efficient training of MLP-networks.
abstract: It is well known that the main difficulties of the algorithms based on backpropagation are the susceptibility to local minima and the slow adaptivity to the patterns during the training. In this paper, we present a class of algorithms, which overcome the above difficulties by utilizing some "direct" numerical methods for the computation of the matrices of weights. In particular, we investigate the performances of the FBFBK-LSB (least-squares backpropagation) algorithms and iterative conjugate gradient singular-value decomposition (ICGSVD), respectively, introduced by Barmann and Biegler-Konig (1993) and by the authors. Numerical results on several benchmark problems show a major reliability and/or efficiency of our algorithm ICGSVD.
authors.affiliation: Dipartimento di Matematica, Rome Univ.
authors.forename: M
authors.initials: M
authors.lastname: Di Martino
authors.forename: S
authors.initials: S
authors.lastname: Fanelli
authors.forename: M
authors.initials: M
authors.lastname: Protasi