381 citations · 2.3k across the 89 of their papers we have counts for
Showing 2010 · cs.DSShow all
3 papers · 2 filters
cs.DS2010
Privately Releasing Conjunctions and the Statistical Query Barrier
Anupam Gupta, Moritz Hardt, Aaron Roth +1
Suppose we would like to know all answers to a set of statistical queries C on a data set up to small error, but we can only access the data itself using statistical queries. A tri…
cs.DS2010
Differential Privacy and the Fat-Shattering Dimension of Linear Queries
Aaron Roth
In this paper, we consider the task of answering linear queries under the constraint of differential privacy. This is a general and well-studied class of queries that captures othe…
cs.DS2010★ 1 cited
Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms
Anupam Gupta, Aaron Roth, Grant Schoenebeck +1
Constrained submodular maximization problems have long been studied, with near-optimal results known under a variety of constraints when the submodular function is monotone. The ca…