A new Jacobian matrix for optimal learning of single-layer neural networks.
This paper investigates the learning of a wide class of single-hidden-layer feedforward neural networks (SLFNs) with two sets of adjustable parameters, i.e., the nonlinear parameters in the hidden nodes and the linear output weights. The main objective is to both speed up the convergence of second-order learning algorithms such as Levenberg-Marquardt (LM), as well as to improve the network performance. This is achieved here by reducing the dimension of the solution space and by introducing a new Jacobian matrix. Unlike conventional supervised learning methods which optimize these two sets of parameters simultaneously, the linear output weights are first converted into dependent parameters, thereby removing the need for their explicit computation. Consequently, the neural network (NN) learning is performed over a solution space of reduced dimension. A new Jacobian matrix is then proposed for use with the popular second-order learning methods in order to achieve a more accurate approximation of the cost function. The efficacy of the proposed method is shown through an analysis of the computational complexity and by presenting simulation results from four different examples.
Peng
Jian Xun
JX
School of Electronics, Electrical Engineering, and Computer Science, Queen's University of Belfast, Belfast, UK.
Li
Kang
K
Irwin
George W
GW
D000465:Algorithms; D001185:Artificial Intelligence; D006801:Humans; D007858:Learning / Q000502:physiology*; D016571:Neural Networks, Computer; D017711:Nonlinear Dynamics