Breaking the Bonds of Submodularity: Empirical Estimation of Approximation Ratios for Monotone Non-Submodular Greedy Maximization.
J. David SmithMy T. ThaiPublished in: CoRR (2017)
Keyphrases
- submodular functions
- greedy algorithm
- objective function
- diminishing returns
- greedy algorithms
- facility location problem
- greedy strategy
- theoretical analysis
- dynamic programming
- combinatorial optimization
- feature selection
- approximation guarantees
- approximation ratio
- energy function
- greedy heuristic
- estimation algorithm
- approximation algorithms
- information theoretic
- worst case
- machine learning
- maximum likelihood estimation
- empirical data
- estimation process
- bayesian networks