Optimal universal sets for submodular functions

We resolve the question of deterministic non-adaptive algorithms for nonnegative submodular maximization: We prove that for every $n \geq 2$ and $ε\in (0,\frac{1}{4})$, there is a polynomial-size family ${F}_{n,ε}$, $|{F}_{n,ε}| = n^{O(1/ε^2 \log (1/ε))}$, such that for every nonnegative submodular function $f:2^{[n]} \to {\bf R}$, $\max_{S \in {F}_{n,ε}} f(S) \geq (1/4 - ε) \max_{S \subseteq [n]} f(S)$. It is also easy to show that a factor better than $1/4$ cannot be achieved by any fixed polynomial-size family. A related result that we prove is that there is a distribution ${D}_{n,ε}$ supported on polynomially many subsets of $[n]$ such that $(1 - ε) {\bf E}_{R \sim {U}_n}[f(R)] \leq {\bf E}_{R \sim {D}_{n,ε}}[f(R)] \leq {\bf E}_{R \sim {U}_n}[f(R)]$, where ${U}_n$ is the uniform distribution on $2^{[n]}$, and $f$ is any nonnegative submodular function. This is interesting in light of the fact that uniform convergence does not hold for submodular functions: Sampling polynomially many sets from ${U}_n$ and taking the empirical mean does not converge to the true expectation uniformly for all submodular functions. The construction of ${F}_{n,ε}$ and ${D}_{n,ε}$ is based on a new semidefinite extension of submodular functions: We show that the Goemans-Williamson rounding technique for a near-orthogonal arrangement of vectors gives a value close to the uniform expectation, and this rounding can be derandomized, since near-orthogonal vectors can be constructed in logarithmic dimension.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.23637
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Optimal universal sets for submodular functions

J. Vondrák, Marek Adamczyk, Richard Ueltzen
arXiv (Cornell University)
Complexity and Algorithms in Graphs
preprint

Optimal universal sets for submodular functions

J. Vondrák, Marek Adamczyk, Richard Ueltzen
preprint en

Abstract

We resolve the question of deterministic non-adaptive algorithms for nonnegative submodular maximization: We prove that for every $n \geq 2$ and $ε\in (0,\frac{1}{4})$, there is a polynomial-size family ${F}_{n,ε}$, $|{F}_{n,ε}| = n^{O(1/ε^2 \log (1/ε))}$, such that for every nonnegative submodular function $f:2^{[n]} \to {\bf R}$, $\max_{S \in {F}_{n,ε}} f(S) \geq (1/4 - ε) \max_{S \subseteq [n]} f(S)$. It is also easy to show that a factor better than $1/4$ cannot be achieved by any fixed polynomial-size family. A related result that we prove is that there is a distribution ${D}_{n,ε}$ supported on polynomially many subsets of $[n]$ such that $(1 - ε) {\bf E}_{R \sim {U}_n}[f(R)] \leq {\bf E}_{R \sim {D}_{n,ε}}[f(R)] \leq {\bf E}_{R \sim {U}_n}[f(R)]$, where ${U}_n$ is the uniform distribution on $2^{[n]}$, and $f$ is any nonnegative submodular function. This is interesting in light of the fact that uniform convergence does not hold for submodular functions: Sampling polynomially many sets from ${U}_n$ and taking the empirical mean does not converge to the true expectation uniformly for all submodular functions. The construction of ${F}_{n,ε}$ and ${D}_{n,ε}$ is based on a new semidefinite extension of submodular functions: We show that the Goemans-Williamson rounding technique for a near-orthogonal arrangement of vectors gives a value close to the uniform expectation, and this rounding can be derandomized, since near-orthogonal vectors can be constructed in logarithmic dimension.

arXiv (Cornell University)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon