Reject Option Classification
Description
Reject Option Classification is a post-processing method, proposed by Kamiran and colleagues (2012), that changes some of a trained classifier's decisions to reduce unfair outcomes between groups, without retraining it. It defines a 'critical region' around the decision boundary, where the predicted probability is close to 50 per cent and the model is least sure. Inside that region it gives the favourable outcome to people from the disadvantaged group and the unfavourable outcome to people from the advantaged group, whatever the model predicted, and decisions outside it are left alone. The width of the region is searched on a labelled validation set, so that a chosen fairness measure, such as statistical parity difference or equal opportunity difference, falls within a set bound while accuracy stays as high as possible. The method needs each person's group at prediction time.
Example Use Cases
Fairness
A graduate recruiter's data team has a CV-scoring model whose scores near the shortlisting cut-off are the least certain. Using a labelled validation set, it searches for the narrowest band around that cut-off that brings the difference in shortlisting rates between men and women within five percentage points, and reports how many candidates' outcomes the band changes.
A hospital data science team tests the method on an unplanned-readmission alert model to narrow the gap in missed-readmission rates between insurance groups. It adopts the change only if the gap falls below five percentage points while accuracy drops by under 10 per cent and alert volume changes by under 20 per cent, and drops the method if any limit is missed.
A court service reviewing a pre-trial risk score applies the method with race as the group attribute, so that defendants whose scores sit close to the high-risk cut-off are not decided by small score differences that may reflect the model's bias. The service reports to its oversight body how many decisions the band changes, in which direction, and what it costs in accuracy.
Limitations
- Needs a model that outputs scores, because the critical region is defined on them, so a model that outputs only yes/no labels cannot be used. The scores need not be calibrated probabilities, but if they are poorly calibrated or bunched together, the wrong people fall inside the region.
- Inside the region the outcome is set by group membership, so the method needs each person's group at decision time and treats people differently by group. This may be unlawful or unacceptable in some settings, such as hiring or lending, and the group attribute must be available when decisions are made.
- A person from the advantaged group with a borderline score receives the unfavourable outcome, and one from the other group the favourable outcome, whatever their individual merit. A wider band closes more of the fairness gap but sets more decisions by group instead of by score, so accuracy falls as the band widens.
- Cannot address bias in confident predictions outside the region. The method assumes discrimination is concentrated near the decision boundary, so where a model is confidently wrong about one group, the adjustment leaves those decisions as they are.
- The band is chosen by grid search on a labelled validation set against a fairness bound (the AIF360 default is plus or minus 0.05). A small or unrepresentative validation set gives an unreliable band, and if no setting meets the bound the search returns a fallback that may not be acceptable.
Resources
Research Papers
Decision Theory for Discrimination-Aware Classification
Social discrimination (e.g., against females) arising from data mining techniques is a growing concern worldwide. In recent years, several methods have been proposed for making classifiers learned over discriminatory data discrimination-aware. However, these methods suffer from two major shortcomings: (1) They require either modifying the discriminatory data or tweaking a specific classification algorithm and (2) They are not flexible w.r.t. discrimination control and multiple sensitive attribute handling. In this paper, we present two solutions for discrimination-aware classification that neither require data modification nor classifier tweaking. Our first and second solutions exploit, respectively, the reject option of probabilistic classifier(s) and the disagreement region of general classifier ensembles to reduce discrimination. We relate both solutions with decision theory for better understanding of the process. Our experiments using real-world datasets demonstrate that our solutions outperform existing state-of-the-art methods, especially at low discrimination which is a significant advantage. The superior performance coupled with flexible control over discrimination and easy applicability to multiple sensitive attributes makes our solutions an important step forward in practical discrimination-aware classification.
Exploiting reject option in classification for social discrimination control
Social discrimination is said to occur when an unfavorable decision for an individual is influenced by her membership to certain protected groups such as females and minority ethnic groups. Such discriminatory decisions often exist in historical data. Despite recent works in discrimination-aware data mining, there remains the need for robust, yet easily usable, methods for discrimination control. In this paper, we utilize reject option in classification, a general decision theoretic framework for handling instances whose labels are uncertain, for modeling and controlling discriminatory decisions. Specifically, this framework permits a formal treatment of the intuition that instances close to the decision boundary are more likely to be discriminated in a dataset. Based on this framework, we present three different solutions for discrimination-aware classification. The first solution invokes probabilistic rejection in single or multiple probabilistic classifiers while the second solution relies upon ensemble rejection in classifier ensembles. The third solution integrates one of the first two solutions with situation testing which is a procedure commonly used in the court of law. All solutions are easy to use and provide strong justifications for the decisions. We evaluate our solutions extensively on four real-world datasets and compare their performances with previously proposed discrimination-aware classifiers. The results demonstrate the superiority of our solutions in terms of both performance and flexibility of applicability. In particular, our solutions are effective at removing illegal discrimination from the predictions. (C) 2017 Published by Elsevier Inc.