Optimal approximation for unconstrained non-submodular minimizationDownload PDFOpen Website

2020 (modified: 09 Jan 2023)ICML 2020Readers: Everyone
Abstract: Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Ba...
0 Replies

Loading