A Reductions Approach to Fair Classification

By Alekh Agarwal, Alina Beygelzimer, Miroslav Dud'ik, J. Langford, Hanna M. Wallach. 2018

1,292 citations recorded by the source corpus.

We present a systematic approach for achieving fairness in a binary classification setting. While we focus on two well-known quantitative definitions of fairness, our approach encompasses many other previously studied definitions as special cases. The key idea is to reduce fair classification to a sequence of cost-sensitive classification problems, whose solutions yield a randomized classifier with the lowest (empirical) error subject to the desired constraints. We introduce two reductions that work for any representation of the cost-sensitive classifier and compare favorably to prior baselines on a variety of data sets, while overcoming several of their disadvantages.

Subfields: Artificial Intelligence, Safety Research, AI Ethics, Fairness & Society

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Percy Liang
  2. Sergey Levine
  3. Yoshua Bengio
  4. Mohit Bansal
  5. Ruslan Salakhutdinov
  6. Quoc V. Le
  7. Jianfeng Gao
  8. Luke S. Zettlemoyer

In Safety Research

  1. Silvia Chiappa
  2. Dana Pessach
  3. Erez Shmueli
  4. Luca Oneto
  5. Aaron Roth
  6. Alexandra Chouldechova
  7. Adrian Weller
  8. Heinrich Jiang

In AI Ethics, Fairness & Society

  1. Dana Pessach
  2. Erez Shmueli
  3. Luca Oneto
  4. Silvia Chiappa
  5. Christian Haas
  6. Simon Caton
  7. Aaron Roth
  8. Berk Ustun

Citations in the corpus