跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2605.09221 · v2

The Pokémon Theorem: Fairness Criteria Can't Catch 'Em All

首次提交 2026-05-10 07:37
版本更新 2026-11-09 18:17
雷达观测 2026-11-10 15:22
arXiv ↗PDF ↗

摘要

Debates around algorithmic fairness rarely end. Models considered "fair" by one criterion are soon shown to be unfair by another. We prove that this is unavoidable. Satisfying any finite checklist of fairness criteria never certifies fairness itself, since the model may always violate yet another criterion. We call this the Pokémon theorem: you can't catch them all. In fact, trying to catch all criteria recovers the classical impossibility theorems. Since these violations come from differences between the groups' data, a natural remedy would be to make the data fair by learning fair features. Unfortunately, this, too, is impossible: features that scrub out sensitive group information also scrub out all predictive signal. While exact fairness is out of reach, approximate fairness is not. We derive the Pareto frontier between fairness and predictive signal for approximately fair features, and show how to attain it.

作者备注:NeurIPS 2026

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-09 18:17 · 最新观测版本

The Pokémon Theorem: Fairness Criteria Can't Catch 'Em All

Debates around algorithmic fairness rarely end. Models considered "fair" by one criterion are soon shown to be unfair by another. We prove that this is unavoidable. Satisfying any finite checklist of fairness criteria never certifies fairness itself, since the model may always violate yet another criterion. We call this the Pokémon theorem: you can't catch them all. In fact, trying to catch all criteria recovers the classical impossibility theorems. Since these violations come from differences between the groups' data, a natural remedy would be to make the data fair by learning fair features. Unfortunately, this, too, is impossible: features that scrub out sensitive group information also scrub out all predictive signal. While exact fairness is out of reach, approximate fairness is not. We derive the Pareto frontier between fairness and predictive signal for approximately fair features, and show how to attain it.

查看此版本解读 →查看此版本原文 ↗