From Pseudorandomness to Multi-Group Fairness and Back

01/21/2023
by   Cynthia Dwork, et al.
0

We identify and explore connections between the recent literature on multi-group fairness for prediction algorithms and the pseudorandomness notions of leakage-resilience and graph regularity. We frame our investigation using new, statistical distance-based variants of multicalibration that are closely related to the concept of outcome indistinguishability. Adopting this perspective leads us naturally not only to our graph theoretic results, but also to new, more efficient algorithms for multicalibration in certain parameter regimes and a novel proof of a hardcore lemma for real-valued functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2023

Proportionally Representative Clustering

In recent years, there has been a surge in effort to formalize notions o...
research
10/09/2017

On formalizing fairness in prediction with machine learning

Machine learning algorithms for prediction are increasingly being used i...
research
02/14/2020

Fast Fair Regression via Efficient Approximations of Mutual Information

Most work in algorithmic fairness to date has focused on discrete outcom...
research
01/19/2023

Weighted EF1 Allocations for Indivisible Chores

We study how to fairly allocate a set of indivisible chores to a group o...
research
08/21/2020

Beyond Individual and Group Fairness

We present a new data-driven model of fairness that, unlike existing sta...
research
12/24/2019

Stochastic Fairness and Language-Theoretic Fairness in Planning on Nondeterministic Domains

We address two central notions of fairness in the literature of planning...
research
02/13/2023

Characterizing notions of omniprediction via multicalibration

A recent line of work shows that notions of multigroup fairness imply su...

Please sign up or login with your details

Forgot password? Click here to reset