- Title
- Canonical dual solutions to nonconvex radial basis neural network optimization problem
- Creator
- Latorre, Vittorio; Gao, David
- Date
- 2014
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/63952
- Identifier
- vital:5790
- Identifier
-
https://doi.org/10.1016/j.neucom.2013.06.050
- Identifier
- ISSN:1872-8286
- Abstract
- Radial Basis Functions Neural Networks (RBFNNs) are tools widely used in regression problems. One of their principal drawbacks is that the formulation corresponding to the training with the supervision of both the centers and the weights is a highly non-convex optimization problem, which leads to some fundamental difficulties for the traditional optimization theory and methods. This paper presents a generalized canonical duality theory for solving this challenging problem. We demonstrate that by using sequential canonical dual transformations, the nonconvex optimization problem of the RBFNN can be reformulated as a canonical dual problem (without duality gap). Both global optimal solution and local extrema can be classified. Several applications to one of the most used Radial Basis Functions, the Gaussian function, are illustrated. Our results show that even for a one-dimensional case, the global minimizer of the nonconvex problem may not be the best solution to the RBFNNs, and the canonical dual theory is a promising tool for solving general neural networks training problems. © 2014 Elsevier B.V.
- Publisher
- Elsevier
- Relation
- Neurocomputing Vol. 134, no. Special issue (2014), p. 189-197
- Rights
- Copyright Elsevier B.V.
- Rights
- This metadata is freely available under a CCO license
- Subject
- Canonical duality; Neural network; Radial basis functions; 08 Information and Computing Sciences; 09 Engineering; 1701 Psychology
- Reviewed
- Hits: 1038
- Visitors: 1012
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|