Randomized Algorithms for Monotone Submodular Function Maximization on the Integer Lattice

11/19/2021
by   Alberto Schiabel, et al.
0

Optimization problems with set submodular objective functions have many real-world applications. In discrete scenarios, where the same item can be selected more than once, the domain is generalized from a 2-element set to a bounded integer lattice. In this work, we consider the problem of maximizing a monotone submodular function on the bounded integer lattice subject to a cardinality constraint. In particular, we focus on maximizing DR-submodular functions, i.e., functions defined on the integer lattice that exhibit the diminishing returns property. Given any epsilon > 0, we present a randomized algorithm with probabilistic guarantees of O(1 - 1/e - epsilon) approximation, using a framework inspired by a Stochastic Greedy algorithm developed for set submodular functions by Mirzasoleiman et al. We then show that, on synthetic DR-submodular functions, applying our proposed algorithm on the integer lattice is faster than the alternatives, including reducing a target problem to the set domain and then applying the fastest known set submodular maximization algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2016

Maximizing Non-Monotone DR-Submodular Functions with Cardinality Constraints

We consider the problem of maximizing a non-monotone DR-submodular funct...
research
05/17/2018

Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice

The optimization of submodular functions on the integer lattice has rece...
research
12/13/2022

Profit Maximization in Social Networks and Non-monotone DR-submodular Maximization

In this paper, we study the non-monotone DR-submodular function maximiza...
research
06/01/2020

From Sets to Multisets: Provable Variational Inference for Probabilistic Integer Submodular Models

Submodular functions have been studied extensively in machine learning a...
research
06/27/2016

A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns

A function f: Z_+^E →R_+ is DR-submodular if it satisfies f( + χ_i) -f (...
research
04/12/2020

Continuous Profit Maximization: A Study of Unconstrained Dr-submodular Maximization

Profit maximization (PM) is to select a subset of users as seeds for vir...

Please sign up or login with your details

Forgot password? Click here to reset