DeepAI AI Chat
Log In Sign Up

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

by   Georgios Amanatidis, et al.

Constrained submodular maximization problems encompass a wide variety of applications, including personalized recommendation, team formation, and revenue maximization via viral marketing. The massive instances occurring in modern day applications can render existing algorithms prohibitively slow, while frequently, those instances are also inherently stochastic. Focusing on these challenges, we revisit the classic problem of maximizing a (possibly non-monotone) submodular function subject to a knapsack constraint. We present a simple randomized greedy algorithm that achieves a 5.83 approximation and runs in O(n log n) time, i.e., at least a factor n faster than other state-of-the-art algorithms. The robustness of our approach allows us to further transfer it to a stochastic version of the problem. There, we obtain a 9-approximation to the best adaptive policy, which is the first constant approximation for non-monotone objectives. Experimental evaluation of our algorithms showcases their improved performance on real and synthetic data.


page 1

page 2

page 3

page 4


Partial-Monotone Adaptive Submodular Maximization

Many sequential decision making problems, including pool-based active le...

Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization in Linear Time

In this paper, we study the non-monotone adaptive submodular maximizatio...

Practical Parallel Algorithms for Non-Monotone Submodular Maximization

Submodular maximization has found extensive applications in various doma...

Improved Deterministic Algorithms for Non-monotone Submodular Maximization

Submodular maximization is one of the central topics in combinatorial op...

Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint

This work, for the first time, introduces two constant factor approximat...

Algorithmic Meta-Theorems for Monotone Submodular Maximization

We consider a monotone submodular maximization problem whose constraint ...

A k-hop Collaborate Game Model: Extended to Community Budgets and Adaptive Non-Submodularity

Revenue maximization (RM) is one of the most important problems on onlin...