Cover-based combinatorial bounds on probability of overfitting

DOI10.1134/S1064562414020136MaRDI QIDQ461903zbMATH OpenOpenAlexFDO

Authors A. I. Frey, I. O. Tolstikhin

Publication date 15 October 2014

Published in Doklady Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1064562414020136

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial probability (60C05)

Recommendations

• Tight bounds for the probability of overfitting
• On overfitting of classifiers making a lattice
• Combinatorial bounds of overfitting for threshold classifiers
• Combinatorial bounds for learning performance
• Empirical margin distributions and bounding the generalization error of combined classifiers

Cites work

• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Theory of Classification: a Survey of Some Recent Advances
• Tight bounds for the probability of overfitting

Cited in

(3)

• On overfitting of classifiers making a lattice
• Combinatorial bounds of overfitting for threshold classifiers
• Tight bounds for the probability of overfitting

This page was built for publication: Cover-based combinatorial bounds on probability of overfitting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q461903)