Sharpness estimation of combinatorial generalization ability bounds for threshold decision rules
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3664426 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- A decision-theoretic generalization of on-line learning and an application to boosting
- Combinatorial bounds of overfitting for threshold classifiers
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Probability Inequalities for Sums of Bounded Random Variables
- Theory of Classification: a Survey of Some Recent Advances
- Tight bounds for the probability of overfitting
- Understanding machine learning. From theory to algorithms
This page was built for publication: Sharpness estimation of combinatorial generalization ability bounds for threshold decision rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2034842)