DeepAI AI Chat
Log In Sign Up

The FAST Algorithm for Submodular Maximization

by   Adam Breuer, et al.
Harvard University

In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint k whose approximation ratio is arbitrarily close to 1-1/e, is O((n) ^2( k)) adaptive, and uses a total of O(n (k)) queries. Recent algorithms have comparable guarantees in terms of asymptotic worst case analysis, but their actual number of rounds and query complexity depend on very large constants and polynomials in terms of precision and confidence, making them impractical for large data sets. Our main contribution is a design that is extremely efficient both in terms of its non-asymptotic worst case query complexity and number of rounds, and in terms of its practical runtime. We show that this algorithm outperforms any algorithm for submodular maximization we are aware of, including hyper-optimized parallel versions of state-of-the-art serial algorithms, by running experiments on large data sets. These experiments show FAST is orders of magnitude faster than the state-of-the-art.


page 1

page 2

page 3

page 4


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

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

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

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

An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model

In this paper we study submodular maximization under a matroid constrain...

Very Fast Streaming Submodular Function Maximization

Data summarization has become a valuable tool in understanding even tera...

DASH: Distributed Adaptive Sequencing Heuristic for Submodular Maximization

The development of parallelizable algorithms for monotone, submodular ma...

Non-monotone Submodular Maximization in Exponentially Fewer Iterations

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