A New Branch-and-Bound Pruning Framework for ${\ell }_0$-Regularized Problems

Theo Guyard, Cédric Herzet, Clément Elvira +1

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…