By Topic

Variable Projection Method and Levenberg-Marquardt Algorithm for Neural Network Training

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

An optimal solution for single hidden layered feedforward neural network (SLFN) is proposed. SLFN can be considered as separable nonlinear least squares problem and variable projection (VP) method gives the approximation of the Jacobian matrix of the problem. The Jacobian calculation of VP-SLFN is suggested with simplified form. Based on this simplification, Levenberg-Marquardt (LM) algorithm for VP-SLFN is suggested and has faster convergence rate than LM algorithm without VP. Two numerical examples show the superiority than extreme learning machine and LM without variable projection

Published in:

IEEE Industrial Electronics, IECON 2006 - 32nd Annual Conference on

Date of Conference:

6-10 Nov. 2006