Submodular Maximization with Limited Function Access

01/03/2022
by   Andrew Downie, et al.
1

We consider a class of submodular maximization problems in which decision-makers have limited access to the objective function. We explore scenarios where the decision-maker can observe only pairwise information, i.e., can evaluate the objective function on sets of size two. We begin with a negative result that no algorithm using only k-wise information can guarantee performance better than k/n. We present two algorithms that utilize only pairwise information about the function and characterize their performance relative to the optimal, which depends on the curvature of the submodular function. Additionally, if the submodular function possess a property called supermodularity of conditioning, then we can provide a method to bound the performance based purely on pairwise information. The proposed algorithms offer significant computational speedups over a traditional greedy strategy. A by-product of our study is the introduction of two new notions of curvature, the k-Marginal Curvature and the k-Cardinality Curvature. Finally, we present experiments highlighting the performance of our proposed algorithms in terms of approximation and time complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2017

Submodular Function Maximization for Group Elevator Scheduling

We propose a novel approach for group elevator scheduling by formulating...
research
05/15/2018

SAS-Assisted Coexistence-Aware Dynamic Channel Assignment in CBRS Band

The paradigm of shared spectrum allows secondary devices to opportunisti...
research
11/15/2021

Faster First-Order Algorithms for Monotone Strongly DR-Submodular Maximization

Continuous DR-submodular functions are a class of generally non-convex/n...
research
04/22/2018

Towards Practical Constrained Monotone Submodular Maximization

We design new algorithms for maximizing a monotone non-negative submodul...
research
08/30/2023

An Improved Greedy Curvature Bound in Finite-Horizon String Optimization with Application to a Sensor Coverage Problem

We study the optimization problem of choosing strings of finite length t...
research
10/08/2020

Sensitivity Analysis of Submodular Function Maximization

We study the recently introduced idea of worst-case sensitivity for mono...
research
11/07/2013

Efficient Regularization of Squared Curvature

Curvature has received increased attention as an important alternative t...

Please sign up or login with your details

Forgot password? Click here to reset