39 citations · 48 across the 9 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024
On Differentially Private Linear Algebra
Haim Kaplan, Yishay Mansour, Shay Moran +2
We introduce efficient differentially private (DP) algorithms for several linear algebraic tasks, including solving linear equalities over arbitrary fields, linear inequalities ove…
cs.DS2022
Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs
Edith Cohen, Jelani Nelson, Tamás Sarlós +1
CountSketch and Feature Hashing (the "hashing trick") are popular randomized dimensionality reduction methods that support recovery of -heavy hitters (keys where $v_i^2…
cs.DS2017★ 39 cited
Practical Locally Private Heavy Hitters
Raef Bassily, Kobbi Nissim, Uri Stemmer +1
We present new practical local differentially private heavy hitters algorithms achieving optimal or near-optimal worst-case error and running time -- TreeHist and Bitstogram. In bo…