VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions.
Marek KarpinskiThorsten WertherPublished in: SIAM J. Comput. (1993)
Keyphrases
- vc dimension
- vapnik chervonenkis dimension
- function classes
- concept class
- pac learnability
- uniform convergence
- inductive inference
- sample complexity
- upper bound
- pac learning
- lower bound
- empirical risk minimization
- concept classes
- statistical learning theory
- sample size
- target function
- real valued functions
- generalization bounds
- worst case
- learning theory
- learning machines
- high dimensional
- euclidean space
- compression scheme
- statistical queries
- active learning
- dnf formulas
- special case
- learning algorithm
- query complexity
- linear functions
- agnostic learning
- learning problems
- sufficient conditions
- efficiently learnable
- training data