An improved approximation algorithm for maximizing a DR-submodular function over a convex set

03/28/2022
by   Donglei Du, et al.
0

Maximizing a DR-submodular function subject to a general convex set is an NP-hard problem arising from many applications in combinatorial optimization and machine learning. While it is highly desirable to design efficient approximation algorithms under this general setting where neither the objective function is monotonic nor the feasible set is down-closed, our main contribution is to present a 0.25-approximation Frank-Wolfe type of algorithm with a sub-exponential time-complexity under the value oracle model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2019

Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees

Diminishing-returns (DR) submodular optimization is an important field w...
research
09/25/2019

Online Non-Monotone DR-submodular Maximization

In this paper, we study problems at the interface of two important field...
research
07/13/2021

A Parallel Approximation Algorithm for Maximizing Submodular b-Matching

We design new serial and parallel approximation algorithms for computing...
research
10/12/2022

Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets

In recent years, maximization of DR-submodular continuous functions beca...
research
01/13/2022

Experimental Design Networks: A Paradigm for Serving Heterogeneous Learners under Networking Constraints

Significant advances in edge computing capabilities enable learning to o...
research
12/14/2018

Partial Function Extension with Applications to Learning and Property Testing

In partial function extension, we are given a partial function consistin...
research
05/26/2023

A Unified Approach for Maximizing Continuous DR-submodular Functions

This paper presents a unified approach for maximizing continuous DR-subm...

Please sign up or login with your details

Forgot password? Click here to reset