Skip to yearly menu bar Skip to main content


Poster
in
Workshop: Algorithmic Fairness through the Lens of Causality and Privacy

Minimax Optimal Fair Regression under Linear Model

Kazuto Fukuchi · Jun Sakuma


Abstract: We investigate the minimax optimal error of a fair regression problem under a linear model employing demographic parity as a fairness constraint. As a tractable demographic parity constraint, we introduce (α,δ)(α,δ)-fairness consistency, meaning that the quantified unfairness is decreased at most nαnα rate with at least probability 1δ1δ, where nn is the sample size. In other words, the consistently fair algorithm eventually outputs a regressor satisfying the demographic parity constraint with high probability as nn tends to infinity. As a result of our analyses, we found that the minimax optimal error under the (α,δ)(α,δ)-fairness consistency constraint is Θ(dMn)Θ(dMn) provided that α12α12, where dd is the dimensionality, and MM is the number of groups induced from the sensitive attributes.

Chat is not available.