Guarantees for Greedy Maximization of Non-submodular Functions with Applications.
Andrew An BianJoachim M. BuhmannAndreas KrauseSebastian TschiatschekPublished in: CoRR (2017)
Keyphrases
- submodular functions
- greedy algorithm
- objective function
- diminishing returns
- dynamic programming
- theoretical guarantees
- worst case
- optimal solution
- combinatorial optimization
- lower bound
- multi objective
- facility location problem
- tabu search
- learning tasks
- markov decision processes
- multistage
- neural network
- denoising
- training set
- training data