By Topic

Using 3-D surface maps to illustrate neural network performance

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

1 Author(s)
Raeth, P.G. ; Wright Res. & Dev. Center, Wright-Patterson AFB, OH, USA

A possible means for evaluating the performance of neural networks from a global perspective in parameter-space is suggested. An organized experimental method that identifies network configuration and parameter value choices which are not sensitive to minor variations for a standard training metric is described. Convergence maps are n-dimensional plots which show the ability of a neural network to converge on (learn) a given training metric. The traveling salesman optimization problem is a classic metric for testing energy minimization networks. This metric isa discussed. The technique is illustrated for the network used by J.J Hopfield and D.W. Tank (1985) to solve a traveling salesman problem and with traditional backpropagation as described by R.P Lippmann (1987)

Published in:

Aerospace and Electronics Conference, 1990. NAECON 1990., Proceedings of the IEEE 1990 National

Date of Conference:

21-25 May 1990