Sciweavers

83 search results - page 3 / 17
» Neural Network Learning: Testing Bounds on Sample Complexity
Sort
View
ICDAR
2003
IEEE
13 years 11 months ago
Mirror Image Learning for Autoassociative Neural Networks
This paper studies on the mirror image learning algorithm for the autoassociative neural networks and evaluates the performance by handwritten numeral recognition test. Each of th...
Shusaku Shimizu, Wataru Ohyama, Tetsushi Wakabayas...
IJCNN
2000
IEEE
13 years 10 months ago
VC Dimension Bounds for Product Unit Networks
A product unit is a formal neuron that multiplies its input values instead of summingthem. Furthermore, it has weights acting as exponents instead of being factors. We investigate...
Michael Schmitt
NIPS
1996
13 years 7 months ago
Radial Basis Function Networks and Complexity Regularization in Function Learning
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
Adam Krzyzak, Tamás Linder
ICML
2003
IEEE
14 years 7 months ago
The Use of the Ambiguity Decomposition in Neural Network Ensemble Learning Methods
We analyze the formal grounding behind Negative Correlation (NC) Learning, an ensemble learning technique developed in the evolutionary computation literature. We show that by rem...
Gavin Brown, Jeremy L. Wyatt
CORR
2010
Springer
47views Education» more  CORR 2010»
13 years 6 months ago
Robustness and Generalization
We derive generalization bounds for learning algorithms based on their robustness: the property that if a testing sample is "similar" to a training sample, then the test...
Huan Xu, Shie Mannor