Théo Guyard — accepted AI-conference papers

2022

Node-Screening Tests For The L0-Penalized Least-Squares Problem

Théo Guyard, Cédric Herzet, Clément Elvira

ICASSP 2022accepted

We present a novel screening methodology to safely discard irrelevant nodes within a generic branch-and-bound (BnB) algorithm solving the ℓ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</inf> -penalized least-squares problem. Our contribution is a s…

Cited by 0 Source ↗Scholar ↗

2022

Screen & Relax: Accelerating The Resolution Of Elastic-Net By Safe Identification of The Solution Support

Théo Guyard, Cédric Herzet, Clément Elvira

ICASSP 2022accepted

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 reduced dimension. The identification of the supp…

Cited by 0 Source ↗Scholar ↗