Searching for minimum in neural networks

Article type: Research Article

Authors: Vyšniauskas, Vytautas

Affiliations: Institute of Mathematics and Informatics, 2600 Vilnius, Akademijos St.4, Lithuania

Abstract: Neural networks are often characterized as highly nonlinear systems of fairly large amount of parameters (in order of 103 – 104). This fact makes the optimization of parameters to be a nontrivial problem. But the astonishing moment is that the local optimization technique is widely used and yields reliable convergence in many cases. Obviously, the optimization of neural networks is high-dimensional, multi-extremal problem, so, as usual, the global optimization methods would be applied in this case. On the basis of Perceptron-like unit (which is the building block for the most architectures of neural networks) we analyze why the local optimization technique is so successful in the field of neural networks. The result is that a linear approximation of the neural network can be sufficient to evaluate the start point for the local optimization procedure in the nonlinear regime. This result can help in developing faster and more robust algorithms for the optimization of neural network parameters.

Keywords: neural networks, optimization theory, pattern recognition

DOI: 10.3233/INF-1994-51-214

Journal: Informatica, vol. 5, no. 1-2, pp. 241-255, 1994