QMCM: Minimizing Vapnik's bound on the VC dimension.
JayadevaSumit SomanHimanshu PantMayank SharmaPublished in: Neurocomputing (2020)
Keyphrases
- vc dimension
- statistical learning theory
- upper bound
- lower bound
- distribution free
- vapnik chervonenkis
- sample complexity
- inductive inference
- generalization bounds
- sample size
- vapnik chervonenkis dimension
- concept classes
- uniform convergence
- worst case
- empirical risk minimization
- learning machines
- compression scheme
- pac learning
- euclidean space
- risk bounds
- np hard
- function classes
- machine learning
- training data
- generalization error
- statistical learning