Theo Guyard

A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized Problems

We consider the resolution of learning problems involving $\ell_0$-regularization via Branch-and- Bound (BnB) algorithms. These methods explore regions of the feasible space of the problem and check whether they do not contain solutions through “pruning tests”. In standard implementations, evaluatin…