Improved bounds for the greedy strategy in optimization problems with curvature
- 187 Downloads
Consider the problem of choosing a set of actions to optimize a real-valued polymatroid function subject to matroid constraints. The greedy strategy, an approximate solution, is known to satisfy some bounds in terms of the total curvature. The total curvature depends on function values on sets outside the constraint matroid. If the function is defined only on the matroid, the problem still makes sense, but the existing bounds involving the total curvature do not apply, which is puzzling. This motivates an alternative formulation of such bounds. The first question we address is whether it is possible to extend a polymatroid function defined on a matroid to one on the entire power set. This was recently shown to be negative in general. Here, we provide necessary and sufficient conditions for the existence of an incremental extension of a polymatroid function defined on the uniform matroid of rank k to one with rank \(k+1\), together with an algorithm for constructing the extension. Whenever a polymatroid function defined on a matroid can be extended to the entire power set, the bounds involving the total curvature of the extension apply. However, these bounds still depend on sets outside the constraint matroid. Motivated by this, we define a new notion of curvature called partial curvature, involving only sets in the matroid. We derive necessary and sufficient conditions for an extension to have a total curvature equal to the partial curvature. Moreover, we prove that the bounds in terms of the partial curvature are in general improved over the previous ones. We illustrate our results with two contrasting examples motivated by practical problems.
KeywordsCurvature Greedy Matroid Polymatroid Submodular
Mathematics Subject Classification90C27 90C59
Funding was provided by Division of Computing and Communication Foundations (Grant No. CCF-1422658).
- Singh AP, Guillory A, Bilmes J (2012) On bisubmodular maximization. In: Proceedings of 15th international conference on artificial intelligence and statistics, pp 1055–1063Google Scholar
- Streeter M, Golovin D (2008) An online algorithm for maximizing submodular functions. In: Proceedings of advances in neural information processing systems, pp 1577–1584Google Scholar
- Sviridenko M, Vondrák J, Ward J (2015) Optimal approximation for submodular and supermodular optimization with bounded curvature. In: Proceedings of 26th annual ACM-SIAM symposium. Discrete algorithms, pp 1134–1148Google Scholar