An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation

by   Eric Balkanski, et al.

In this paper we study the adaptivity of submodular maximization. Adaptivity quantifies the number of sequential rounds that an algorithm makes when function evaluations can be executed in parallel. Adaptivity is a fundamental concept that is heavily studied across a variety of areas in computer science, largely due to the need for parallelizing computation. For the canonical problem of maximizing a monotone submodular function under a cardinality constraint, it is well known that a simple greedy algorithm achieves a 1-1/e approximation and that this approximation is optimal for polynomial-time algorithms. Somewhat surprisingly, despite extensive efforts on submodular optimization for large-scale datasets, until very recently there was no known algorithm that achieves a constant factor approximation for this problem whose adaptivity is sublinear in the size of the ground set n. Recent work by Balkanski and Singer describes an algorithm that obtains an approximation arbitrarily close to 1/3 in O( n) adaptive rounds and shows that no algorithm can obtain a constant factor approximation in õ( n) adaptive rounds. This approach achieves an exponential speedup in adaptivity (and parallel running time) at the expense of approximation quality. In this paper we describe a novel approach that yields an algorithm whose approximation is arbitrarily close to the optimal 1-1/e guarantee in O( n) adaptive rounds. This algorithm therefore achieves an exponential speedup in parallel running time for submodular maximization at the expense of an arbitrarily small loss in approximation quality. This guarantee is optimal in both approximation and adaptivity, up to lower order terms.


page 1

page 2

page 3

page 4


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...

Non-monotone Submodular Maximization in Exponentially Fewer Iterations

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

Fast Parallel Algorithms for Feature Selection

In this paper, we analyze a fast parallel algorithm to efficiently selec...

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

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

Parallel Algorithm for Non-Monotone DR-Submodular Maximization

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

Maximizing diversity over clustered data

Maximum diversity aims at selecting a diverse set of high-quality object...

Scaling the Indian Buffet Process via Submodular Maximization

Inference for latent feature models is inherently difficult as the infer...

Please sign up or login with your details

Forgot password? Click here to reset