DeepAI AI Chat
Log In Sign Up

Parallel Algorithm for Non-Monotone DR-Submodular Maximization

by   Alina Ene, et al.
Boston University
Princeton University

In this work, we give a new parallel algorithm for the problem of maximizing a non-monotone diminishing returns submodular function subject to a cardinality constraint. For any desired accuracy ϵ, our algorithm achieves a 1/e - ϵ approximation using O(n(1/ϵ) / ϵ^3) parallel rounds of function evaluations. The approximation guarantee nearly matches the best approximation guarantee known for the problem in the sequential setting and the number of parallel rounds is nearly-optimal for any constant ϵ. Previous algorithms achieve worse approximation guarantees using Ω(^2n) parallel rounds. Our experimental evaluation suggests that our algorithm obtains solutions whose objective value nearly matches the value obtained by the state of the art sequential algorithms, and it outperforms previous parallel algorithms in number of parallel rounds, iterations, and solution quality.


page 1

page 2

page 3

page 4


Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time

In this paper, we study the tradeoff between the approximation guarantee...

A Parallel Double Greedy Algorithm for Submodular Maximization

We study parallel algorithms for the problem of maximizing a non-negativ...

Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity

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

Submodular Maximization with Packing Constraints in Parallel

We consider the problem of maximizing the multilinear extension of a sub...

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

For the problem of maximizing a monotone, submodular function with respe...

Non-monotone Submodular Maximization in Exponentially Fewer Iterations

In this paper we consider parallelization for applications whose objecti...

Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint

We consider fast algorithms for monotone submodular maximization subject...