activity
20162026
most citedThe implicit fairness criterion of unconstrained learning

32 citations · 91 across the 16 of their papers we have counts for

collaborators
Showing cs.LGShow all

10 papers · 1 filter

cs.LG2026

Births are difficult to predict even with rich survey and full-population register data

Elizaveta Sivak, Emily M. Cantrell, Thomas Emery +109

Major life events have proven difficult to predict. Does this reflect limits of theory, data, and algorithms, or the large role of chance? We examine one outcome - having a child w…

cs.LG2025

The Impact of Coreset Selection on Spurious Correlations and Group Robustness

Amaya Dharmasiri, William Yang, Polina Kirichenko +2

Coreset selection methods have shown promise in reducing the training data size while maintaining model performance for data-efficient machine learning. However, as many datasets s…

cs.LG2025

Bridging Prediction and Intervention Problems in Social Systems

Lydia T. Liu, Inioluwa Deborah Raji, Angela Zhou +32

Many automated decision systems (ADS) are designed to solve prediction problems -- where the goal is to learn patterns from a sample of the population and apply them to individuals…

cs.LG2023

On the Actionability of Outcome Prediction

Lydia T. Liu, Solon Barocas, Jon Kleinberg +1

Predicting future outcomes is a prevalent application of machine learning in social impact domains. Examples range from predicting student success in education to predicting diseas…

cs.LG2020★ 21 cited

Bandit Learning in Decentralized Matching Markets

Lydia T. Liu, Feng Ruan, Horia Mania +1

We study two-sided matching markets in which one side of the market (the players) does not have a priori knowledge about its preferences for the other side (the arms) and is requir…

cs.LG2020★ 2 cited

Balancing Competing Objectives with Noisy Data: Score-Based Classifiers for Welfare-Aware Machine Learning

Esther Rolf, Max Simchowitz, Sarah Dean +4

While real-world decisions involve many competing objectives, algorithmic decisions are often evaluated with a single objective function. In this paper, we study algorithmic polici…

cs.LG2019★ 8 cited

Competing Bandits in Matching Markets

Lydia T. Liu, Horia Mania, Michael I. Jordan

Stable matching, a classical model for two-sided markets, has long been studied with little consideration for how each side's preferences are learned. With the advent of massive on…

cs.LG2018★ 32 cited

The implicit fairness criterion of unconstrained learning

Lydia T. Liu, Max Simchowitz, Moritz Hardt

We clarify what fairness guarantees we can and cannot expect to follow from unconstrained machine learning. Specifically, we characterize when unconstrained learning on its own imp…

cs.LG2018

Delayed Impact of Fair Machine Learning

Lydia T. Liu, Sarah Dean, Esther Rolf +2

Fairness in machine learning has predominantly been studied in static classification settings without concern for how decisions change the underlying population over time. Conventi…

cs.LG2018★ 26 cited

On the Local Minima of the Empirical Risk

Chi Jin, Lydia T. Liu, Rong Ge +1

Population risk is always of primary interest in machine learning; however, learning algorithms only have access to the empirical risk. Even for applications with nonconvex nonsmoo…