Instance Specific Approximations for Submodular Maximization

02/23/2021
by   Eric Balkanski, et al.
0

For many optimization problems in machine learning, finding an optimal solution is computationally intractable and we seek algorithms that perform well in practice. Since computational intractability often results from pathological instances, we look for methods to benchmark the performance of algorithms against optimal solutions on real-world instances. The main challenge is that an optimal solution cannot be efficiently computed for intractable problems, and we therefore often do not know how far a solution is from being optimal. A major question is therefore how to measure the performance of an algorithm in comparison to an optimal solution on instances we encounter in practice. In this paper, we address this question in the context of submodular optimization problems. For the canonical problem of submodular maximization under a cardinality constraint, it is intractable to compute a solution that is better than a 1-1/e ≈ 0.63 fraction of the optimum. Algorithms like the celebrated greedy algorithm are guaranteed to achieve this 1-1/e bound on any instance and are used in practice. Our main contribution is not a new algorithm for submodular maximization but an analytical method that measures how close an algorithm for submodular maximization is to optimal on a given problem instance. We use this method to show that on a wide variety of real-world datasets and objectives, the approximation of the solution found by greedy goes well beyond 1-1/e and is often at least 0.95. We develop this method using a novel technique that lower bounds the objective of a dual minimization problem to obtain an upper bound on the value of an optimal solution to the primal maximization problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2021

Budget-Smoothed Analysis for Submodular Maximization

The greedy algorithm for submodular function maximization subject to car...
research
04/05/2021

Optimal Sampling Gaps for Adaptive Submodular Maximization

Running machine learning algorithms on large and rapidly growing volumes...
research
02/25/2016

Probably Approximately Correct Greedy Maximization

Submodular function maximization finds application in a variety of real-...
research
11/10/2018

An efficient branch-and-bound algorithm for submodular function maximization

The submodular function maximization is an attractive optimization model...
research
05/24/2023

Using Scalarizations for the Approximation of Multiobjective Optimization Problems: Towards a General Theory

We study the approximation of general multiobjective optimization proble...
research
11/17/2017

Information Gathering with Peers: Submodular Optimization with Peer-Prediction Constraints

We study a problem of optimal information gathering from multiple data p...
research
11/24/2021

Characterization of canonical systems with six types of coins for the change-making problem

This paper analyzes a necessary and sufficient condition for the change-...

Please sign up or login with your details

Forgot password? Click here to reset