Adversarially Robust Submodular Maximization under Knapsack Constraints.
Dmitrii AvdiukhinSlobodan MitrovicGrigory YaroslavtsevSamson ZhouPublished in: KDD (2019)
Keyphrases
- objective function
- knapsack problem
- dynamic programming
- upper bound
- constrained optimization
- optimal solution
- high order
- parameter tuning
- neural network
- greedy algorithm
- information systems
- least squares
- evolutionary algorithm
- constraint satisfaction
- bayesian networks
- geometric constraints
- computer vision
- artificial intelligence