Pairwise Fairness for Ranking and Regression

Authors

  • Harikrishna Narasimhan Google Research
  • Andrew Cotter Google Research
  • Maya Gupta Google Research
  • Serena Wang Google Research

DOI:

https://doi.org/10.1609/aaai.v34i04.5970

Abstract

We present pairwise fairness metrics for ranking models and regression models that form analogues of statistical fairness notions such as equal opportunity, equal accuracy, and statistical parity. Our pairwise formulation supports both discrete protected groups, and continuous protected attributes. We show that the resulting training problems can be efficiently and effectively solved using existing constrained optimization and robust optimization techniques developed for fair classification. Experiments illustrate the broad applicability and trade-offs of these methods.

Downloads

Published

2020-04-03

How to Cite

Narasimhan, H., Cotter, A., Gupta, M., & Wang, S. (2020). Pairwise Fairness for Ranking and Regression. Proceedings of the AAAI Conference on Artificial Intelligence, 34(04), 5248-5255. https://doi.org/10.1609/aaai.v34i04.5970

Issue

Section

AAAI Technical Track: Machine Learning