In this work the authors implement in a Multi-Layer Perceptron (MLP) environment a new class of quasi-newtonian (QN) methods. The algorithms proposed in the present paper use in the iterative scheme of a generalized BFGS-method a family of matrix algebras, recently introduced for displacement decompositions and for optimal preconditioning. This novel approach allows to construct methods having an O(n log_2 n) complexity. Numerical experiences compared with the performances of the best QN-algorithms known in the literature confirm the effectiveness of these new optimization techniques.
DI FIORE, C., Fanelli, S., Zellini, P. (1999). Matrix algebras in quasi-newtonian algorithms for optimal learning in multi-layer perceptrons. In Proceedings of ICONIP 1999 (pp.27-32). N. Kasabov; K. Ko.
Matrix algebras in quasi-newtonian algorithms for optimal learning in multi-layer perceptrons
DI FIORE, CARMINE;FANELLI, STEFANO;ZELLINI, PAOLO
1999-01-01
Abstract
In this work the authors implement in a Multi-Layer Perceptron (MLP) environment a new class of quasi-newtonian (QN) methods. The algorithms proposed in the present paper use in the iterative scheme of a generalized BFGS-method a family of matrix algebras, recently introduced for displacement decompositions and for optimal preconditioning. This novel approach allows to construct methods having an O(n log_2 n) complexity. Numerical experiences compared with the performances of the best QN-algorithms known in the literature confirm the effectiveness of these new optimization techniques.File | Dimensione | Formato | |
---|---|---|---|
ART.pdf
accesso aperto
Dimensione
140.96 kB
Formato
Adobe PDF
|
140.96 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.