Efficient Submodular Optimization under Noise: Local Search is Robust

10/21/2022
by   Lingxiao Huang, et al.
0

The problem of monotone submodular maximization has been studied extensively due to its wide range of applications. However, there are cases where one can only access the objective function in a distorted or noisy form because of the uncertain nature or the errors involved in the evaluation. This paper considers the problem of constrained monotone submodular maximization with noisy oracles introduced by [Hassidim et al., 2017]. For a cardinality constraint, we propose an algorithm achieving a near-optimal (1-1/e-O(ε))-approximation guarantee (for arbitrary ε > 0) with only a polynomial number of queries to the noisy value oracle, which improves the exponential query complexity of [Singer et al., 2018]. For general matroid constraints, we show the first constant approximation algorithm in the presence of noise. Our main approaches are to design a novel local search framework that can handle the effect of noise and to construct certain smoothing surrogate functions for noise reduction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/27/2019

Improved randomized algorithm for k-submodular function maximization

Submodularity is one of the most important properties in combinatorial o...
research
11/17/2017

Multi-Objective Maximization of Monotone Submodular Functions with Cardinality Constraint

We consider the problem of multi-objective maximization of monotone subm...
research
11/30/2017

Submodular Maximization through the Lens of Linear Programming

The simplex algorithm for linear programming is based on the fact that a...
research
01/12/2016

Submodular Optimization under Noise

We consider the problem of maximizing a monotone submodular function und...
research
10/09/2018

Guess Free Maximization of Submodular and Linear Sums

We consider the problem of maximizing the sum of a monotone submodular f...
research
06/26/2019

Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint

In this paper we consider the problem of maximizing a non-negative submo...
research
07/09/2019

Stochastic Monotone Submodular Maximization with Queries

We study a stochastic variant of monotone submodular maximization proble...

Please sign up or login with your details

Forgot password? Click here to reset