Local Rademacher complexity bounds based on covering numbers.
Yunwen LeiLixin DingYingzhou BiPublished in: Neurocomputing (2016)
Keyphrases
- covering numbers
- complexity bounds
- vc dimension
- uniform convergence
- worst case
- gaussian kernels
- sample complexity
- learning rate
- reproducing kernel hilbert space
- upper bound
- statistical learning theory
- constraint networks
- query containment
- sufficient conditions
- generalization error
- real valued
- schema mappings
- mistake bound
- sample size
- theoretical analysis
- conjunctive queries
- lower bound
- function classes