scientific article

zbMath1050.68055arXivmath/0405340MaRDI QIDQ3046695

Olivier Bousquet, Dmitriy Panchenko, Vladimir I. Koltchinskii

Publication date: 12 August 2004

Full work available at URL: https://arxiv.org/abs/math/0405340

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items

Complexity regularization via localized random penalties ⋮ Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) ⋮ Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets ⋮ Minimax rates for conditional density estimation via empirical entropy ⋮ Unnamed Item ⋮ On the optimality of the empirical risk minimization procedure for the convex aggregation problem ⋮ Empirical risk minimization is optimal for the convex aggregation problem ⋮ ERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labels ⋮ Aspects of discrete mathematics and probability in the theory of machine learning ⋮ Estimation from nonlinear observations via convex programming with application to bilinear regression ⋮ Concentration inequalities and asymptotic results for ratio type empirical processes ⋮ Theory of Classification: a Survey of Some Recent Advances ⋮ Differentiability of \(t\)-functionals of location and scatter ⋮ Rademacher complexity in Neyman-Pearson classification ⋮ Complexities of convex combinations and bounding the generalization error in classification ⋮ Local Rademacher complexities ⋮ Boosting with early stopping: convergence and consistency