(Enter summary)
Abstract: We examine the relationship between the VC-dimension and the number of
parameters of a smoothly parametrized function class. We show that the VCdimension
of such a function class is at least k if there exists a k-dimensional differentiable
manifold in the parameter space such that each member of the manifold
corresponds to a different decision boundary. Using this result, we are able to obtain
lower bounds on the VC-dimension proportional to the number of parameters
for several function classes ... (Update)
Similar documents (at the sentence level):
67.3%: Lower Bounds on the VC-Dimension of Smoothly Parametrized.. - Wee Sun Lee (1995)
(Correct)
Active bibliography (related documents): More All
0.8: Probabilistic Analysis of Learning in Artificial Neural Networks: .. - Anthony (1997)
(Correct)
0.2: The VC-Dimension and Pseudodimension of Two-Layer Neural.. - Peter Bartlett (1993)
(Correct)
0.1: VC Dimension of Neural Networks - Sontag (1998)
(Correct)
Similar documents based on text: More All
0.3: Lower Bounds on the Vapnik-Chervonenkis Dimension of Multi-layer .. - Bartlett (1993)
(Correct)
0.3: .1 The VC-dimension of a neural network - If We Could
(Correct)
0.2: Neural Nets with Superlinear VC-Dimension - Maass (1994)
(Correct)
BibTeX entry: (Update)
@inproceedings{ lee94lower,
author = "Wee Sun Lee and Peter L. Bartlett and Robert C. Williamson",
title = "Lower Bounds on the {VC}-Dimension of Smoothly Parametrized Function Classes",
booktitle = "Computational Learing Theory",
pages = "362-367",
year = "1994",
url = "citeseer.ist.psu.edu/122125.html" }
Citations (may not include all citations):
1056
Introduction to the Theory of Neural Computation (context) - Hertz, Krogh et al. - 1991
537
A theory of the learnable (context) - Valiant - 1984
255
A Training Algorithm for Optimal Margin Classifiers
- Boser, Guyon et al. - 1992
151
A general lower bound on the number of examples needed for l.. (context) - Ehrenfeucht, Haussler et al. - 1989
119
Radial Basis Functions For Multivariable Interpolation: A Re.. (context) - Powell - 1987
63
What Size Net Gives Valid Generalization (context) - Baum, Haussler - 1989
44
Calculus on Manifolds (context) - Spivak - 1965
42
Computational Learning Theory: An Introduction (context) - Anthony, Biggs - 1992
38
Uniqueness of the weights for minimal feedforward nets with ..
- Sussmann - 1992
27
Finiteness Result for Sigmoidal Neural Network
- Macintyre, Sontag - 1993
23
Neural Nets with Superlinear VC-Dimension
- Maass - 1992
22
Uniqueness of weights for neural networks
- Albertini, Sontag et al. - 1993
19
Tighter Bounds of the VC-dimension of Three-layer Networks (context) - Sakurai - 1993
9
the Power of Polynomial Discriminators and Radial Basis Func.. (context) - Anthony, Holden - 1993
7
Vapnik-Chervonenkis Dimension Bounds for Two- and Three-Laye.. (context) - Bartlett - 1993
3
Learnibility and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
2
The Vapnik-Chervonenkis Dimension and Pseudodimension of Two.. (context) - Bartlett, Williamson - 1993
Documents on the same site (http://wwwsyseng.anu.edu.au/~bartlett/papers/): More
Covering Numbers for Real-Valued Function Classes - Bartlett, Kulkarni, Posner (1997)
(Correct)
Structural Risk Minimization over Data-Dependent Hierarchies - Shawe-Taylor, Bartlett, al. (1998)
(Correct)
For Valid Generalization, the Size of the Weights is More.. - Bartlett (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC