Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint

by   Shinsaku Sakaue, et al.

Submodular maximization with a cardinality constraint can model various problems, and those problems are often very large in practice. For the case where objective functions are monotone, many fast approximation algorithms have been developed. The stochastic greedy algorithm (SG) is one such algorithm, which is widely used thanks to its simplicity, efficiency, and high empirical performance. However, its approximation guarantee has been proved only for monotone objective functions. When it comes to non-monotone objective functions, existing approximation algorithms are inefficient relative to the fast algorithms developed for the case of monotone objectives. In this paper, we prove that SG (with slight modification) can achieve almost 1/4-approximation guarantees in expectation in linear time even for non-monotone objective functions. Our result provides a constant-factor approximation algorithm with the fewest oracle queries for non-monotone submodular maximization with a cardinality constraint. Experiments confirm that (modified) SG can run far faster than and achieve as good objective values as existing algorithms.



There are no comments yet.


page 1

page 2

page 3

page 4


Approximation Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with a Size Constraint

The stochastic greedy algorithm (SG) is a randomized version of the gree...

Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint

Monotone submodular maximization with a knapsack constraint is NP-hard. ...

Randomized Strategies for Robust Combinatorial Optimization

In this paper, we study the following robust optimization problem. Given...

Maximizing diversity over clustered data

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

Unified greedy approximability beyond submodular maximization

We consider classes of objective functions of cardinality constrained ma...

Planning with Submodular Objective Functions

We study planning with submodular objective functions, where instead of ...

Differentiable Greedy Submodular Maximization with Guarantees and Gradient Estimators

We consider making outputs of the greedy algorithm for monotone submodul...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.