<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Fair Selective Classifier to Put Humans in the Loop</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Daphne Lenders</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrea Pugnana</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roberto Pellungrini</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Toon Calders</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fosca Gianotti</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dino Pedreschi</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Adrem Data Lab, University of Antwerp</institution>
          ,
          <addr-line>Antwerp</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>DigiTax, University of Antwerp</institution>
          ,
          <addr-line>Antwerp</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>KDD Lab, Scuola Normale Superiore</institution>
          ,
          <addr-line>Pisa</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>KDD Lab, University of Pisa</institution>
          ,
          <addr-line>Pisa</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper we propose a practical human-in-the-loop approach for algorithmic fairness, utilizing the selective classification framework. We describe a classification model that abstains from making predictions in cases of unfairness or uncertainty. Any rejected predictions can be passed on to a human expert, to review the possible unfairness issues and make the decisions more just.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Fair Classification</kwd>
        <kwd>Selective Classification</kwd>
        <kwd>Human in the loop</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Fairness in automated decision-making tasks has been an ongoing research area for the last 15
years. While so far fairness has often been treated as a mathematical notation to be optimized,
recently more attention has been paid to its highly context-dependent nature. Computer Science
and legal scholars have argued that the fairness of an entire system cannot be expressed through
a single number, but that instead a system’s fairness should be assessed by studying where
unfairness occurs, which subgroups are afected by it and in which cases any disparate treatment
might be justifiable [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ]. Hence, also to improve the fairness of a decision-making model,
optimizing for one single fairness notion is not suficient and instead, one should take a
contextdependent approach and fix unfairness where it occurs [
        <xref ref-type="bibr" rid="ref1 ref3">1, 3</xref>
        ]. Since it is dificult to automatize
such nuanced considerations the call for having a human expert, with suficient knowledge
about a domain, is growing. This call is backed by AI legislation, with the recently passed EU
AI Act stating in its Article 14 that any “high-risk" AI system should be overseen and adaptable
by a human, to minimise any risks that might otherwise be posed by the system [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. While the
necessity for having a human-in-the-loop is clear, no practical guidelines are given about how
a human could oversee a decision-making process, especially if a system makes decisions for
thousands of individuals that cannot all be manually reviewed.
      </p>
      <p>
        In our paper, we propose to utilize the framework of selective classification [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Selective
classification allows building classifiers that can refrain from predicting when not confident
enough. This allows one to trade of predictive performance for coverage, i.e. the percentage of
instances for which a prediction is provided. In our paper, we extend the selective classification
framework to take into account not only the uncertainty around a prediction but also its
unfairness. Possibly unfair instances can then be passed on to human experts for review. Our
selective classifier also provides explanations for why predictions are perceived as unfair, which
can further help experts in making more well-informed decisions.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Methodology</title>
      <p>
        In this section, we illustrate our selective classifier on the running example of the “income
dataset" [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. This is a dataset, consisting of information about individuals’ working life, their
education, and their demographics. The associated classification task is to predict peoples’
income level, specifically, if it is above 50K a year. To have a clearer idea of how this prediction
task may be relevant in real life, imagine a bank using the “high income" prediction as a proxy
for whether an individual has the financial means to pay back a loan.
      </p>
      <p>In this task, we consider the attributes “sex" and “race" as sensitive information, that may
serve as grounds for illegal discrimination. In this data the possible values for sex are “male" and
“female" and the possible values for race are “white", “black" and “other". A standard classification
model, that we have trained on this data, performs best on the reference group of white men
while other groups are at higher risk of unfair treatment. This unfair treatment holds in terms
of the model’s predictions and its errors. In other words, the ratio of positive decision outcomes
(high income) is considerably lower for non-white-men than for white men. Also, the “False
Negative" errors for these groups are severe, meaning that even if individuals from these groups
have a high income, the classifier is likely to predict a low income for them.</p>
      <p>We have created a selective classification model that can increase the fairness and the accuracy
of such a base classifier, by not making predictions for a) individuals that it is not certain about
and b) for individuals that it is certain about, but where the prediction is biased.</p>
      <p>
        In Figure 1 we describe the basic intuition of how this selective classification model works. It
