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

Theo Guyard; Cedric Herzet; Clément Elvira; Ayse-Nur Arslan

2024 ICML ICML 2024

A New Branch-and-Bound Pruning Framework for ℓ_0-Regularized Problems

Abstract

No abstract available. No abstract was captured for this paper when its proceedings were scraped - most often an older edition published without one online. How the corpus is built.

🌉 Interdisciplinary Bridge - Artificial Intelligence and Mathematics & Optimization

Authors

Theo Guyard, Cedric Herzet, Clément Elvira, Ayse-Nur Arslan

Topics

Machine Learning > Optimization & Theory > Optimization Mathematics & Optimization > Optimization > Combinatorial Optimization Mathematics & Optimization > Optimization > Sparse Optimization

Keywords

convex optimization branch and bound feasible space machine-learning applications pruning tests ∑0-regularization

Download PDF