Bounding NBLM neighbourhood's adequate sizes

We try to address the problem of a priori selection of the adequate size for NBLM neighbourhoods. The application of the concept of neural neighbourhood to the Levenberg-Marquardt optimization method led us to the development of the NBLM algorithm. When this algorithm is used, there can be neighbour...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP '02 Vol. 4; pp. 1676 - 1679 vol.4
Main Authors Mayoral, R., Lera, G.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2002
Subjects
Computational efficiency
Computational modeling
Costs
Error correction
Jacobian matrices
Neural networks
Optimization methods
Parameter estimation
Performance analysis
Testing
Online AccessGet full text

Cover

More Information
Summary:We try to address the problem of a priori selection of the adequate size for NBLM neighbourhoods. The application of the concept of neural neighbourhood to the Levenberg-Marquardt optimization method led us to the development of the NBLM algorithm. When this algorithm is used, there can be neighbourhoods that, not only produce significant reductions in memory requirements, but that also achieve better time performance than that of the Levenberg-Marquardt method. However, as long as the problem of choosing an appropriate neighbourhood size is not solved, the NBLM algorithm will not be able to offer the best possible performance.
ISBN:9810475241
9789810475246
DOI:10.1109/ICONIP.2002.1198960