Dipartimento di Ingegneria informatica, automatica e gestionale

Support vector machines (SVMs) are well-studied supervised learning models for binary classification. Large amounts of samples can be cheaply and easily obtained in many applications. What is often a costly and error-prone process is to label these data points manually. Semi-supervised support vector machines (S3VMs) extend the well-known SVM classifiers to the semi-supervised approach, aiming to maximize the margin between samples in the presence of unlabeled data. By leveraging both labeled and unlabeled data, S3VMs attempt to achieve better accuracy and robustness than traditional SVMs. Unfortunately, the resulting optimization problem is non-convex and hence difficult to solve exactly. This paper presents a new branch-and-cut approach for S3VMs using semidefinite programming (SDP) relaxations. We apply optimality-based bound tightening to bound the feasible set. Box constraints allow us to include valid inequalities, strengthening the lower bound. The resulting SDP relaxation provides bounds that are significantly stronger than the ones available in the literature. For the upper bound, instead, we define a local search heuristic exploiting the solution of the SDP relaxation. Computational results highlight the algorithm’s efficiency, showing its capability to solve instances with ten times more data points than the ones solved in the literature.