Strong NP-Hardness for Sparse Optimization with Concave Penalty FunctionsDownload PDFOpen Website

2017 (modified: 11 Nov 2022)ICML 2017Readers: Everyone
Abstract: Consider the regularized sparse minimization problem, which involves empirical sums of loss functions for $n$ data points (each of dimension $d$) and a nonconvex sparsity penalty. We prove that fin...
0 Replies

Loading