We extend the work of Narasimhan and Bilmes [32] for minimizing set functions representable as a difference between submodular functions. Similar to [32] , our new algorithms are guaranteed to monotonically reduce the objective function at every step. We empirically and theoretically show that the per-iteration cost of our algorithms is much less than [32] , and our algorithms can be used to efficiently minimize a difference between submodular functions under various combinatorial constraints, a problem not previously addressed. We provide computational bounds and a hardness result on the multiplicative inapproximability of minimizing the difference between submodular functions. We show, however, that it is possible to give worst-case additive bounds by providing a polynomial time computable lower-bound on the minima. Finally we show how a number of machine learning problems can be modeled as minimizing the difference between submodular functions. We experimentally show the validity of our algorithms by testing them on the problem of feature selection with submodular cost features.
Iyer and Bilmes REF investigated optimizing the difference between two submodular functions.
Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications
UAI-2012
Computer Science Mathematics