Regularized Submodular Maximization at Scale

In this paper, we propose scalable methods for maximizing a regularized submodular function f = g - ℓ expressed as the difference between a monotone submodular function g and a modular function ℓ. Indeed, submodularity is inherently related to the notions of diversity, coverage, and representativeness. In particular, finding the mode of many popular probabilistic models of diversity, such as determinantal point processes, submodular probabilistic models, and strongly log-concave distributions, involves maximization of (regularized) submodular functions. Since a regularized function f can potentially take on negative values, the classic theory of submodular maximization, which heavily relies on the non-negativity assumption of submodular functions, may not be applicable. To circumvent this challenge, we develop the first one-pass streaming algorithm for maximizing a regularized submodular function subject to a k-cardinality constraint. It returns a solution S with the guarantee that f(S)≥(φ-2-ε) · g(OPT)-ℓ (OPT), where φ is the golden ratio. Furthermore, we develop the first distributed algorithm that returns a solution S with the guarantee that mathbbE[f(S)] ≥ (1-ε) [(1-e-1) · g(OPT)-ℓ(OPT)] in O(1/ ε) rounds of MapReduce computation, without keeping multiple copies of the entire dataset in each round (as it is usually done). We should highlight that our result, even for the unregularized case where the modular term ℓ is zero, improves the memory and communication complexity of the existing work by a factor of O(1/ ε) while arguably provides a simpler distributed algorithm and a unifying analysis. We also empirically study the performance of our scalable methods on a set of real-life applications, including finding the mode of distributions, data summarization, and product recommendation.