← Search

Jamie Morgenstern

8 accepted papers

2024

Emergent specialization from participation dynamics and multi-learner retraining

AISTATS 2024poster

Numerous online services are data-driven: the behavior of users affects the system’s parameters, and the system’s parameters affect the users’ experience of the service, which in turn affects the way users may interact with the system. For example, people may choose to use a service only for tasks t…

2024

Fair Active Learning in Low-Data Regimes

UAI 2024poster

In critical machine learning applications, ensuring fairness is essential to avoid perpetuating social inequities. In this work, we address the challenges of reducing bias and improving accuracy in data-scarce environments, where the cost of collecting labeled data prohibits the use of large, labele…

Cited by 4SourcePDFScholar
2022

Active Sampling for Min-Max Fairness

ICML 2022spotlight

We propose simple active sampling and reweighting strategies for optimizing min-max fairness that can be applied to any classification or regression model learned via loss minimization. The key intuition behind our approach is to use at each timestep a datapoint from the group that is worst off unde…

2022

Individual Preference Stability for Clustering

ICML 2022oral

In this paper, we propose a natural notion of individual preference (IP) stability for clustering, which asks that every data point, on average, is closer to the points in its own cluster than to the points in any other cluster. Our notion can be motivated from several perspectives, including game t…

2020

Equalized odds postprocessing under imperfect group information

AISTATS 2020poster

Most approaches aiming to ensure a model’s fairness with respect to a protected attribute (such as gender or race) assume to know the true value of the attribute for every data point. In this paper, we ask to what extent fairness interventions can be effective even when only imperfect information ab…

2019

Fair k-Center Clustering for Data Summarization

ICML 2019oral

In data summarization we want to choose $k$ prototypes in order to summarize a data set. We study a setting where the data set comprises several demographic groups and we are restricted to choose $k_i$ prototypes belonging to group $i$. A common approach to the problem without the fairness constrain…

2019

Guarantees for Spectral Clustering with Fairness Constraints

ICML 2019oral

Given the widespread popularity of spectral clustering (SC) for partitioning graph data, we study a version of constrained SC in which we try to incorporate the fairness notion proposed by Chierichetti et al. (2017). According to this notion, a clustering is fair if every demographic group is approx…

2017

Fairness in Reinforcement Learning

ICML 2017poster

We initiate the study of fairness in reinforcement learning, where the actions of a learning algorithm may affect its environment and future rewards. Our fairness constraint requires that an algorithm never prefers one action over another if the long-term (discounted) reward of choosing the latter a…

Cited by 241SourcePDFScholar