DeepAI AI Chat
Log In Sign Up

Linear-Time Algorithms for Adaptive Submodular Maximization

by   Shaojie Tang, et al.

In this paper, we develop fast algorithms for two stochastic submodular maximization problems. We start with the well-studied adaptive submodular maximization problem subject to a cardinality constraint. We develop the first linear-time algorithm which achieves a (1-1/e-ϵ) approximation ratio. Notably, the time complexity of our algorithm is O(nlog1/ϵ) (number of function evaluations) which is independent of the cardinality constraint, where n is the size of the ground set. Then we introduce the concept of fully adaptive submodularity, and develop a linear-time algorithm for maximizing a fully adaptive submoudular function subject to a partition matroid constraint. We show that our algorithm achieves a 1-1/e-ϵ/4-2/e-2ϵ approximation ratio using only O(nlog1/ϵ) number of function evaluations.


page 1

page 2

page 3

page 4


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

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

A log-linear time algorithm for constrained changepoint detection

Changepoint detection is a central problem in time series and genomic da...

Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint

We consider fast algorithms for monotone submodular maximization subject...

Faster Submodular Maximization for Several Classes of Matroids

The maximization of submodular functions have found widespread applicati...

Optimal Algorithm to Reconstruct a Tree from a Subtree Distance

This paper addresses the problem of finding a representation of a subtre...

Unconstrained Submodular Maximization with Constant Adaptive Complexity

In this paper, we consider the unconstrained submodular maximization pro...