Practical Parallel Algorithms for Non-Monotone Submodular Maximization

by   Shuang Cui, et al.

Submodular maximization has found extensive applications in various domains within the field of artificial intelligence, including but not limited to machine learning, computer vision, and natural language processing. With the increasing size of datasets in these domains, there is a pressing need to develop efficient and parallelizable algorithms for submodular maximization. One measure of the parallelizability of a submodular maximization algorithm is its adaptive complexity, which indicates the number of sequential rounds where a polynomial number of queries to the objective function can be executed in parallel. In this paper, we study the problem of non-monotone submodular maximization subject to a knapsack constraint, and propose the first combinatorial algorithm achieving an (8+ϵ)-approximation under 𝒪(log n) adaptive complexity, which is optimal up to a factor of 𝒪(loglog n). Moreover, we also propose the first algorithm with both provable approximation ratio and sublinear adaptive complexity for the problem of non-monotone submodular maximization subject to a k-system constraint. As a by-product, we show that our two algorithms can also be applied to the special case of submodular maximization subject to a cardinality constraint, and achieve performance bounds comparable with those of state-of-the-art algorithms. Finally, the effectiveness of our approach is demonstrated by extensive experiments on real-world applications.


page 1

page 2

page 3

page 4


Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity

The growing need to deal with massive instances motivates the design of ...

Distributed Submodular Maximization

Many large-scale machine learning problems--clustering, non-parametric l...

Submodular Maximization under the Intersection of Matroid and Knapsack Constraints

Submodular maximization arises in many applications, and has attracted a...

Non-monotone Submodular Maximization in Exponentially Fewer Iterations

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

DASH: Distributed Adaptive Sequencing Heuristic for Submodular Maximization

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

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

Constrained submodular maximization problems encompass a wide variety of...

Efficient Algorithms for Monotone Non-Submodular Maximization with Partition Matroid Constraint

In this work, we study the problem of monotone non-submodular maximizati...

Please sign up or login with your details

Forgot password? Click here to reset