Generalization Bounds and Complexities Based on Sparsity and Clustering for Convex Combinations of Functions from Random Classes.
Savina Andonova JaegerPublished in: J. Mach. Learn. Res. (2005)
Keyphrases
- convex combinations
- generalization bounds
- function classes
- data dependent
- learning theory
- generalization ability
- vc dimension
- ranking algorithm
- model selection
- statistical learning theory
- learning problems
- linear classifiers
- kernel machines
- convex hull
- learning machines
- high dimensional
- decision stumps
- uniform convergence
- data points
- inductive inference
- boosting algorithms
- supervised classification
- feature extraction
- statistical learning
- bp neural network
- learning tasks
- support vector