Optimal exponential bounds on the accuracy of classification

DOI10.1007/S00365-014-9229-3zbMATH Open1304.62056OpenAlexW2187047180MaRDI QIDQ485316FDOQ485316

Authors: Gérard Kerkyacharian, Alexandre B. Tsybakov, V. N. Temlyakov, Dominique Picard, Vladimir Koltchinskii 

Publication date: 9 January 2015

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: http://crest.science/RePEc/wpstorage/2013-39.pdf

Recommendations

• Learning Theory
• Risk bounds for statistical learning
• Empirical margin distributions and bounding the generalization error of combined classifiers
• On exponential bounds on the Bayes risk of the kernel classification rule
• scientific article; zbMATH DE number 1804114

zbMATH Keywords

classificationstatistical learningoptimal rate of convergenceBahadur efficiencyfast ratesmargin conditionexcess risk

Mathematics Subject Classification ID

Density estimation (62G07) Nonparametric regression and quantile regression (62G08) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Pattern recognition, speech recognition (68T10)

Cites Work

• Weak convergence and empirical processes. With applications to statistics
• Introduction to nonparametric estimation
• Title not available (Why is that?)
• Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
• Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
• Uniform Central Limit Theorems
• Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
• Title not available (Why is that?)
• Convexity, Classification, and Risk Bounds
• Approximation methods for supervised learning
• Optimal aggregation of classifiers in statistical learning.
• Minimax nonparametric classification .I. Rates of convergence
• Fast learning rates for plug-in classifiers
• Fast rates for support vector machines using Gaussian kernels
• Approximation in learning theory
• Risk bounds for statistical learning
• Square root penalty: Adaption to the margin in classification and in edge estimation
• 10.1162/1532443041424319

Cited In (8)

• Title not available (Why is that?)
• Relationship between the accuracy of classifier error estimation and complexity of decision boundary
• Accuracy of regularized D-rule for binary classification
• Speculate-correct error bounds for \(k\)-nearest neighbor classifiers
• On exponential bounds on the Bayes risk of the kernel classification rule
• A microchoice bound for continuous-space classification algorithms
• Learning Theory
• A minimax framework for quantifying risk-fairness trade-off in regression

This page was built for publication: Optimal exponential bounds on the accuracy of classification

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