‘Plain backpropagation’ and advanced optimization algorithms: A comparative study

We present a comparison of ‘plain backpropagation’ to other standard optimization algorithms. These algorithms include direct search as well as first and second order methods. All algorithms share the property of easy accessability. We chose a feedforward architecture for a network to perform functi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Neurocomputing (Amsterdam) 1994, Vol.6 (2), p.153-161
Hauptverfasser: de Groot, Claas, Würtz, Diethelm
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a comparison of ‘plain backpropagation’ to other standard optimization algorithms. These algorithms include direct search as well as first and second order methods. All algorithms share the property of easy accessability. We chose a feedforward architecture for a network to perform function approximation. The results show a clear advantage of higher order methods with respect to quality of solution as well as execution times.
ISSN:0925-2312
1872-8286
DOI:10.1016/0925-2312(94)90052-3