2023
Learning Sparse Group Models Through Boolean Relaxation
ICLR 2023top-25%
We introduce an efficient algorithmic framework for learning sparse group models formulated as the natural convex relaxation of a cardinality-constrained program with Boolean variables. We provide theoretical techniques to characterize the equivalent condition when the relaxation achieves the exact…