On Maximizing the Difference Between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint.
Yijing WangYicheng XuXiaoguang YangPublished in: COCOA (2021)
Keyphrases
- submodular functions
- greedy algorithm
- facility location problem
- energy function
- combinatorial optimization
- linear constraints
- objective function
- facility location
- convex optimization
- worst case
- higher order
- graph cuts
- active learning
- machine learning
- learning problems
- evolutionary algorithm
- integer programming
- theoretical guarantees
- training data