Yishay Mansour, Ke Sun, Alexander Soen, Ibrahim Alabdulmohsin, Sanmi Koyejo, Nyalleng Moorosi, Richard Nock, Lexing Xie
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We introduce a new family of techniques to post-process ("wrap") a black-box classifier in order to reduce its bias. Our technique builds on the recent analysis of improper loss functions whose optimization can correct any twist in prediction, unfairness being treated as a twist. In the post-processing, we learn a wrapper function which we define as an α-tree, which modifies the prediction. We provide two generic boosting algorithms to learn α-trees. We show that our modification has appealing properties in terms of composition of α-trees, generalization, interpretability, and KL divergence between modified and original predictions. We exemplify the use of our technique in three fairness notions: conditional value-at-risk, equality of opportunity, and statistical parity; and provide experiments on several readily available datasets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.12947")
get_code_for_paper("2201.12947")
have("2201.12947")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2201.12947.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2201.12947)
Connect an agent — have() is free.