By Topic

Comparison of rates of linear and neural network approximation

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
$33 $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

2 Author(s)
V. Kurkova ; Inst. of Comput. Sci., Czechoslovak Acad. of Sci., Prague, Czech Republic ; M. Sanguineti

We develop some mathematical tools for comparison of rates of fixed versus variable basis function approximation. Using these tools, we describe sets of multivariable functions, for which lower bounds on worst-case errors in approximation by n-dimensional linear subspaces are larger than upper bounds on such errors in approximation by perceptron networks with n hidden units

Published in:

Neural Networks, 2000. IJCNN 2000, Proceedings of the IEEE-INNS-ENNS International Joint Conference on  (Volume:1 )

Date of Conference: