activity
20022026
most citedHigh probability generalization bounds for uniformly stable algorithms with nearly optimal rate

40 citations · 242 across the 33 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Cardinality constrained submodular maximization for random streams

Paul Liu, Aviad Rubinstein, Jan Vondrak +1

We consider the problem of maximizing submodular functions in single-pass streaming and secretaries-with-shortlists models, both with random arrival order. For cardinality constrai…

cs.GT2021★ 1 cited

Estimating the Nash Social Welfare for coverage and other submodular valuations

Wenzheng Li, Jan Vondrak

We study the Nash Social Welfare problem: Given agents with valuation functions , partition into so as to maximize $…