mlsanityData to 7 Oct 2026

EiFFFeL: Enforcing Fairness in Forests by Flipping Leaves

arXiv 2112.14435 ↗First posted 29 Dec 2021cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Nowadays Machine Learning (ML) techniques are extensively adopted in many socially sensitive systems, thus requiring to carefully study the fairness of the decisions taken by such systems. Many approaches have been proposed to address and to make sure there is no bias against individuals or specific groups which might originally come from biased training datasets or algorithm design. In this regard, we propose a fairness enforcing approach called EiFFFeL:Enforcing Fairness in Forests by Flipping Leaves which exploits tree-based or leaf-based post-processing strategies to relabel leaves of selected decision trees of a given forest. Experimental results show that our approach achieves a user defined group fairness degree without losing a significant amount of accuracy.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 8 of its 34 references that are in the map. First posted on arXiv 29 Dec 2021.

Builds on

8 of 34 references.

References · 8

  1. 2016Equality of Opportunity in Supervised Learningcited by 2,000
  2. 2017On Fairness and Calibrationcited by 406
  3. 2019Learning Optimal and Fair Decision Trees for Non-Discriminative Decision-Makingcited by 75
  4. 2019FAHT: An Adaptive Fairness-aware Decision Tree Classifiercited by 63
  5. 2019Conscientious Classification: A Data Scientist's Guide to Discrimination-Aware Classificationcited by 55
  6. 2017Fair Forests: Regularized Tree Induction to Minimize Model Biascited by 19
  7. 2015A survey on measuring indirect discrimination in machine learningcited by 15
  8. 2019Learning Fair and Transferable Representationscited by 6

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.