Publications
Publications
Show Results For
-
All HBS Web
(105,360)
- Faculty Publications (17)
Page 1 of
17
Results
- 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
- Mar 2021
- Conference Presentation
Descent-to-Delete: Gradient-Based Methods for Machine Unlearning
By: Seth Neel, Aaron Leon Roth and Saeed Sharifi-Malvajerdi
We study the data deletion problem for convex models. By leveraging techniques from convex optimization and reservoir sampling, we give the first data deletion algorithms that are able to handle an arbitrarily long sequence of adversarial updates while promising both...
View Details
- 2021
- Article
Fair Algorithms for Infinite and Contextual Bandits
By: Matthew Joseph, Michael J Kearns, Jamie Morgenstern, Seth Neel and Aaron Leon Roth
We study fairness in linear bandit problems. Starting from the notion of meritocratic fairness introduced in Joseph et al. [2016], we carry out a more refined analysis of a more general problem, achieving better performance guarantees with fewer modelling assumptions...
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
- 2021
- Conference Presentation
An Algorithmic Framework for Fairness Elicitation
By: Christopher Jung, Michael J. Kearns, Seth Neel, Aaron Leon Roth, Logan Stapleton and Zhiwei Steven Wu
We consider settings in which the right notion of fairness is not captured by simple mathematical definitions (such as equality of error rates across groups), but might be more complex and nuanced and thus require elicitation from individual or collective stakeholders....
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
- 2019
- Article
Fair Algorithms for Learning in Allocation Problems
By: Hadi Elzayn, Shahin Jabbari, Christopher Jung, Michael J Kearns, Seth Neel, Aaron Leon Roth and Zachary Schutzman
Settings such as lending and policing can be modeled by a centralized agent allocating a scarce resource (e.g. loans or police officers) amongst several groups, in order to maximize some objective (e.g. loans given that are repaid, or criminals that are apprehended)....
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
- 2019
- Article
An Empirical Study of Rich Subgroup Fairness for Machine Learning
By: Michael J Kearns, Seth Neel, Aaron Leon Roth and Zhiwei Steven Wu
Kearns et al. [2018] recently proposed a notion of rich subgroup fairness intended to bridge the gap between statistical and individual notions of fairness. Rich subgroup fairness picks a statistical fairness constraint (say, equalizing false positive rates across...
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
- Article
Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness
By: Michael J Kearns, Seth Neel, Aaron Leon Roth and Zhiwei Steven Wu
The most prevalent notions of fairness in machine learning are statistical definitions: they fix a small collection of pre-defined groups, and then ask for parity of some statistic of the classifier (like classification rate or false positive rate) across these groups....
View Details
- 14 Aug 2017
- Conference Presentation
A Convex Framework for Fair Regression
By: Richard Berk, Hoda Heidari, Shahin Jabbari, Matthew Joseph, Michael J. Kearns, Jamie Morgenstern, Seth Neel and Aaron Roth
We introduce a flexible family of fairness regularizers for (linear and logistic) regression problems. These regularizers all enjoy convexity, permitting fast optimization, and they span the range from notions of group fairness to strong individual fairness. By varying...
View Details
- 18 Nov 2016
- Conference Presentation
Rawlsian Fairness for Machine Learning
By: Matthew Joseph, Michael J. Kearns, Jamie Morgenstern, Seth Neel and Aaron Leon Roth
Motivated by concerns that automated decision-making procedures can unintentionally lead to discriminatory behavior, we study a technical definition of fairness modeled after John Rawls' notion of "fair equality of opportunity". In the context of a simple model of...
View Details
- Article
Aztec Castles and the dP3 Quiver
By: Megan Leoni, Gregg Musiker, Seth Neel and Paxton Turner
Bipartite, periodic, planar graphs known as brane tilings can be associated to a large class of quivers. This paper will explore new algebraic properties of the well-studied del Pezzo 3 (dP3) quiver and geometric properties of its corresponding brane tiling. In...
View Details