In adaptive data analysis, a mechanism gets n i.i.d. samples from an
unk...
A private learner is trained on a sample of labeled points and generates...
In this work we introduce an interactive variant of joint differential
p...
We study the space complexity of the two related fields of differential
...
We introduce the concurrent shuffle model of differential privacy. In th...
Streaming algorithms are typically analyzed in the oblivious setting, wh...
Composition theorems are general and powerful tools that facilitate priv...
The problem of learning threshold functions is a fundamental one in mach...
In this work, we introduce the Gulliver multi-party computation model (G...
CountSketch and Feature Hashing (the "hashing trick") are popular random...
CountSketch is a popular dimensionality reduction technique that maps ve...
The amount of training-data is one of the key factors which determines t...
Clustering is a fundamental problem in data analysis. In differentially
...
The literature on data sanitization aims to design algorithms that take ...
A dynamic algorithm against an adaptive adversary is required to be corr...
Differentially private algorithms for common metric aggregation tasks, s...
In this work we study the problem of differentially private (DP) quantil...
Streaming algorithms are algorithms for processing large data streams, u...
We revisit the fundamental problem of learning Axis-Aligned-Rectangles o...
We give an (ε,δ)-differentially private algorithm for the
multi-armed ba...
We present a streaming problem for which every adversarially-robust stre...
Common datasets have the form of elements with keys (e.g.,
transactions ...
We revisit one of the most basic and widely applicable techniques in the...
The shuffle model of differential privacy was proposed as a viable model...
We present a differentially private learner for halfspaces over a finite...
A streaming algorithm is said to be adversarially robust if its accuracy...
We study the question of how to compute a point in the convex hull of an...
Let H be a class of boolean functions and consider acomposed class H' th...
Motivated by the desire to bridge the utility gap between local and trus...
We study the sample complexity of learning threshold functions under the...
We design a new algorithm for the Euclidean k-means problem that operate...
We present a private learner for halfspaces over an arbitrary finite dom...
We present differentially private efficient algorithms for learning unio...
While statistics and machine learning offers numerous methods for ensuri...
We design new differentially private algorithms for the Euclidean k-mean...
We present a new locally differentially private algorithm for the heavy
...
We compare the sample complexity of private learning [Kasiviswanathan et...