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

ICML 2018 · Kuhnle Alan, Smith J. David, Crawford Victoria G., Thai My T. ·

The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a non-submodular function on the integer lattice subject to a cardinality constraint; these are the first algorithms for this purpose that have polynomial query complexity. We propose a general framework for influence maximization on the integer lattice that generalizes prior works on this topic, and we demonstrate the efficiency of our algorithms in this context.

PDF Abstract ICML 2018 PDF ICML 2018 Abstract

Code

Add Remove Mark official

emallson/lace official

Datasets

Add Datasets introduced or used in this paper

Edit Social Preview

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

Code Edit Add Remove Mark official

Categories

Datasets Edit

Code

Add Remove Mark official

Datasets