On the rate of convergence for multi-category classification based on convex losses

摘要

The multi-category classification algorithms play an important role in both theory and practice of machine learning. In this paper, we consider an approach to the multi-category classification based on minimizing a convex surrogate of the nonstandard misclassification loss. We bound the excess misclassification error by the excess convex risk. We construct an adaptive procedure to search the classifier and furthermore obtain its convergence rate to the Bayes rule.