Data-dependent margin-based generalization bounds for classification
From MaRDI portal
Recommendations
- 10.1162/153244303768966111
- Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins.
- Empirical margin distributions and bounding the generalization error of combined classifiers
- PAC-Bayes bounds for supervised classification
- A PAC-Bayesian margin bound for linear classifiers
Cited in
(16)- Classification accuracy based on observed margin
- Bounds on margin distributions in learning problems
- Empirical margin distributions and bounding the generalization error of combined classifiers
- Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins.
- Generalization bounds for averaged classifiers
- PAC-Bayes bounds for supervised classification
- Maximum relative margin and data-dependent regularization
- Distribution-dependent sample complexity of large margin learning
- 10.1162/153244303768966111
- Computable shell decomposition bounds
- Learning with decision lists of data-dependent features
- An improved analysis of the Rademacher data-dependent bound using its self bounding property
- A PAC-Bayesian margin bound for linear classifiers
- Optimal exponential bounds on the accuracy of classification
- Data-dependent bounds for multi-category classification based on convex losses.
- Learning Theory
This page was built for publication: Data-dependent margin-based generalization bounds for classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148816)
