Using Partial Monotonicity in Submodular Maximization

Loay Mualem, Moran Feldman

Keywords: submodular maximization, non-convex optimization, monotonicity ratio, cardinality constraint, matroid constraint, movie recommendation, image summarization

TL;DR: Obtaining new approximation guarantees for multiple submodular maximization algorithms by defining a new monotonicity ratio parameter, leading to improved approximation ratios for common machine learning applications.

Abstract: Over the last two decades, submodular function maximization has been the workhorse of many discrete optimization problems in machine learning applications. Traditionally, the study of submodular functions was based on binary function properties, but recent works began to consider continuous function properties such as the submodularity ratio and the curvature. The monotonicity property of set functions plays a central role in submodular maximization. Nevertheless, no continuous version of this property has been suggested to date (as far as we know), which is unfortunate since submoduar functions that are almost monotone often arise in machine learning applications. In this work we fill this gap by defining the monotonicity ratio, which is a continuous version of the monotonicity property. We then show that for many standard submodular maximization algorithms one can prove new approximation guarantees that depend on the monotonicity ratio; leading to improved approximation ratios for the common machine learning applications of movie recommendation, quadratic programming, image summarization and ride-share optimization.