We study the problem of locally private mean estimation of high-dimensio...
The sparse Johnson-Lindenstrauss transform is one of the central techniq...
Composition theorems are general and powerful tools that facilitate priv...
The problem of learning threshold functions is a fundamental one in mach...
Naively storing a counter up to value n would require Ω(log n) bits
of m...
CountSketch and Feature Hashing (the "hashing trick") are popular random...
Recent work of Acharya et al. (NeurIPS 2019) showed how to estimate the
...
Randomized Hadamard Transforms (RHTs) have emerged as a computationally
...
In this work, we propose a new algorithm ProjectiveGeometryResponse (PGR...
CountSketch is a popular dimensionality reduction technique that maps ve...
Recently (Elkin, Filtser, Neiman 2017) introduced the concept of a termi...
Theoretical computer science (TCS) is a subdiscipline of computer scienc...
Randomized algorithms have propelled advances in artificial intelligence...
We provide improved upper bounds for the simultaneous sketching complexi...
We provide a static data structure for distance estimation which support...
Storing a counter incremented N times would naively consume O(log N)
bit...
Boosting is one of the most successful ideas in machine learning. The mo...
Let ε∈(0,1) and X⊂ R^d be arbitrary with |X|
having size n>1. The Johnso...
We show optimal lower bounds for spanning forest computation in two diff...
We present a new locally differentially private algorithm for the heavy
...
We prove, using the subspace embedding guarantee in a black box way, tha...
Let Φ∈R^m× n be a sparse Johnson-Lindenstrauss
transform [KN14] with s n...