Pith. sign in

REVIEW 1 cited by

Fairness-guided SMT-based Rectification of Decision Trees and Random Forests

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2011.11001 v1 pith:AJUTMCZD submitted 2020-11-22 cs.LG

classification cs.LG
keywords decisionrandomforeststreesfairrepairrepairapproachbiases
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Data-driven decision making is gaining prominence with the popularity of various machine learning models. Unfortunately, real-life data used in machine learning training may capture human biases, and as a result the learned models may lead to unfair decision making. In this paper, we provide a solution to this problem for decision trees and random forests. Our approach converts any decision tree or random forest into a fair one with respect to a specific data set, fairness criteria, and sensitive attributes. The \emph{FairRepair} tool, built based on our approach, is inspired by automated program repair techniques for traditional programs. It uses an SMT solver to decide which paths in the decision tree could have their outcomes flipped to improve the fairness of the model. Our experiments on the well-known adult dataset from UC Irvine demonstrate that FairRepair scales to realistic decision trees and random forests. Furthermore, FairRepair provides formal guarantees about soundness and completeness of finding a repair. Since our fairness-guided repair technique repairs decision trees and random forests obtained from a given (unfair) data-set, it can help to identify and rectify biases in decision-making in an organisation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives

    cs.LG 2026-07 accept novelty 5.5 of 10

    Combinatorial optimization provides global guarantees, certificates, and explicit trade-offs for trustworthy ML tasks spanning training, explanation, fairness, robustness, compression, and privacy.

Pith tools