Node-screening tests for l0-penalized least-squares problem with supplementary material - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Node-screening tests for l0-penalized least-squares problem with supplementary material

(1, 2, 3) , (2) , (4)
1
2
3
4

Abstract

We present a novel screening methodology to safely discard irrelevant nodes within a generic branch-and-bound (BnB) algorithm solving the ℓ 0-penalized least-squares problem. Our contribution is a set of two simple tests to detect sets of feasible vectors that cannot yield optimal solutions. This allows to prune nodes of the BnB exploration tree, thus reducing the overall solution time. One cornerstone of our contribution is a nesting property between tests at different nodes that allows to implement screening at low computational cost. Our work leverages the concept of safe screening, well known for sparsity-inducing convex problems, and some recent advances in this field for ℓ 0-penalized regression problems.
Fichier principal
Vignette du fichier
2110.07308v1.pdf (166.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03462171 , version 1 (01-12-2021)

Identifiers

  • HAL Id : hal-03462171 , version 1

Cite

Théo Guyard, Cédric Herzet, Clément Elvira. Node-screening tests for l0-penalized least-squares problem with supplementary material. 2021. ⟨hal-03462171⟩
76 View
41 Download

Share

Gmail Facebook Twitter LinkedIn More