Sharpness estimation of combinatorial generalization ability bounds for threshold decision rules
From MaRDI portal
Publication:2034842
DOI10.1134/S0005117921050106zbMath1466.91088OpenAlexW3172188850MaRDI QIDQ2034842
Sh. Kh. Ishkina, K. V. Vorontsov
Publication date: 23 June 2021
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117921050106
generalization abilitycombinatorial theoryRademacher complexitycomplete cross-validationprobability of overfittingthreshold classifier
Uses Software
Cites Work
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Tight bounds for the probability of overfitting
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- A decision-theoretic generalization of on-line learning and an application to boosting
- Theory of Classification: a Survey of Some Recent Advances
- Combinatorial bounds of overfitting for threshold classifiers
- Probability Inequalities for Sums of Bounded Random Variables
- Understanding Machine Learning
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Unnamed Item
- Unnamed Item
This page was built for publication: Sharpness estimation of combinatorial generalization ability bounds for threshold decision rules
