Superhuman Fairness

Omid Memarrast, Linh Vu, Brian D. Ziebart
2/12/2026

No official code found. Best implementation: omidMemari/superhumn-fairness (3 stars, last commit 2024-12-26).

Abstract

The fairness of machine learning-based decisions has become an increasingly important focus in the design of supervised machine learning methods. Most fairness approaches optimize a specified trade-off between performance measure(s) (e.g., accuracy, log loss, or AUC) and fairness metric(s) (e.g., demographic parity, equalized odds). This begs the question: are the right performance-fairness trade-offs being specified? We instead re-cast fair machine learning as an imitation learning task by introducing superhuman fairness, which seeks to simultaneously outperform human decisions on multiple predictive performance and fairness measures. We demonstrate the benefits of this approach given suboptimal decisions.

View on arXivView PDF

Code Implementations(1)

Superhuman Fair Classification via Subdominance Minimization

30Python, Jupyter NotebookOct 27, 20221 years ago
classificationfairness-mlimitation-learningmachine-learning

Similar Papers

Cite this paper

@article{memarrast2026superhuman,
  title  = {Superhuman Fairness},
  author = {Omid Memarrast and Linh Vu and Brian D. Ziebart},
  year   = {2026},
  eprint = {2301.13420},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/pdf/2301.13420},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.13420.svg)](https://codeofpaper.com/paper/2301.13420)

Discussion