Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2020
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913236514766848 |
|---|---|
| author | Amanatidis, Georgios Fusco, Federico Lazos, Philip Leonardi, Stefano Reiffenhäuser, Rebecca |
| author_facet | Amanatidis, Georgios Fusco, Federico Lazos, Philip Leonardi, Stefano Reiffenhäuser, Rebecca |
| contents | Constrained submodular maximization problems encompass a wide variety of applications, including personalized recommendation, team formation, and revenue maximization via viral marketing. The massive instances occurring in modern day applications can render existing algorithms prohibitively slow, while frequently, those instances are also inherently stochastic. Focusing on these challenges, we revisit the classic problem of maximizing a (possibly non-monotone) submodular function subject to a knapsack constraint. We present a simple randomized greedy algorithm that achieves a $5.83$ approximation and runs in $O(n \log n)$ time, i.e., at least a factor $n$ faster than other state-of-the-art algorithms. The robustness of our approach allows us to further transfer it to a stochastic version of the problem. There, we obtain a 9-approximation to the best adaptive policy, which is the first constant approximation for non-monotone objectives. Experimental evaluation of our algorithms showcases their improved performance on real and synthetic data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2007_05014 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint Amanatidis, Georgios Fusco, Federico Lazos, Philip Leonardi, Stefano Reiffenhäuser, Rebecca Data Structures and Algorithms Machine Learning Constrained submodular maximization problems encompass a wide variety of applications, including personalized recommendation, team formation, and revenue maximization via viral marketing. The massive instances occurring in modern day applications can render existing algorithms prohibitively slow, while frequently, those instances are also inherently stochastic. Focusing on these challenges, we revisit the classic problem of maximizing a (possibly non-monotone) submodular function subject to a knapsack constraint. We present a simple randomized greedy algorithm that achieves a $5.83$ approximation and runs in $O(n \log n)$ time, i.e., at least a factor $n$ faster than other state-of-the-art algorithms. The robustness of our approach allows us to further transfer it to a stochastic version of the problem. There, we obtain a 9-approximation to the best adaptive policy, which is the first constant approximation for non-monotone objectives. Experimental evaluation of our algorithms showcases their improved performance on real and synthetic data. |
| title | Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint |
| topic | Data Structures and Algorithms Machine Learning |
| url | https://arxiv.org/abs/2007.05014 |