Computable shell decomposition bounds

MaRDI QIDQ3093193zbMATH OpenFDO

Authors John Langford, David Allen McAllester

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v5/langford04a.html

zbMATH Keywords

classificationsample complexityshell boundstrue error bounds

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1804114
• 10.1162/153244303768966111
• Making Vapnik-Chervonenkis bounds accurate
• 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

Cited in

(4)

• Shellings and the lower bound theorem
• Microchoice bounds and self bounding learning algorithms
• Shellings from relative shellings, with an application to NP-completeness
• Human action segmentation and recognition using discriminative semi-Markov models

This page was built for publication: Computable shell decomposition bounds

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