Sparse weighted voting classifier selection and its linear programming relaxations

We consider the problem of minimizing the number of misclassifications of a weighted voting classifier, plus a penalty proportional to the number of nonzero weights. We first prove that its optimum is at least as hard to approximate as the minimum disagreement halfspace problem for a wide range of penalty parameter values. After formulating the problem as a mixed integer program (MIP), we show that common “soft margin” linear programming (LP) formulations for constructing weighted voting classsifiers are equivalent to an LP relaxation of our formulation. We show that this relaxation is very weak, with a potentially exponential integrality gap. However, we also show that augmenting the relaxation with certain valid inequalities tightens it considerably, yielding a linear upper bound on the gap for all values of the penalty parameter that exceed a reasonable threshold. Unlike earlier techniques proposed for similar problems (Bradley and Mangasarian (1998) [4], Weston et al. (2003) [14]), our approach provides bounds on the optimal solution value.

► We define the sparse weighted voting classivier (SWVC) problem.
► We show SWVC is as hard to approximate as MDH for a large class of input parameters.
► We formulate SWVC as a MIP and show that the “soft margin” LP is a relaxation.
► We prove that the LP relaxation of the MIP has an exponential integrality gap.
► We suggest cutting planes to provably tighten the gap.