More by Dimitris Bertsimas

More by Angela King

More by Rahul Mazumder

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the
full text of this article because we are not able to identify you as
a subscriber. If you have a personal subscription to this journal,
then please login. If you are already logged in, then you may need
to update your profile to register your subscription. Read more about accessing full-text

Abstract

In the period 1991–2015, algorithmic advances in Mixed Integer Optimization (MIO) coupled with hardware improvements have resulted in an astonishing 450 billion factor speedup in solving MIO problems. We present a MIO approach for solving the classical best subset selection problem of choosing $k$ out of $p$ features in linear regression given $n$ observations. We develop a discrete extension of modern first-order continuous optimization methods to find high quality feasible solutions that we use as warm starts to a MIO solver that finds provably optimal solutions. The resulting algorithm (a) provides a solution with a guarantee on its suboptimality even if we terminate the algorithm early, (b) can accommodate side constraints on the coefficients of the linear regression and (c) extends to finding best subset solutions for the least absolute deviation loss function. Using a wide variety of synthetic and real datasets, we demonstrate that our approach solves problems with $n$ in the 1000s and $p$ in the 100s in minutes to provable optimality, and finds near optimal solutions for $n$ in the 100s and $p$ in the 1000s in minutes. We also establish via numerical experiments that the MIO approach performs better than Lasso and other popularly used sparse learning procedures, in terms of achieving sparse solutions with good predictive power.

Supplemental materials

Supplement to “Best subset selection via a modern optimization lens”. Supporting technical material and additional experimental results including some figures and tables are presented in the supplementary material section.