consists of a base classifier, that makes an initial prediction for an instance and a rejector, that
decides whether to keep, reject or intervene on this prediction. To do so, it receives an instance
along with the associated prediction label and prediction probability and first analyses the
label’s fairness on a global and local level. For the first, it checks if the instance and prediction
fall under any global patterns of unfairness that have been established in the base classifier,
using the methodology of possibly-discriminated subgroups by [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. For the local fairness check,
the Situation Testing algorithm is executed, and the prediction label for the instance in question
is compared to the labels of similar instances in the dataset [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. If both the global and local
fairness checks fail, we consider the prediction label to be unfair. The rejector then takes the
prediction probability of the base classifier as a proxy for its certainty, and depending on that
performs a fairness intervention or abstains from making a decision. If the certainty of the
prediction is below a certain threshold, a fairness intervention is performed; otherwise, it rejects
the original prediction. The reasoning behind the fairness intervention is that an uncertain and
unfair prediction is likely to be inaccurate, and it is safe to alter it. In the case in which the
rejector has not deemed a predicted label as unfair, it may still abstain from predicting in case
the prediction probability falls under a dedicated threshold. Thus, the rejector rejects fair but
uncertain predictions and only keeps the original prediction if it is both fair and certain.
Illustrative Example To better illustrate the idea behind our selective classifier, we will go
through an illustrative example, showing how our selective classifier rejects the base prediction
for a woman, at risk of discrimination. In Figure 2 we see that a baseline classifier needs to make
a prediction for a married woman, aged between 60-69 years and working in the Sales sector.
The baseline classifier predicts that she has a low income with a probability of 74.17%. To decide
whether to keep this prediction our rejector first assesses if this prediction falls under any global
patterns of unfairness. To do so, it has a list of subgroups that the classifier is known to behave
unfairly on [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. In this case, our instance falls under the subgroup of women, aged between
60 and 69, working in the Sales sector. This subgroup is deemed to be at risk of discrimination
because, the classifier is known to predict a low income for them 90% of the times, compared to
only 40% of times for the same subgroup who are not female. Because of the high diference, the
prediction has failed the first global fairness check, and a local fairness check is performed. In this
case, the 3 most similar instances from the reference group of white men, and the non-reference
group are selected and their positive label ratios are compared to each other. This allows the
rejector to not just focus on the classifier’s behaviour on individuals working in Sales and aged
between 60 and 69; but also take other relevant characteristics, like their education and their
amount of working hours into account. Because even on this fine-grained analysis, the reference
group receives more favourable treatment (2/3 positive labels compared to 0/3), the individual
fairness check fails. The overall prediction is therefore deemed unfair, and the rejector needs
to decide whether to perform a fairness intervention or reject the prediction. To do so, it checks
if the prediction probability of 74.17% falls above some threshold (which is learned in a separate
step not described in this methodology) of certainty. Since in this case, it does, we fall into the
case of an unfair but certain prediction, and the rejector rejects the originally predicted label.
      </p>
      <p>In a next step, the instance could be passed on to a human expert who can review the decision
in more detail. The rejector’s global and local fairness analysis can help in making the rejection
process more transparent and let human experts make more well-informed decisions.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Preliminary Results &amp; Discussion</title>
      <p>In Table 1 we show some preliminary results of applying our fair selective classifier on the
income dataset. We compare the performance of a full coverage classifier (BC), with the
performance over all non-rejected instances of a regular uncertainty-based classifier (USC) and
our fair selective classifier (FSC). Both selective classifiers had a coverage of 80%, meaning they
could reject 20% of the instances. All performances are averaged over 10 test sets. Regarding</p>
      <sec id="sec-3-1">
        <title>Base Classifier Prediction</title>
        <p>Age: 60 - 69
Sex: Female</p>
        <p>Race: White
Marital Status: Married
Education: High School</p>
        <p>Diploma
Workinghours: 40-49
Workclass: Private</p>
        <p>Occupation: Sales
Predicted Label: Low Income
Prediction Probability: 0.7417</p>
      </sec>
      <sec id="sec-3-2">
        <title>Global Fairness Check</title>
        <p>At-Risk of Discrimination
sex = Female AND age = 60
69 AND occupation = Sales
race = Black AND education =
Master AND age = 50-59
sex = Female AND race = Other
AND occupation = Engineering</p>
        <p>At-Risk of Favouritism
sex = Male AND race = White
AND education = Bachelor AND
workinghours = More than 50
sex = Male AND race = White
AND education = Master</p>
      </sec>
      <sec id="sec-3-3">
        <title>Why is this marked as discriminatory?</title>
        <p>- For this subgroup classifier predicts 'low income' 90% of the time
- For opposing group 'low income' is only predicted 40% of the time
(NOT Female, 60-69 years, working in Sales)
PMMDrMMMMWe..PivaadSaaSroirrdrriettcrrrrraaoiiciidteeeettiweiouuddddcdnsstisoHHHHHHnEfEoiiisiiigggdgggdrhhhuhhhfuLsoccSSSoiSSSrmaacccccccstthhhiahhhiiilomoaooolooonnroooFoooillllilllaaniWrWsrni444t434.n.aHHe000000sns---o---ot444434casuu999e999nrrCsscsheNesWWOPPPcPPP'..kWrrrrrrTCCiiiiiivvvvvvllh'aaaaaaaaWittttttssteeeeeeehssi&amp;teM&amp;PPHHLLLLarrMooooiileeggewwwwddhha'..le' lllilacaekac+bLoohFCG
Individual Discrimination Score = (2/3) - (0/3) = 2/3</p>
      </sec>
      <sec id="sec-3-4">
        <title>Certainty Check</title>
        <p>Prediction Probability = 0.7417</p>
        <p>Probability lays above
certainty threshold for unfair</p>
        <p>predictions
Unfair + Certain Prediction:</p>
        <p>REJECT!
overall performance, we see that both selective classifiers manage to increase the performance
of the base classifier, by abstaining from some of its decisions. The performance increase of the
uncertainty-based classifier is higher, but when focussing on the False Positive-, False Negative
and Positive Decision Ratios over diferent demographics, we see that this comes at the cost
of fairness. Regarding all measures, a non-selective baseline has high diferences between the
group of white men and other groups. In many cases, this diference is increased with the
uncertainty-based classifier: it mostly improves the performance for the reference group, but
decreases it for others. Our selective classifier manages to make the performance measures over
all groups more equal, decreasing the models errors in regards to its False Positive Rates for
white men, and its False Negative Rates for other groups. This also results in less diferences
in Positive Decision Ratios across demographics. While the results of our method are not
perfect, and the error rates on e.g. the group of black men are still quite high, we believe that
a human-in-the-loop can further enhance the fairness of the system: for instance, they can
equalize the positive decision ratios by giving more positive decision labels over all rejected
instances of minority groups. Further, they could improve the system, by embedding their
domain knowledge in it; e.g. specifying known subgroups at risk of discrimination (used for the
global fairness check), that might have been missed by our system.</p>
        <p>Acknowledgments D. Lenders and T. Calders were funded by Digitax Centre of Excellence
UAntwerp and by Research Foundation Flanders under FWO file number: V467123N A. Pugnana
and R. Pellungrini and D. Pedreschi and F. Giannotti have received funding by PNRR - M4C2
- Investimento 1.3, Partenariato Esteso PE00000013 - “FAIR - Future Artificial Intelligence
Research" - Spoke 1 “Human-centered AI", funded by the European Commission under the
NextGeneration EU programme, ERC-2018-ADG G.A. 834756 “XAI: Science and technology
for the eXplanation of AI decision making” and Prot. IR0000013. This work was also funded
by the European Union under Grant Agreement no. 101120763 - TANGO. Views and opinions
expressed are however those of the author(s) only and do not necessarily reflect those of the
European Union or the European Health and Digital Executive Agency (HaDEA). Neither the
European Union nor the granting authority can be held responsible for them. The work has
also been realised thanks to NextGenerationEU - National Recovery and Resilience Plan, PNRR)
- Project: “SoBigData.it - Strengthening the Italian RI for Social Mining and Big Data Analytics”
- Prot. IR000001 3 - Notice n. 3264 of 12/28/2021.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lenders</surname>
          </string-name>
          , T. Calders,
          <article-title>Users' needs in interactive bias auditing tools introducing a requirement checklist and evaluating existing tools</article-title>
          ,
          <source>AI and Ethics</source>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>29</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Costanza-Chock</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. D.</given-names>
            <surname>Raji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Buolamwini</surname>
          </string-name>
          ,
          <article-title>Who audits the auditors? recommendations from a field scan of the algorithmic auditing ecosystem</article-title>
          ,
          <source>in: Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>1571</fpage>
          -
          <lpage>1583</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Wachter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mittelstadt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Russell</surname>
          </string-name>
          ,
          <article-title>Why fairness cannot be automated: Bridging the gap between eu non-discrimination law and ai</article-title>
          ,
          <source>Computer Law &amp; Security Review</source>
          <volume>41</volume>
          (
          <year>2021</year>
          )
          <fpage>105567</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>The</given-names>
            <surname>European</surname>
          </string-name>
          <string-name>
            <surname>Commission</surname>
          </string-name>
          ,
          <source>The EU Artificial Intelligence Act - Article 14</source>
          ,
          <year>2023</year>
          . https://artificialintelligenceact.com/title-iii/chapter-2/article-14/.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K.</given-names>
            <surname>Hendrickx</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Perini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. V.</given-names>
            <surname>der Plas</surname>
          </string-name>
          , W. Meert,
          <string-name>
            <given-names>J.</given-names>
            <surname>Davis</surname>
          </string-name>
          ,
          <article-title>Machine learning with a reject option: A survey</article-title>
          ,
          <source>ArXiv abs/2107</source>
          .11277 (
          <year>2021</year>
          ). URL: https://api.semanticscholar.org/ CorpusID:236318084.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Schmidt</surname>
          </string-name>
          , Retiring adult:
          <article-title>New datasets for fair machine learning</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>34</volume>
          (
          <year>2021</year>
          )
          <fpage>6478</fpage>
          -
          <lpage>6490</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>D.</given-names>
            <surname>Pedreschi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ruggieri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Turini</surname>
          </string-name>
          ,
          <article-title>Discrimination-aware data mining</article-title>
          ,
          <source>in: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          ,
          <year>2008</year>
          , pp.
          <fpage>560</fpage>
          -
          <lpage>568</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>B. T.</given-names>
            <surname>Luong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ruggieri</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          <article-title>Turini, k-nn as an implementation of situation testing for discrimination discovery and prevention</article-title>
          ,
          <source>in: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          ,
          <year>2011</year>
          , pp.
          <fpage>502</fpage>
          -
          <lpage>510</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>