Path relinking and the generalised reduced gradient method for artificial neural networks

Path relinking and the generalised reduced gradient method for artificial neural networks

0.00 Avg rating0 Votes
Article ID: iaor20063607
Country: Netherlands
Volume: 169
Issue: 2
Start Page Number: 508
End Page Number: 519
Publication Date: Mar 2006
Journal: European Journal of Operational Research
Authors: , ,
Abstract:

Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is approximated. ANNs can be viewed as models of real systems, built by tuning parameters known as weights. In training the net, the problem is to find the weights that optimize its performance (i.e. to minimize the error over the training set). Although the most popular method for training these networks is back propagation, other optimization methods such as tabu search or scatter search have been successfully applied to solve this problem. In this paper we propose a path relinking implementation to solve the neural network training problem. Our method uses GRG, a gradient-based local NLP solver, as an improvement phase, while previous approaches used simpler local optimizers. The experimentation shows that the proposed procedure can compete with the best-known algorithms in terms of solution quality, consuming a reasonable computational effort.

Reviews

Required fields are marked *. Your email address will not be published.