资源分类
》 资源 》论文》Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice

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

2020-03-16 | |  77 |   52 |   0

Abstract

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 nonsubmodular function on the integer lattice subject to a cardinality constraint; these are the fi 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.

上一篇：Alternating Randomized Block Coordinate Descent

下一篇：Clustering Semi-Random Mixtures of Gaussians

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...