Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity

08/19/2018
by   Matthew Fahrbach, et al.
0

As a generalization of many classic problems in combinatorial optimization, submodular optimization has found a wide range of applications in machine learning (e.g., in feature engineering and active learning). For many large-scale optimization problems, we are often concerned with the adaptivity complexity of an algorithm, which quantifies the number of sequential rounds where polynomially-many independent function evaluations can be executed in parallel. While low adaptivity is ideal, it is not sufficient for a distributed algorithm to be efficient, since in many practical applications of submodular optimization the number of function evaluations becomes prohibitively expensive. Motivated by such applications, we study the adaptivity and query complexity of non-monotone submodular optimization. We provide the first constant approximation algorithm for maximizing a non-monotone submodular function with cardinality constraint k that has nearly-optimal adaptivity complexity O((n)). Furthermore, our algorithm makes only O((k)) calls per element to the function evaluation oracle in expectation.

READ FULL TEXT
research
07/20/2018

Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity

As a generalization of many classic problems in combinatorial optimizati...
research
05/31/2021

On maximizing a monotone k-submodular function under a knapsack constraint

We study the problem of maximizing a monotone k-submodular function f un...
research
02/12/2021

Adaptive Sampling for Fast Constrained Maximization of Submodular Function

Several large-scale machine learning tasks, such as data summarization, ...
research
10/02/2018

Submodular Optimization in the MapReduce Model

Submodular optimization has received significant attention in both pract...
research
06/01/2023

Dynamic Algorithms for Matroid Submodular Maximization

Submodular maximization under matroid and cardinality constraints are cl...
research
02/21/2020

Ranking an Assortment of Products via Sequential Submodular Optimization

We study an optimization problem capturing a core operational question f...
research
08/19/2021

Parallel Quasi-concave set optimization: A new frontier that scales without needing submodularity

Classes of set functions along with a choice of ground set are a bedrock...

Please sign up or login with your details

Forgot password? Click here to reset