Log In Sign Up

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel

by   Yixin Chen, et al.

For the problem of maximizing a monotone, submodular function with respect to a cardinality constraint k on a ground set of size n, we provide an algorithm that achieves the state-of-the-art in both its empirical performance and its theoretical properties, in terms of adaptive complexity, query complexity, and approximation ratio; that is, it obtains, with high probability, query complexity of O(n) in expectation, adaptivity of O(log(n)), and approximation ratio of nearly 1-1/e. The main algorithm is assembled from two components which may be of independent interest. The first component of our algorithm, LINEARSEQ, is useful as a preprocessing algorithm to improve the query complexity of many algorithms. Moreover, a variant of LINEARSEQ is shown to have adaptive complexity of O( log (n / k) ) which is smaller than that of any previous algorithm in the literature. The second component is a parallelizable thresholding procedure THRESHOLDSEQ for adding elements with gain above a constant threshold. Finally, we demonstrate that our main algorithm empirically outperforms, in terms of runtime, adaptive rounds, total queries, and objective values, the previous state-of-the-art algorithm FAST in a comprehensive evaluation with six submodular objective functions.


page 1

page 2

page 3

page 4


Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization

We study parallelizable algorithms for maximization of a submodular func...

The FAST Algorithm for Submodular Maximization

In this paper we describe a new algorithm called Fast Adaptive Sequencin...

Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity

As a generalization of many classic problems in combinatorial optimizati...

Parallel Algorithm for Non-Monotone DR-Submodular Maximization

In this work, we give a new parallel algorithm for the problem of maximi...

On the Complexity of Dynamic Submodular Maximization

We study dynamic algorithms for the problem of maximizing a monotone sub...

Estimating the Effective Support Size in Constant Query Complexity

Estimating the support size of a distribution is a well-studied problem ...

Streaming Algorithms for Cardinality-Constrained Maximization of Non-Monotone Submodular Functions in Linear Time

For the problem of maximizing a nonnegative, (not necessarily monotone) ...