<!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>Human-Grounded Evaluation Process for Explainable Machine Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Katharina Beckh</string-name>
          <email>katharina.beckh@iais.fraunhofer.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sebastian Müller</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stefan Rüping</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>LWDA'22: Lernen</institution>
          ,
          <addr-line>Wissen, Daten, Analysen</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>ML2R - Competence Center Machine Learning Rhein-Ruhr</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Bonn</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <abstract>
        <p>Methods from explainable machine learning are increasingly applied. However, evaluation of these methods is often anecdotal and not systematic. Prior work has identified properties of explanation quality and we argue that evaluation should be based on them. In this position paper, we provide an evaluation process that follows the idea of property testing. The process acknowledges the central role of the human, yet argues for a quantitative approach for the evaluation. We find that properties can be divided into two groups, one to ensure trustworthiness, the other to assess comprehensibility. Options for quantitative property tests are discussed. Future research should focus on the standardization of testing procedures.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The development and adoption of complex machine learning (ML) models has given rise to
research that seeks to make these models explainable [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ]. Explainability methods aim
to provide reliable insights into reasons for model behavior. The motivations for why these
insights are sought after are manifold: Debugging models during development, finding undesired
artifacts in data, learning from models to gain novel scientific insights and to verify that the
model fulfills ethical or legal requirements [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. These insights enable informed decisions about
trusting ML models, thus giving a foundation to foster societal acceptance. Despite the multitude
of explanation methods available, one open question is still what evaluation process is suitable
to quantify performance of an explanation system [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. For explainable machine learning to
evolve as a field we need to find ways to systematically evaluate explanation methods, taking
into account both the user and that explanations represent model behavior [
        <xref ref-type="bibr" rid="ref6 ref7 ref8 ref9">6, 7, 8, 9</xref>
        ]. In
this position paper, we present an evaluation process that factors in both goals and describe
directions for quantitative testing to facilitate adoption by practitioners.
*equal contribution
      </p>
      <sec id="sec-1-1">
        <title>User Independent Properties</title>
        <sec id="sec-1-1-1">
          <title>Faithfulness</title>
        </sec>
        <sec id="sec-1-1-2">
          <title>Completeness</title>
        </sec>
        <sec id="sec-1-1-3">
          <title>Consistency</title>
        </sec>
        <sec id="sec-1-1-4">
          <title>Continuity</title>
        </sec>
        <sec id="sec-1-1-5">
          <title>Contrastivity</title>
        </sec>
        <sec id="sec-1-1-6">
          <title>Confidence</title>
        </sec>
      </sec>
      <sec id="sec-1-2">
        <title>User Dependent Properties</title>
        <sec id="sec-1-2-1">
          <title>Compactness</title>
        </sec>
        <sec id="sec-1-2-2">
          <title>Usability</title>
        </sec>
        <sec id="sec-1-2-3">
          <title>Plausibility</title>
        </sec>
        <sec id="sec-1-2-4">
          <title>Refers to how accurate an explanation is to the model’s reasoning.</title>
        </sec>
        <sec id="sec-1-2-5">
          <title>Describes how much of the model behavior is described.</title>
        </sec>
        <sec id="sec-1-2-6">
          <title>Refers to how deterministic and implementation-invariant the explanation method is.</title>
        </sec>
        <sec id="sec-1-2-7">
          <title>Similar inputs should have similar explanations.</title>
        </sec>
        <sec id="sec-1-2-8">
          <title>Answers “why not?” or “what if?” questions.</title>
        </sec>
        <sec id="sec-1-2-9">
          <title>Probability information in the explanation.</title>
        </sec>
        <sec id="sec-1-2-10">
          <title>Represents the size of the explanation.</title>
        </sec>
        <sec id="sec-1-2-11">
          <title>Degree of fulfillment of user satisfaction and efectiveness.</title>
        </sec>
        <sec id="sec-1-2-12">
          <title>Refers to how convincing an explanation is to a user.</title>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
      <p>
        Evaluation of explainable systems is typically categorized into three types: (1)
applicationgrounded evaluation with humans and applied tasks (2) human-grounded evaluation with
humans but proxy tasks and (3) functionally-grounded evaluation without humans and proxy
tasks instead [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        In a recent review of more than 300 papers from prominent ML conferences, it was found that
evaluation is roughly 30% anecdotal evidence and roughly 20% with users [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. In a smaller-scale
survey on explainable natural language processing, 50 papers were reviewed [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Roughly 60%
used no or ”informal” evaluation, 23% comparison to ground truth and 17% human evaluation.
The percentage of human evaluation is comparable to the more recent study, however, the
number for papers with anecdotal evaluation is double. An underlying reason could be that ”no
or informal” evaluation includes approaches that were deemed as not anecdotal by the other
study. These reviews reveal that at least 30% and up to 60% of papers do not present adequate
evaluation for explanation quality. Although explanation methods are abundantly available
and incorporated in ML systems, the field is still lacking standards regarding the evaluation
of explanation quality similar to the standards we expect from an evaluation on predictive
performance.
2.1. Explanation properties
There exist multiple works describing diferent properties of explanations that can be used for
evaluation [
        <xref ref-type="bibr" rid="ref11 ref12 ref13 ref7">7, 11, 12, 13</xref>
        ]. Desired properties and definitions are exemplified in the list in Table 1.
The list is not exhaustive and what properties (sometimes referred to as attributes or notions
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]) are necessary to consider, depends on the particular application. A frequently discussed
distinction is one between evaluating faithfulness and plausibility of an explanation [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
Faithfulness is also referred to as correctness or fidelity; plausibility as coherence [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Evaluation
strategies for these properties difer. For faithfulness, quantitative evaluation metrics exist,
e.g. ”sensitivity” and ”infidelity” [
        <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
        ] for feature attribution methods. Plausibility can be
evaluated by comparing ML explanations against ”ground-truth” explanations [16]. For an
overview of properties we refer to a recent survey which lists evaluation methods for each
property [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. With a number of identified properties, the question arises why we do not put
these properties to use to systematically evaluate explainability methods.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Trustworthiness and Comprehensibility</title>
      <p>
        None of the goals of explainable ML, be it generating scientific insight or enabling model
verification, can be achieved on the basis of faulty explanations. Hence, it is crucial to ensure
that explainability systems deliver a high quality output that represents the model behavior
truthfully [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]. At the same time, all explanations are meant to be understood by a human
user. Therefore, explanations are only useful if they are comprehensible [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ]. An evaluation
process for explanation systems will need to ensure both, the quality of the explanations as
well as the comprehensibility for the target user. We distinguish between user independent
and user dependent properties with respect to the evaluation process (see subsequent sections).
For this, we define the notion of trustworthiness to encompass all properties that measure
the degree to which the explanations reflect the true model behavior. Analogously, we define
comprehensibility to encompass all properties that measure to what degree and how eficiently
the user is able to reach their interaction goals.
3.1. Ensuring Trustworthiness: User Independent Properties (UIPs)
Human preference for an explanation does not necessarily correlate with its trustworthiness
[16]. To protect against user bias, we argue that a positive assessment of UIPs needs to be a
pre-requisite for the subsequent user-dependent evaluation of the system.
      </p>
      <p>
        Not all properties are applicable to all explanation methods. For example, explanation methods
that involve random sampling are naturally less consistent than deterministic methods. One
idea is to use fact sheets to track applicable properties of an explanation method [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], thus
making it easier to gauge what properties are relevant for a given system.
      </p>
      <p>We have the impression that existing evaluation measures for UIPs are not widely used yet,
but hope that the integration of measures into emerging coding-libraries1 has an efect on
practice.
3.2. Ensuring Comprehensibility: User Dependent Properties (UDPs)
Carrying out user studies is a costly and time-consuming process. We argue that generating
reports on UDPs should be made as easy as possible for practitioners. We thus want to discuss
possibilities to facilitate quantitative measurements of UDPs.</p>
      <p>Compactness is a property that is closely tied to managing users’ Cognitive Load [17]. For
this, we can turn to the concept of Working Memory [18] that describes the limit of how many
chunks (meaningful items/ thoughts) a human can actively entertain at the same time. What
1e.g. Captum and Quantus
constitutes a chunk in the respective application needs context-level definition. For text data
it might be a single word, for image data it might be all pixels belonging to the same object.
What constitutes a chunk also depends on user experience in the respective domain, e.g. a more
experienced user having developed a more complex mental model to associate information with
can process larger amounts of information than inexperienced users.</p>
      <p>Plausibility measures to what extent the explanation corresponds to user expectations.
Providing practitioners with a ground truth dataset containing human verified explanations
would enable them to report a degree of explanatory overlap as explored by [16]. Remarkably,
the study also found user biases in the subjective rating of explanations. This indicates that
purely qualitative evaluation is not suficient providing another reason to develop quantitative
measures. A possible disadvantage of ground truth datasets is that they are task specific, hence,
transferability might be an issue. Another direction for plausibility checks are test scenarios,
inspired by software engineering practices [ 19]. Test scenarios can be generated according to
user expectations. In a scenario with text data and feature highlighting, possible checks could be
the following: ”words with low information value, e.g. the, should not be part of an explanation”
or ”replacing adjectives with synonyms should yield the same attribution”. However, usefulness
of ground truth datasets or other test scenarios have their limits. If an explanation does not
comply with user expectations that does not mean that it is not a faithful description of model
behavior. Discrepancies between expected explanation and observed explanations have to be
investigated carefully as to not blame the explainability method when it is really the model that
behaves unexpectedly. If the explanation is trustworthy, a plausibility check does not reveal
anything about the explanation but only something about the model.</p>
      <p>Usability is the most elusive property of the three because it not only depends on the
explanation methods used but also on presentation, UI, tech-afinity of the user and the specific
questions the user wants to be answered. Options to quantitatively measure usability are
timeon-task or task-success with an explanation condition (with or without explanation) [20, 21, 22].
The challenge remains that user studies, whether they are qualitative or quantitative, require
time and resources.</p>
      <p>This list of properties is non-exhaustive and relevance of individual metrics may vary
depending on the application setting or the diversity of the targeted user group.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Process for Human-Grounded Quantitative Evaluation</title>
      <p>To establish good evaluation practices we propose the evaluation process shown in Figure 1.
The key idea of this process is to enforce UIP evaluation both before evaluating UDPs and also
after any explanation changing alterations to the system.</p>
      <p>At first the Context needs to be captured [23]. User Interviews provide an investigation
into what goals the users want to accomplish and what questions need to be answered, e.g.
[24]. Beyond immediate user intent, engineers may rely on established Design Guidelines for
comparable scenarios to inform initial design decisions, e.g. regarding compositionality.</p>
      <p>This informs the Requirement Catalogue used to determine what Explainability Methods
should be selected to fulfill identified user needs. Upon implementation, the system is evaluated
with regards to applicable UIPs. If UIPs indicate an improper representation of model behavior</p>
      <p>Design
Guidelines</p>
      <p>User
Interviews</p>
      <p>Requirement
Catalogue
Context</p>
      <p>Explainability</p>
      <p>Methods</p>
      <p>User
Independent</p>
      <p>Property
Checks</p>
      <p>User
Dependent
Property</p>
      <p>Checks
Trustworthy</p>
      <p>Comprehensible</p>
      <p>Explanation</p>
      <p>System
by the explanations, the engineer returns to choosing diferent Explainability Methods and UIP
checks are repeated. Once UIP checks are passed, the system is assessed with regards to the
UDPs. This can involve a real user study or a quantitative evaluation. If the explanations are
deemed incomprehensible, this requires an update of the Requirement Catalogue. Thus, UDPs
can impact UIPs: For example, if tests failed for Compactness and the user cannot cope with the
amount of information presented, displaying less information has an impact on Completeness
of the displayed explanation. If the system is adapted, a re-evaluation of the UIPs is necessary
to ensure trustworthiness is maintained.</p>
      <p>Most likely, UIP-UDP-trade-ofs will be unavoidable in practice, e.g. due to specific user
needs or a lack of choice of better explanation methods. Finding a balance will be dificult.
Returning to our previous example: A UDP check indicates that the user prefers a more compact
explanation. The engineer implements a slider to adjust the amount of chunks to be displayed at
the same time. Seemingly, all information is still available to the user, yet the user can now pick
at what level of compactness the explanation appears the most plausible. This rather enables
them to confirm their own bias of the model instead of investigating the true model behavior.
Providing the user with information about how their actions afect trustworthiness might be
a possible remedy. However, in some scenarios, e.g. where an explanation system is used to
investigate a model for certification or in a legal dispute, trustworthiness demands may be
nonnegotiable.</p>
      <p>
        In general, we see the risk that compromising UIPs, such as faithfulness, opens the way for
manipulation in adversarial settings [25]. We expect that defining the boundaries of
permissible UIP-UDP-trade-ofs will be challenging as indicated by literature discussing
faithfulnessplausibility trade-ofs [
        <xref ref-type="bibr" rid="ref7">7, 26</xref>
        ].
      </p>
      <p>For works that propose a novel explanation method without a direct use case, it would be
helpful to provide information on applicable UIPs and a discussion of how UDPs might impact
the performance under which circumstances.</p>
      <p>”The food was delicious and the price somewhat fair .” If a user argues for more compactness the
explanation could look like the following
sentence with ”fair” not being highlighted.
”The food was delicious and the price somewhat fair.” By removing the term ”fair” from the
feature highlighting the explanation is more
compact but less complete.</p>
      <sec id="sec-4-1">
        <title>Example: Interaction between the UDP Compactness and the UIP Completeness.</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Open Research Directions</title>
      <p>The standardization of UIPs and UDPs would enable the development of software-packages that
automatically test for applicable properties given an explanation system.</p>
      <p>The number of quantitative tests available for UDPs is still low which we attribute to the
subjective nature of UDPs. Nevertheless, quantitative tests for UDPs will be helpful and reliable
means to better compare methods.</p>
      <p>Furthermore, we recommend that newly proposed explanation methods perform ablation
studies to simulate possible application scenarios, or at least include discussions to analyze
trustworthiness-comprehensibility trade-ofs. Likewise, indicating applicable UIPs and reporting
on respective statistics should become the standard, similar to the reporting that is customary
for predictive performance.</p>
      <p>Trust is often stated as goal of explainable ML. Naturally, it would be interesting to investigate
how explanation systems developed with the proposed process score with regards to (in-)
appropriate trust.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>Evaluation of explainable ML is essential to demonstrate trustworthiness and ensure
comprehensibility of an explanation system. However, there are no guidelines or standards for evaluation
yet. In this work, we argued for quantitative human-grounded evaluation of explainable ML. We
presented an evaluation process that includes the user and places importance on quantitative
tests. Explanation quality is considered as a construct consisting of several properties. We split
the properties into two sets, one to ensure trustworthiness, the other to assess comprehensibility.
We highlight that adaptations of the explanation system based on comprehensibility checks can
impact properties that quantify trustworthiness. We raise the question whether this trade-of is
justifiable under any circumstances and call for a discussion within the community to further
develop a position.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>We thank the ML2R Trustworthy ML group and the MLAI Lab for the helpful discussions.
This research has been partly funded by the Federal Ministry of Education and Research of
Germany as part of the competence center for machine learning ML2R (01|S18038BC). K. Beckh
has contributed as part of the SmartHospital.NRW project which is funded by the Ministry for
Economic Afairs, Innovation, Digitalization and Energy of the State of North Rhine-Westphalia.
[16] S. Mohseni, J. E. Block, E. Ragan, Quantitative evaluation of machine learning explanations:
A human-grounded benchmark, in: 26th International Conference on Intelligent User
Interfaces, 2021, pp. 22–31.
[17] J. L. Plass, R. Moreno, R. Brünken, Cognitive load theory, Cambridge University Press
(2010).
[18] N. Cowan, The magical mystery four: How is working memory capacity limited, and
why?, Current Directions in Psychological Science 19 (2010) 51–57.
[19] M. T. Ribeiro, T. Wu, C. Guestrin, S. Singh, Beyond accuracy: Behavioral testing of NLP
models with CheckList, in: Proceedings of the 58th Annual Meeting of the Association for
Computational Linguistics, ACL, Online, 2020, pp. 4902–4912.
[20] I. Lage, E. Chen, J. He, M. Narayanan, B. Kim, S. J. Gershman, F. Doshi-Velez, Human
evaluation of models built for interpretability, in: Proceedings of the AAAI Conference on
Human Computation and Crowdsourcing, volume 7, 2019, pp. 59–67.
[21] J. P. Dietvorst, Berkeley J .and Simmons, C. Massey, Algorithm aversion: People
erroneously avoid algorithms after seeing them err, Journal of Experimental Psychology:
General 144 (2015) 114.
[22] F. Poursabzi-Sangdeh, D. G. Goldstein, J. M. Hofman, J. W. Wortman Vaughan, H. Wallach,
Manipulating and measuring model interpretability, in: Proceedings of the 2021 CHI
Conference on Human Factors in Computing Systems, CHI ’21, ACM, 2021.
[23] U. Ehsan, Q. V. Liao, M. Muller, M. O. Riedl, J. D. Weisz, Expanding explainability: Towards
social transparency in ai systems, in: Proceedings of the 2021 CHI Conference on Human
Factors in Computing Systems, 2021, pp. 1–19.
[24] Q. V. Liao, D. Gruen, S. Miller, Questioning the AI: Informing Design Practices for
Explainable AI User Experiences, Proceedings of the 2020 CHI Conference on
Human Factors in Computing Systems (2020) 1–15. URL: http://arxiv.org/abs/2001.02478.
arXiv:2001.02478.
[25] S. Bordt, M. Finck, E. Raidl, U. von Luxburg, Post-hoc explanations fail to achieve their
purpose in adversarial contexts, arXiv preprint arXiv:2201.10295 (2022).
[26] Z. C. Lipton, The mythos of model interpretability: In machine learning, the concept of
interpretability is both important and slippery., Queue 16 (2018) 31–57.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Danilevsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Qian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Aharonov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Katsis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kawas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sen</surname>
          </string-name>
          ,
          <article-title>A survey of the state of explainable AI for natural language processing</article-title>
          ,
          <source>in: Proceedings of the 1st Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics and the 10th International Joint Conference on Natural Language Processing</source>
          ,
          <string-name>
            <surname>ACL</surname>
          </string-name>
          , Suzhou, China,
          <year>2020</year>
          , pp.
          <fpage>447</fpage>
          -
          <lpage>459</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>K.</given-names>
            <surname>Beckh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Müller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jakobs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Toborek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fischer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Welke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Houben</surname>
          </string-name>
          , L. von Rueden,
          <article-title>Explainable machine learning with prior knowledge: An overview</article-title>
          ,
          <source>arXiv preprint arXiv:2105.10172</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Adadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Berrada</surname>
          </string-name>
          ,
          <article-title>Peeking inside the black-box: A survey on explainable artificial intelligence (xai)</article-title>
          ,
          <source>IEEE access 6</source>
          (
          <year>2018</year>
          )
          <fpage>52138</fpage>
          -
          <lpage>52160</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>C. Molnar,</surname>
          </string-name>
          <article-title>Interpretable machine learning</article-title>
          , second ed.,
          <source>leanpub.com</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nauta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Trienes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Pathak</surname>
          </string-name>
          , E. Nguyen,
          <string-name>
            <given-names>M.</given-names>
            <surname>Peters</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Schmitt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schlötterer</surname>
          </string-name>
          , M. van
          <string-name>
            <surname>Keulen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Seifert</surname>
          </string-name>
          ,
          <article-title>From anecdotal evidence to quantitative evaluation methods: A systematic review on evaluating explainable ai</article-title>
          ,
          <source>arXiv preprint arXiv:2201.08164</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Alvarez-Melis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. S.</given-names>
            <surname>Jaakkola</surname>
          </string-name>
          ,
          <article-title>On the robustness of interpretability methods</article-title>
          , arXiv preprint arXiv:
          <year>1806</year>
          .
          <volume>08049</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jacovi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Goldberg</surname>
          </string-name>
          ,
          <article-title>Towards faithfully interpretable NLP systems: How should we define and evaluate faithfulness?, in: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</article-title>
          ,
          <string-name>
            <surname>ACL</surname>
          </string-name>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>4198</fpage>
          -
          <lpage>4205</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M. O.</given-names>
            <surname>Riedl</surname>
          </string-name>
          ,
          <article-title>Human-centered artificial intelligence and machine learning</article-title>
          ,
          <source>Human Behavior and Emerging Technologies</source>
          <volume>1</volume>
          (
          <year>2019</year>
          )
          <fpage>33</fpage>
          -
          <lpage>36</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Páez</surname>
          </string-name>
          ,
          <article-title>The pragmatic turn in explainable artificial intelligence (xai</article-title>
          ),
          <source>Minds and Machines</source>
          <volume>29</volume>
          (
          <year>2019</year>
          )
          <fpage>441</fpage>
          -
          <lpage>459</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>F.</given-names>
            <surname>Doshi-Velez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <article-title>Towards a rigorous science of interpretable machine learning</article-title>
          ,
          <source>arXiv preprint arXiv:1702.08608</source>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <article-title>Explanation in artificial intelligence: Insights from the social sciences</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>267</volume>
          (
          <year>2019</year>
          )
          <fpage>1</fpage>
          -
          <lpage>38</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>G.</given-names>
            <surname>Vilone</surname>
          </string-name>
          , L. Longo,
          <article-title>Notions of explainability and evaluation approaches for explainable artificial intelligence</article-title>
          ,
          <source>Information Fusion</source>
          <volume>76</volume>
          (
          <year>2021</year>
          )
          <fpage>89</fpage>
          -
          <lpage>106</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>K.</given-names>
            <surname>Sokol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Flach</surname>
          </string-name>
          ,
          <article-title>Explainability fact sheets: A framework for systematic assessment of explainable approaches</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency</source>
          , FAT* '20,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2020</year>
          , p.
          <fpage>56</fpage>
          -
          <lpage>67</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ancona</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Ceolini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Öztireli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gross</surname>
          </string-name>
          ,
          <article-title>Towards better understanding of gradientbased attribution methods for deep neural networks</article-title>
          ,
          <source>in: International Conference on Learning Representations</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>C.-K. Yeh</surname>
            ,
            <given-names>C.-Y.</given-names>
          </string-name>
          <string-name>
            <surname>Hsieh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Suggala</surname>
            ,
            <given-names>D. I.</given-names>
          </string-name>
          <string-name>
            <surname>Inouye</surname>
            ,
            <given-names>P. K.</given-names>
          </string-name>
          <string-name>
            <surname>Ravikumar</surname>
          </string-name>
          ,
          <article-title>On the (in)fidelity and sensitivity of explanations</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          , volume
          <volume>32</volume>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>