A Note on Optimizing the Ratio of Monotone Supermodular Functions
Machine Learning
2020-12-18 v1 Data Structures and Algorithms
Optimization and Control
Abstract
We show that for the problem of minimizing (or maximizing) the ratio of two supermodular functions, no bounded approximation ratio can be achieved via polynomial number of queries, if the two supermodular functions are both monotone non-decreasing or non-increasing.
Keywords
Cite
@article{arxiv.2012.09725,
title = {A Note on Optimizing the Ratio of Monotone Supermodular Functions},
author = {Wenxin Li},
journal= {arXiv preprint arXiv:2012.09725},
year = {2020}
}