Publications
Publications
Show Results For
- All HBS Web
(44)
- Faculty Publications (10)
Page 1 of 10
Results
- 2025
- Working Paper
Enhancing Treatment Effect Prediction on Privacy-Protected Data: An Honest Post-Processing Approach
By: Ta-Wei Huang and Eva Ascarza
As firms increasingly rely on customer data for personalization, concerns over privacy and regulatory compliance have grown. Local Differential Privacy (LDP) offers strong individual-level protection by injecting noise into data before collection. While... View Details
- Article
Adaptive Machine Unlearning
By: Varun Gupta, Christopher Jung, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi and Chris Waites
Data deletion algorithms aim to remove the influence of deleted data points from trained models at a cheaper computational cost than fully retraining those models. However, for sequences of deletions, most prior work in the non-convex setting gives valid guarantees... View Details
- April 2021 (Revised March 2024)
- Case
Social Media War 2021: Snap vs. Facebook vs. TikTok
By: David B. Yoffie and Daniel Fisher
This case explores the competitive war between Snap, Facebook, and TikTok in 2021. The strategic focus is on Snapchat: how should it respond to the emergence of TikTok, and how should it compete with the dominant competitor in its space—Facebook. The case examines... View Details
- Oct 2020
- Conference Presentation
Optimal, Truthful, and Private Securities Lending
By: Emily Diana, Michael J. Kearns, Seth Neel and Aaron Leon Roth
We consider a fundamental dynamic allocation problem motivated by the problem of securities lending in financial markets, the mechanism underlying the short selling of stocks. A lender would like to distribute a finite number of identical copies of some scarce resource... View Details
- Article
Oracle Efficient Private Non-Convex Optimization
By: Seth Neel, Aaron Leon Roth, Giuseppe Vietri and Zhiwei Steven Wu
One of the most effective algorithms for differentially private learning and optimization is objective perturbation. This technique augments a given optimization problem (e.g. deriving from an ERM problem) with a random linear term, and then exactly solves it.... View Details
- Mar 2020
- Conference Presentation
A New Analysis of Differential Privacy's Generalization Guarantees
By: Christopher Jung, Katrina Ligett, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi and Moshe Shenfeld
We give a new proof of the "transfer theorem" underlying adaptive data analysis: that any mechanism for answering adaptively chosen statistical queries that is differentially private and sample-accurate is also accurate out-of-sample. Our new proof is elementary and... View Details
- Article
How to Use Heuristics for Differential Privacy
By: Seth Neel, Aaron Leon Roth and Zhiwei Steven Wu
We develop theory for using heuristics to solve computationally hard problems in differential privacy. Heuristic approaches have enjoyed tremendous success in machine learning, for which performance can be empirically evaluated. However, privacy guarantees cannot be... View Details
- Article
The Role of Interactivity in Local Differential Privacy
By: Matthew Joseph, Jieming Mao, Seth Neel and Aaron Leon Roth
We study the power of interactivity in local differential privacy. First, we focus on the difference between fully interactive and sequentially interactive protocols. Sequentially interactive protocols may query users adaptively in sequence, but they cannot return to... View Details
- Article
Accuracy First: Selecting a Differential Privacy Level for Accuracy-Constrained ERM
By: Katrina Ligett, Seth Neel, Aaron Leon Roth, Bo Waggoner and Steven Wu
Traditional approaches to differential privacy assume a fixed privacy requirement ϵ for a computation, and attempt to maximize the accuracy of the computation subject to the privacy constraint. As differential privacy is increasingly deployed in practical settings, it... View Details
- Article
Mitigating Bias in Adaptive Data Gathering via Differential Privacy
By: Seth Neel and Aaron Leon Roth
Data that is gathered adaptively—via bandit algorithms, for example—exhibits bias. This is true both when gathering simple numeric valued data—the empirical means kept track of by stochastic bandit algorithms are biased downwards—and when gathering more complicated... View Details