On the rate of convergence for multi-category classification based on convex losses
From MaRDI portal
Publication:2475308
DOI10.1007/s11425-007-0100-xzbMath1133.68393OpenAlexW2147892165MaRDI QIDQ2475308
Publication date: 11 March 2008
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-007-0100-x
Related Items
The convergence rates of Shannon sampling learning algorithms ⋮ The learning rate of \(l_2\)-coefficient regularized classification with strong loss ⋮ REGULARIZED LEAST SQUARE REGRESSION WITH SPHERICAL POLYNOMIAL KERNELS ⋮ 1D embedding multi-category classification methods ⋮ Error analysis of multicategory support vector machine classifiers ⋮ ANALYSIS OF CLASSIFICATION WITH A REJECT OPTION ⋮ Generalization performance of graph-based semi-supervised classification ⋮ ERROR ANALYSIS FOR THE SPARSE GRAPH-BASED SEMI-SUPERVISED CLASSIFICATION ALGORITHM
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Bayes-risk consistency of regularized boosting methods.
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Regularization networks and support vector machines
- The consistency of multicategory support vector machines
- 10.1162/15324430152733133
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- A PAC-Bayesian margin bound for linear classifiers
- 10.1162/1532443041424319
- 10.1162/153244303321897690
- 10.1162/153244304773936108
- Learning Theory and Kernel Machines
- Multicategory Support Vector Machines
- Convexity, Classification, and Risk Bounds
- On the learnability and design of output codes for multiclass problems