83 search results - page 1 / 17 » Neural Network Learning: Testing Bounds on Sample Complexity |
PRIS
2004
13 years 6 months ago
2004
Several authors have theoretically determined distribution-free bounds on sample complexity. Formulas based on several learning paradigms have been presented. However, little is kn...
ICANN
2007
Springer
13 years 11 months ago
2007
Springer
JMLR
2002
13 years 4 months ago
2002
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
STOC
1993
ACM
13 years 8 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
JMLR
2006
13 years 4 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...