TY - JOUR
T1 - Robust chance-constrained support vector machines with second-order moment information
AU - Wang, Ximing
AU - Fan, Neng
AU - Pardalos, Panos M.
N1 - Funding Information:
We are grateful to Danial Kuhn and Berç Rustem for their valuable discussions. We would like to thank the anonymous reviewers for their helpful comments. Research was conducted at National Research University, Higher School of Economics, and supported by RSF grant 14-41-00039.
Publisher Copyright:
© 2015, Springer Science+Business Media New York.
PY - 2018/4/1
Y1 - 2018/4/1
N2 - Support vector machines (SVM) is one of the well known supervised classes of learning algorithms. Basic SVM models are dealing with the situation where the exact values of the data points are known. This paper studies SVM when the data points are uncertain. With some properties known for the distributions, chance-constrained SVM is used to ensure the small probability of misclassification for the uncertain data. As infinite number of distributions could have the known properties, the robust chance-constrained SVM requires efficient transformations of the chance constraints to make the problem solvable. In this paper, robust chance-constrained SVM with second-order moment information is studied and we obtain equivalent semidefinite programming and second order cone programming reformulations. The geometric interpretation is presented and numerical experiments are conducted. Three types of estimation errors for mean and covariance information are studied in this paper and the corresponding formulations and techniques to handle these types of errors are presented.
AB - Support vector machines (SVM) is one of the well known supervised classes of learning algorithms. Basic SVM models are dealing with the situation where the exact values of the data points are known. This paper studies SVM when the data points are uncertain. With some properties known for the distributions, chance-constrained SVM is used to ensure the small probability of misclassification for the uncertain data. As infinite number of distributions could have the known properties, the robust chance-constrained SVM requires efficient transformations of the chance constraints to make the problem solvable. In this paper, robust chance-constrained SVM with second-order moment information is studied and we obtain equivalent semidefinite programming and second order cone programming reformulations. The geometric interpretation is presented and numerical experiments are conducted. Three types of estimation errors for mean and covariance information are studied in this paper and the corresponding formulations and techniques to handle these types of errors are presented.
KW - Estimation errors
KW - Robust chance constraints
KW - Second order cone programming
KW - Second-order moment information
KW - Semidefinite programming
KW - Support vector machines
UR - http://www.scopus.com/inward/record.url?scp=84944595723&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84944595723&partnerID=8YFLogxK
U2 - 10.1007/s10479-015-2039-6
DO - 10.1007/s10479-015-2039-6
M3 - Article
AN - SCOPUS:84944595723
VL - 263
SP - 45
EP - 68
JO - Annals of Operations Research
JF - Annals of Operations Research
SN - 0254-5330
IS - 1-2
ER -