DeepAI AI Chat
Log In Sign Up

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

by   Shaojie Tang, et al.

In this paper, we study the non-monotone adaptive submodular maximization problem subject to a cardinality constraint. We first revisit the adaptive random greedy algorithm proposed in <cit.>, where they show that this algorithm achieves a 1/e approximation ratio if the objective function is adaptive submodular and pointwise submodular. It is not clear whether the same guarantee holds under adaptive submodularity (without resorting to pointwise submodularity) or not. Our first contribution is to show that the adaptive random greedy algorithm achieves a 1/e approximation ratio under adaptive submodularity. One limitation of the adaptive random greedy algorithm is that it requires O(n× k) value oracle queries, where n is the size of the ground set and k is the cardinality constraint. Our second contribution is to develop the first linear-time algorithm for the non-monotone adaptive submodular maximization problem. Our algorithm achieves a 1/e-ϵ approximation ratio (this bound is improved to 1-1/e-ϵ for monotone case), using only O(nϵ^-2logϵ^-1) value oracle queries. Notably, O(nϵ^-2logϵ^-1) is independent of the cardinality constraint.


page 1

page 2

page 3

page 4


Linear-Time Algorithms for Adaptive Submodular Maximization

In this paper, we develop fast algorithms for two stochastic submodular ...

Partial-Monotone Adaptive Submodular Maximization

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

Fast Evolutionary Algorithms for Maximization of Cardinality-Constrained Weakly Submodular Functions

We study the monotone, weakly submodular maximization problem (WSM), whi...

Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?

Submodular functions are a broad class of set functions, which naturally...

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

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

Stochastic-Greedy++: Closing the Optimality Gap in Exact Weak Submodular Maximization

Many problems in discrete optimization can be formulated as the task of ...

Submodular Maximization through the Lens of Linear Programming

The simplex algorithm for linear programming is based on the fact that a...