Convergence rates of generalization errors for margin-based classification

DOI10.1016/j.jspi.2008.11.011zbMath1162.62383OpenAlexW2015052585MaRDI QIDQ1021988

Changyi Park

Publication date: 9 June 2009

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2008.11.011

zbMATH Keywords

classificationempirical processstatistical learning theoryconvex and non-convex loss

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Fast convergence rates of deep neural networks for classification, Statistical analysis of kernel-based least-squares density-ratio estimation, Oracle properties of SCAD-penalized support vector machine, Generalization ability of fractional polynomial models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-Weighted Discrimination
• Fast rates for support vector machines using Gaussian kernels
• Fast learning rates for plug-in classifiers
• Convergence rate of sieve estimates
• Smooth discrimination analysis
• A note on margin-based loss functions in classification
• The covering number in learning theory
• On the Bayes-risk consistency of regularized boosting methods.
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Metric entropy of some classes of sets with differentiable boundaries
• Statistical performance of support vector machines
• Local Rademacher complexities
• On ψ-Learning
• Minimax nonparametric classification. II. Model selection for adaptation
• Convexity, Classification, and Risk Bounds
• Multicategory ψ-Learning