Local Rademacher Complexity Bounds based on Covering Numbers.
Yunwen LeiLixin DingYingzhou BiPublished in: CoRR (2015)
Keyphrases
- covering numbers
- complexity bounds
- vc dimension
- uniform convergence
- worst case
- gaussian kernels
- learning rate
- sample complexity
- statistical learning theory
- upper bound
- constraint networks
- reproducing kernel hilbert space
- statistical learning
- sufficient conditions
- mistake bound
- theoretical analysis
- concept classes
- query containment
- generalization bounds
- lower bound
- function classes
- learning algorithm
- data sets
- ranking functions
- sample size