Co-occurring keywords · papers mentioning both
Papers
Optimal Sampling Gaps for Adaptive Submodular Maximization
AAAI 2022
Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints
ICML 2022
Using Partial Monotonicity in Submodular Maximization
NeurIPS 2022
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions
AISTATS 2021
Adaptivity in Adaptive Submodularity
COLT 2021
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
NeurIPS 2021
Cardinality constrained submodular maximization for random streams
NeurIPS 2021
Differentiable Greedy Algorithm for Monotone Submodular Maximization: Guarantees, Gradient Estimators, and Applications
AISTATS 2021
Differentially Private Monotone Submodular Maximization Under Matroid and Knapsack Constraints
AISTATS 2021
Differentially Private Online Submodular Maximization
AISTATS 2021
Instance Specific Approximations for Submodular Maximization
ICML 2021
Learning to Make Decisions via Submodular Regularization
ICLR 2021
Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee
AAAI 2021
Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization
AAAI 2021
Online Risk-Averse Submodular Maximization
IJCAI 2021
Optimal Algorithms for Submodular Maximization with Distributed Constraints
L4DC 2021
Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks
JMLR 2021
Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time
AISTATS 2021
Regularized Submodular Maximization at Scale
ICML 2021
Sample Efficient Decentralized Stochastic Frank-Wolfe Methods for Continuous DR-Submodular Maximization
IJCAI 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ICML 2021
Tracking Regret Bounds for Online Submodular Optimization
AISTATS 2021
Adaptive Submodular Maximization under Stochastic Item Costs
COLT 2020
A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints
NeurIPS 2020
Black Box Submodular Maximization: Discrete and Continuous Settings
AISTATS 2020