Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs.
Rishabh K. IyerJeffrey A. BilmesPublished in: AISTATS (2019)
Keyphrases
- cooperative
- orders of magnitude
- times faster
- data sets
- learning algorithm
- computationally hard
- optimization problems
- benchmark datasets
- computational efficiency
- costs can be reduced
- restrictive assumptions
- hard problems
- combinatorial optimization
- dynamic programming
- computational complexity
- objective function
- computer vision
- machine learning