Maximizing Sums of Non-monotone Submodular and Linear Functions: Understanding the Unconstrained Case

04/07/2022
by   Kobi Bodek, et al.
0

Motivated by practical applications, recent works have considered maximization of sums of a submodular function g and a linear function ℓ. Almost all such works, to date, studied only the special case of this problem in which g is also guaranteed to be monotone. Therefore, in this paper we systematically study the simplest version of this problem in which g is allowed to be non-monotone, namely the unconstrained variant, which we term Regularized Unconstrained Submodular Maximization (RegularizedUSM). Our main algorithmic result is the first non-trivial guarantee for general RegularizedUSM. For the special case of RegularizedUSM in which the linear function ℓ is non-positive, we prove two inapproximability results, showing that the algorithmic result implied for this case by previous works is not far from optimal. Finally, we reanalyze the known Double Greedy algorithm to obtain improved guarantees for the special case of RegularizedUSM in which the linear function ℓ is non-negative; and we complement these guarantees by showing that it is not possible to obtain (1/2, 1)-approximation for this case (despite intuitive arguments suggesting that this approximation guarantee is natural).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2022

On Maximizing Sums of Non-monotone Submodular and Linear Functions

We study the problem of Regularized Unconstrained Submodular Maximizatio...
research
07/15/2021

Multilinear extension of k-submodular functions

A k-submodular function is a function that given k disjoint subsets outp...
research
04/23/2022

Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-Approximation

In this work we give two new algorithms that use similar techniques for ...
research
04/19/2019

Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications

It is generally believed that submodular functions -- and the more gener...
research
11/15/2018

Unconstrained Submodular Maximization with Constant Adaptive Complexity

In this paper, we consider the unconstrained submodular maximization pro...
research
02/18/2020

A note on maximizing the difference between a monotone submodular function and a linear function

Motivated by team formation applications, we study discrete optimization...
research
07/05/2021

Feature Cross Search via Submodular Optimization

In this paper, we study feature cross search as a fundamental primitive ...

Please sign up or login with your details

Forgot password? Click here to reset