Linear Algorithms for Robust and Scalable Nonparametric Multiclass Probability Estimation

• Published in: Journal of Data Science Vol. 21; no. 4; pp. 658 - 680
• Main Authors: Zeng, Liyun, Zhang, Hao Helen
• Format: Journal Article
• Language: English
• Published: 中華資料採礦協會 01.10.2023
• Subjects: probability estimation; linear time algorithm; support vector machines; multiclass classification; non-parametric; scalability
• ISSN: 1683-8602; 1680-743X; 1683-8602
• DOI: 10.6339/22-JDS1069

Multiclass probability estimation is the problem of estimating conditional probabilities of a data point belonging to a class given its covariate information. It has broad applications in statistical analysis and data science. Recently a class of weighted Support Vector Machines (wSVMs) has been developed to estimate class probabilities through ensemble learning for K-class problems (Wu et al., 2010; Wang et al., 2019), where K is the number of classes. The estimators are robust and achieve high accuracy for probability estimation, but their learning is implemented through pairwise coupling, which demands polynomial time in K. In this paper, we propose two new learning schemes, the baseline learning and the One-vs-All (OVA) learning, to further improve wSVMs in terms of computational efficiency and estimation accuracy. In particular, the baseline learning has optimal computational complexity in the sense that it is linear in K. Though not the most efficient in computation, the OVA is found to have the best estimation accuracy among all the procedures under comparison. The resulting estimators are distribution-free and shown to be consistent. We further conduct extensive numerical experiments to demonstrate their finite sample performance.