Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Guyard, Théo"'
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 "pruni
Externí odkaz:
http://arxiv.org/abs/2406.03504
We introduce a new methodology dubbed ``safe peeling'' to accelerate the resolution of L0-regularized least-squares problems via a Branch-and-Bound (BnB) algorithm. Our procedure enables to tighten the convex relaxation considered at each node of the
Externí odkaz:
http://arxiv.org/abs/2302.14471
We present a novel screening methodology to safely discard irrelevant nodes within a generic branch-and-bound (BnB) algorithm solving the l0-penalized least-squares problem. Our contribution is a set of two simple tests to detect sets of feasible vec
Externí odkaz:
http://arxiv.org/abs/2110.07308
In this paper, we propose a procedure to accelerate the resolution of the well-known "Elastic-Net" problem. Our procedure is based on the (partial) identification of the solution support and the reformulation of the original problem into a problem of
Externí odkaz:
http://arxiv.org/abs/2110.07281