DeepAI AI Chat
Log In Sign Up

Improved Lower Bounds for Submodular Function Minimization

by   Deeparnab Chakrabarty, et al.

We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function minimization (SFM). Applying this technique, we prove that any deterministic SFM algorithm on a ground set of n elements requires at least Ί(n log n) queries to an evaluation oracle. This is the first super-linear query complexity lower bound for SFM and improves upon the previous best lower bound of 2n given by [Graur et al., ITCS 2020]. Using our construction, we also prove that any (possibly randomized) parallel SFM algorithm, which can make up to 𝗉𝗈𝗅𝗒(n) queries per round, requires at least Ί(n / log n) rounds to minimize a submodular function. This improves upon the previous best lower bound of ΊĖƒ(n^1/3) rounds due to [Chakrabarty et al., FOCS 2021], and settles the parallel complexity of query-efficient SFM up to logarithmic factors due to a recent advance in [Jiang, SODA 2021].


page 1

page 2

page 3

page 4

∙ 11/15/2019

New Query Lower Bounds for Submodular Function MInimization

We consider submodular function minimization in the oracle model: given ...
∙ 11/12/2020

FPT-Algorithms for the l-Matchoid Problem with Linear and Submodular Objectives

We design a fixed-parameter deterministic algorithm for computing a maxi...
∙ 01/05/2020

New lower bounds for Massively Parallel Computation from query complexity

Roughgarden, Vassilvitskii, and Wang (JACM 18) recently introduced a nov...
∙ 11/09/2022

Shortest Cycles With Monotone Submodular Costs

We introduce the following submodular generalization of the Shortest Cyc...
∙ 12/31/2020

The Query Complexity of Local Search and Brouwer in Rounds

We study the query complexity of local search and Brouwer fixed-point co...
∙ 10/05/2022

Fisher information lower bounds for sampling

We prove two lower bounds for the complexity of non-log-concave sampling...