Abstract
In this paper we explore different strategies to guide backpropagation algorithm used for training artificial neural networks. Two different variants of steepest descent-based backpropagation algorithm, and four different variants of conjugate gradient algorithm are tested. The variants differ whether or not the time component is used, and whether or not additional gradient information is utilized during one-dimensional optimization. Testing is performed on randomly generated data as well as on some benchmark data regarding energy prediction. Based on our test results, it appears that the most promissing backpropagation strategy is to initially use steepest descent algorithm, and then continue with conjugate gradient algorithm. The backpropagation through time strategy combined with conjugate gradients appears to be promissing as well.
| Original language | English |
|---|---|
| Pages (from-to) | 1-14 |
| Number of pages | 14 |
| Journal | Journal of Computing and Information Technology |
| Volume | 9 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2001 |
Keywords
- Artificial intelligence: backpropagation in neural networks
- Nonlinear unconstrained programming: conjugate gradient method
- Steepest descent method
Fingerprint
Dive into the research topics of 'Training artificial neural networks: Backpropagation via nonlinear optimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver