collaborators
Showing cs.LGShow all

5 papers · 1 filter

cs.LG2026

Propose-Filter-Release: Scaling Noise to Typical Sensitivity via Private Filtering

Moshe Shenfeld, Eliad Tsfadia, Katrina Ligett

Differential privacy requires that algorithms be stable to the change of any record in their input, even to an extreme outlier. Private algorithms thus commonly introduce noise sca…

cs.LG2026

The Fast Mixing Mechanism for Differential Privacy

Omri Lev, Moshe Shenfeld, Vishwak Srinivasan +2

Randomized sketching is a central tool for compressing large-scale optimization problems while preserving accuracy. In particular, sketches that are based on structured matrices, s…

cs.LG2026

Near-Optimal Private Linear Regression via Iterative Hessian Mixing

Omri Lev, Moshe Shenfeld, Vishwak Srinivasan +2

We study differentially private ordinary least squares (DP-OLS) with bounded data via sketching-based mechanisms. While Gaussian sketching approaches have been explored for…

cs.LG2025

The Gaussian Mixing Mechanism: Renyi Differential Privacy via Gaussian Sketches

Omri Lev, Vishwak Srinivasan, Moshe Shenfeld +3

Gaussian sketching, which consists of pre-multiplying the data with a random Gaussian matrix, is a widely used technique for multiple problems in data science and machine learning,…

cs.LG2025

How Well Can Differential Privacy Be Audited in One Run?

Amit Keinan, Moshe Shenfeld, Katrina Ligett

Recent methods for auditing the privacy of machine learning algorithms have improved computational efficiency by simultaneously intervening on multiple training examples in a singl…