In:
Mathematical Methods of Operations Research, Springer Science and Business Media LLC, Vol. 96, No. 3 ( 2022-12), p. 315-350
Kurzfassung:
Support vector classification (SVC) is a classical and well-performed learning method for classification problems. A regularization parameter, which significantly affects the classification performance, has to be chosen and this is usually done by the cross-validation procedure. In this paper, we reformulate the hyperparameter selection problem for support vector classification as a bilevel optimization problem in which the upper-level problem minimizes the average number of misclassified data points over all the cross-validation folds, and the lower-level problems are the $$l_1$$ l 1 -loss SVC problems, with each one for each fold in T-fold cross-validation. The resulting bilevel optimization model is then converted to a mathematical program with equilibrium constraints (MPEC). To solve this MPEC, we propose a global relaxation cross-validation algorithm (GR–CV) based on the well-know Sholtes-type global relaxation method (GRM). It is proven to converge to a C-stationary point. Moreover, we prove that the MPEC-tailored version of the Mangasarian–Fromovitz constraint qualification (MFCQ), which is a key property to guarantee the convergence of the GRM, automatically holds at each feasible point of this MPEC. Extensive numerical results verify the efficiency of the proposed approach. In particular, compared with other methods, our algorithm enjoys superior generalization performance over almost all the data sets used in this paper.
Materialart:
Online-Ressource
ISSN:
1432-2994
,
1432-5217
DOI:
10.1007/s00186-022-00798-6
Sprache:
Englisch
Verlag:
Springer Science and Business Media LLC
Publikationsdatum:
2022
ZDB Id:
246737-9
ZDB Id:
1459420-1
ZDB Id:
184108-7
ZDB Id:
1310695-8
SSG:
3,2
Permalink