scientific article; zbMATH DE number 5957262
From MaRDI portal
Publication:3093252
Recommendations
- Complexities of convex combinations and bounding the generalization error in classification
- Generalization bounds for voting classifiers based on sparsity and clustering.
- A learning generalization bound with an application to sparse-representation classifiers
- Generalization bounds for sparse random feature expansions
- Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins.
- Convexity, Classification, and Risk Bounds
- Generalization bounds of regularization algorithms derived simultaneously through hypothesis space complexity, algorithmic stability and data quality
- Learning sparse classifiers: continuous and mixed integer optimization perspectives
- Learning with generalization capability by kernel methods of bounded complexity
Cited in
(10)- Relative deviation learning bounds and generalization with unbounded loss functions
- Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins.
- Best lower bound on the probability of a binomial exceeding its expectation
- A sparsity driven kernel machine based on minimizing a generalization error bound
- On the approximability of the largest sphere rule ensemble classification problem
- Tight lower bound on the probability of a binomial exceeding its expectation
- Complexities of convex combinations and bounding the generalization error in classification
- On the importance of small coordinate projections
- Random subclass bounds.
- Generalization bounds for voting classifiers based on sparsity and clustering.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093252)
