CoChat

AdaFair: Cumulative Fairness Adaptive Boosting

Open access
Iosifidis, Vasileios, Ntoutsi, Eirini · 2019 · Proceedings of the 28th ACM International Conference on Information and Knowledge Management

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

Abstract

The widespread use of ML-based decision making in domains with high societal impact such as recidivism, job hiring and loan credit has raised a lot of concerns regarding potential discrimination. In particular, in certain cases it has been observed that ML algorithms can provide different decisions based on sensitive attributes such as gender or race and therefore can lead to discrimination. Although, several fairness-aware ML approaches have been proposed, their focus has been largely on preserving the overall classification accuracy while improving fairness in predictions for both protected and non-protected groups (defined based on the sensitive attribute(s)). The overall accuracy however is not a good indicator of performance in case of class imbalance, as it is biased towards the majority class. As we will see in our experiments, many of the fairness-related datasets suffer from class imbalance and therefore, tackling fairness requires also tackling the imbalance problem. To this end, we propose AdaFair, a fairness-aware classifier based on AdaBoost that further updates the weights of the instances in each boosting round taking into account a cumulative notion of fairness based upon all current ensemble members, while explicitly tackling class-imbalance by optimizing the number of ensemble members for balanced classification error. Our experiments show that our approach can achieve parity in true positive and true negative rates for both protected and non-protected groups, while it significantly outperforms existing fairness-aware methods up to 25% in terms of balanced error.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3357384.3357974

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 14

  1. [6] Flavio Calmon, Dennis Wei, Bhanukiran Vinzamuri, Karthikeyan Natesan Ramamurthy, and Kush R Varshney. 2017. Optimized pre-processing for discrimination prevention. In NIPS . 3992-4001. -
  2. [8] Nitesh V Chawla, Aleksandar Lazarevic, Lawrence O Hall, and Kevin W Bowyer. 2003. SMOTEBoost: Improving prediction of the minority class in boosting. In ECML PKDD . Springer, 107-119. -
  3. [16] David Ingold and Spencer Soper. 2016. Amazon doesnfit consider the race of its customers. Should It. Bloomberg, April (2016). -
  4. [17] Vasileios Iosifidis and Eirini Ntoutsi. 2018. Dealing with Bias via Data Augmentation in Supervised Learning Scenarios. Jo Bates Paul D. Clough Robert J¨ aschke (2018), 24. -
  5. [18] Vasileios Iosifidis, Thi Ngoc Han Tran, and Eirini Ntoutsi. 2019. Fairnessenhancing interventions in stream classification. To appear in International Conference on Database and Expert Systems Applications (DEXA) proceedings (2019). -
  6. [19] Faisal Kamiran and Toon Calders. 2009. Classifying without discriminating. In Computer, Control and Communication . IEEE, 1-6. -
  7. [23] Emmanouil Krasanakis, Eleftherios Spyromitros Xioufis, Symeon Papadopoulos, and Yiannis Kompatsiaris. 2018. Adaptive Sensitive Reweighting to Mitigate Bias in Fairness-aware Classification. In WWW . ACM, 853-862. -
  8. [24] Jeff Larson, Surya Mattu, Lauren Kirchner, and Julia Angwin. 2016. How we analyzed the COMPAS recidivism algorithm. ProPublica (5 2016) 9 (2016). -
  9. [25] United States. Executive Office of the President and John Podesta. 2014. Big data: Seizing opportunities, preserving values . White House, Executive Office of the President. -
  10. [26] Dino Pedreschi, Salvatore Ruggieri, and Franco Turini. 2009. Measuring Discrimination in Socially-Sensitive Decision Records. In SDM . SIAM, 581-592. -
  11. [27] Geoff Pleiss, Manish Raghavan, Felix Wu, Jon Kleinberg, and Kilian Q Weinberger. 2017. On fairness and calibration. In NIPS . 5680-5689. -
  12. [29] Robert E Schapire. 1999. A brief introduction to boosting. In IJCAI , Vol. 99. 1401-1406. -
  13. [30] Robert E Schapire. 2013. Explaining adaboost. In Empirical inference . Springer, 37-52. -
  14. [31] Latanya Sweeney. 2013. Discrimination in online ad delivery. arXiv preprint arXiv:1301.6822 (2013). - · arXiv

Cited by

See all 111

Metadata

Authors
Iosifidis, V., & Ntoutsi, E.
Affiliations
Leibniz University Hannover (DE)
Venue
Proceedings of the 28th ACM International Conference on Information and Knowledge Management
Publisher
ACM
Published
2019-11-03
Pages
781-790
ISSN
2155-0751 (ISSN-L)
OpenAlex
W2974479098
Cited by
75
References
16
Citations by year
2026: 4 · 2025: 12 · 2024: 11 · 2023: 21 · 2022: 12 · 2021: 7 · 2020: 7 · 2019: 1
FWCI
7.04
Type
conference paper
Language
en
Open access
Locations
  • ACM International Conference on Information and Knowledge Management (CIKM) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
DFG (OSCAR)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Ethics and Social Impacts of AI
  • Physical Sciences › Computer Science › Artificial Intelligence › Imbalanced Data Classification Techniques
  • Social Sciences › Law › Discrimination and Equality Law
Keywords
algorithmic fairness, AdaBoost, class imbalance, sensitive attributes, protected groups, ensemble boosting

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.