Jul 9, 2022 · We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function minimization (SFM).

We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function minimization (SFM).

Jul 9, 2022 · Abstract. We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function ...

Jul 12, 2022 · View recent discussion. Abstract: We provide a generic technique for constructing families of submodular functions to obtain lower bounds ...

It is proved that any deterministic SFM algorithm on a ground set of n elements requires at least $\Omega(n\log n)$ queries to an evaluation oracle, ...

We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function minimization (SFM).

Despite these algorithmic improvements, limited progress has been made on lower bounding the query complexity of SFM and the best known lower bound has been Ω(n) ...

It is also of course generally important to further improve query complexity lower bounds for SFM variants (and also develop better algorithms). References. 1.

Improved Lower Bounds for Submodular Function Minimization2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS54457 ...

We provide a query lower bound of $2n$ for submodular function minimization, a $3n/2-2$ query lower bound for the non-trivial minimizer of a symmetric ...