Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ethan Leeman

dblp:140/7652 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
4since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 since 2021Security and privacy · 1 · 1 since 2021Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Privacy and data protection · 100%
Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 77% Deep learning architectures and training · 23%

Topics — the 3 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
1.322023
Optimal Unbiased Randomizers for Regression with Label Differential Privacy · NeurIPS 2023
Regression with Label Differential Privacy · ICLR 2023
Privacy and data protection › differential privacy › relaxed differential privacy
label differential privacy
1.322023
Optimal Unbiased Randomizers for Regression with Label Differential Privacy · NeurIPS 2023
Regression with Label Differential Privacy · ICLR 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
regression
0.712023
Regression with Label Differential Privacy · ICLR 2023

Methods — techniques the papers use, named apart from their topics

label randomization · 1.3label differential privacy · 1.3bias-variance trade-off · 1.3
YearPublicationVenuePosition
2025 Balls-and-Bins Sampling for DP-SGD
abstract
We introduce the \emph{Balls-and-Bins} sampling for differentially private (DP) optimization methods such as DP-SGD. While it has been common practice to use some form of shuffling in DP-SGD implementations, privacy accounting algorithms have typically assumed that Poisson subsampling is used instead. Recent work by Chua et al. (2024), however, pointed out that shuffling based DP-SGD can have a much larger privacy cost in practical regimes of parameters. In this work we show that the Balls-and-Bins sampling achieves the "best-of-both" samplers, namely, the implementation of Balls-and-Bins sampling is similar to that of Shuffling and models trained using DP-SGD with Balls-and-Bins sampling achieve utility comparable to those trained using DP-SGD with Shuffling at the same noise multiplier, and yet, Balls-and-Bins sampling enjoys similar-or-better privacy amplification as compared to Poisson subsampling in practical regimes.
Lynn Chua, Badih Ghazi, Charlie Harrison, Pritish Kamath, Ravi Kumar 0001, Ethan Leeman, Pasin Manurangsi, Amer Sinha, Chiyuan Zhang
AISTATS6
2025 On the Differential Privacy and Interactivity of Privacy Sandbox Reports
abstract
The Privacy Sandbox initiative from Google includes APIs for enabling privacy-preserving advertising functionalities as part of the effort to limit third-party cookies. In particular, the Private Aggregation API (PAA) and the Attribution Reporting API (ARA) can be used for ad measurement while providing different guardrails for safeguarding user privacy, including a framework for satisfying differential privacy (DP). In this work, we provide an abstract model for analyzing the privacy of these APIs and show that they satisfy a formal DP guarantee under certain assumptions. Our analysis handles the case where both the queries and database can change interactively based on previous responses from the API.
Badih Ghazi, Charlie Harrison, Arpana Hosabettu, Pritish Kamath, Alexander Knop, Ravi Kumar 0001, Ethan Leeman, Pasin Manurangsi, Mariana Raykova 0001, Vikas Sahu, Phillipp Schoppmann
Proc. Priv. Enhancing Technol.7
2023 Regression with Label Differential Privacy
Badih Ghazi, Pritish Kamath, Ravi Kumar 0001, Ethan Leeman, Pasin Manurangsi, Avinash V. Varadarajan, Chiyuan Zhang
ICLR4
2023 Optimal Unbiased Randomizers for Regression with Label Differential Privacy
abstract
We propose a new family of label randomizers for training _regression_ models under the constraint of label differential privacy (DP). In particular, we leverage the trade-offs between bias and variance to construct better label randomizers depending on a privately estimated prior distribution over the labels. We demonstrate that these randomizers achieve state-of-the-art privacy-utility trade-offs on several datasets, highlighting the importance of reducing bias when training neural networks with label DP. We also provide theoretical results shedding light on the structural properties of the optimal unbiased randomizers.
Ashwinkumar Badanidiyuru, Badih Ghazi, Pritish Kamath, Ravi Kumar 0001, Ethan Leeman, Pasin Manurangsi, Avinash V. Varadarajan, Chiyuan Zhang
NeurIPS5
2016 Affine extractors over large fields with exponential error
Jean Bourgain, Zeev Dvir, Ethan Leeman
Comput. Complex.3