Generalization Bounds and Uniform Bounds for Multi-Dividing Ontology Algorithms with Convex Ontology Loss Function.
Wei GaoMohammad Reza FarahaniPublished in: Comput. J. (2017)
Keyphrases
- generalization bounds
- loss function
- convex combinations
- data dependent
- boosting algorithms
- learning theory
- generalization ability
- uniform convergence
- risk minimization
- convex loss functions
- empirical risk
- model selection
- linear classifiers
- learning algorithm
- ranking algorithm
- vc dimension
- worst case
- pairwise
- upper and lower bounds
- learning problems
- support vector
- statistical learning theory
- lower bound
- kernel machines
- upper bound
- knn