Efficient Difference of Submodular Minimization via DC Programming Algorithms
Difference of submodular (DS) minimization can be equivalently formulated as the minimization of the difference of two convex (DC) functions. The authors introduce variants of the DC algorithm (DCA) and its complete form (CDCA) to efficiently solve the DC program corresponding to DS minimization, and establish new connections between the two problems to obtain stronger theoretical guarantees.