Adversarially Robust Submodular Maximization under Knapsack Constraints

7 May 2019

Papers citing "Adversarially Robust Submodular Maximization under Knapsack Constraints"

6 / 6 papers shown

Title
Fully Dynamic Submodular Maximization over Matroids Paul Dutting Federico Fusco Silvio Lattanzi A. Norouzi-Fard Morteza Zadimoghaddam 71 9 0 31 May 2023
Deletion Robust Non-Monotone Submodular Maximization over Matroids Paul Dutting Federico Fusco Silvio Lattanzi A. Norouzi-Fard Morteza Zadimoghaddam 68 3 0 16 Aug 2022
Deletion Robust Submodular Maximization over Matroids Paul Dutting Federico Fusco Silvio Lattanzi A. Norouzi-Fard Morteza Zadimoghaddam 92 16 0 31 Jan 2022
Adversarial Robustness of Streaming Algorithms through Importance Sampling Vladimir Braverman Avinatan Hassidim Yossi Matias Mariano Schain Sandeep Silwal Samson Zhou AAML OOD 65 43 0 28 Jun 2021
When are Non-Parametric Methods Robust? Robi Bhattacharjee Kamalika Chaudhuri AAML 89 27 0 13 Mar 2020
"Bring Your Own Greedy"+Max: Near-Optimal $1/2$ -Approximations for Submodular Knapsack Dmitrii Avdiukhin G. Yaroslavtsev Samson Zhou 55 35 0 12 Oct 2019