<!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>
      <journal-title-group>
        <journal-title>Advances in Interpretable Machine Learning and Artificial
Intelligence,October</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Want robust explanations? Get smoother predictions first.</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Deddy Jobson</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Mercari Inc.</institution>
          ,
          <addr-line>Roppongi Hills Mori Tower, 6 Chome-10-1 Roppongi, Minato City, Tokyo 106-6118</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>21</volume>
      <issue>2022</issue>
      <fpage>0000</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>Model-agnostic machine learning interpretability methods like LIME which explain the predictions of elaborate machine learning models sufer from a lack of robustness in the explanations they provide. Small targeted changes to the input can result in large changes in explanations even when there are no significant changes in the predictions made by the machine learning model. This is a serious problem as it undermines the trust one has in the explanations made. We propose to solve the problem by smoothening the predictions of the machine learning model as a preprocessing step. We smoothen the predictions by taking multiple samples from the neighbourhood of each input data point and averaging the output predictions. Through our preliminary experiments, we show that the explanations are more robust because of smoothening thus making them more reliable.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;interpretable machine learning</kwd>
        <kwd>model agnostic</kwd>
        <kwd>interpretability</kwd>
        <kwd>LIME</kwd>
        <kwd>robustness</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <sec id="sec-1-1">
        <title>Shapley values[4] take a game-theoretic approach and</title>
        <p>
          assume diferent features take part in a collaboration to
The sudden improvement in performance of machine assign a score for an instance. The shapley value for a
fealearning through deep learning and tree ensemble meth- ture is the average increment in the score obtained by the
ods has led to an explosion in the adoption of machine inclusion of said feature in the collaboration. While using
learning in a wide variety of prediction tasks in multi- shapley values has a strong mathematical foundation, it
ple domains like image, text, tabular data, etc. While has the downside where the computational cost for
calthe increased performance has made machine learning culation is exponential to the number of features. While
models much more useful in practice, it has come at the methods like Tree SHAP[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] exist to more eficiently
calcost of interpretability; one can no longer trivially ex- culate the values, there are issues with the robustness[
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]
plain the decisions made by machine learning models of shapley values which have not yet been resolved.
the same way one could for statistical models like lin- Local Interpretable Model-Agnostic Explanations
ear regression in the past. While we can do without (LIME)[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] is a method that estimates a local surrogate
interpretability in cases where the consequences of the model in the vicinity of each data point and uses the
downstream decisions are little, like in the case of recom- coeficients of the local model to interpret the decisions
mending movies, interpretability becomes important in made by the model. It is related to SHAP through
Kerhigh-stakes situations like predicting whether or not a nel SHAP[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], a way to get approximate SHAP values.
person has cancer[
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. In such a case, it is not just impor- One advantage of LIME over shapley values is that LIME
tant to know what the predictions of the model are, but can produce sparse explanations which don’t rely on too
also how the predictions were made. many features resulting in more human-friendly
explana
        </p>
        <p>
          A number of model-agnostic interpretability methods tions. However, issues regarding the robustness[
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] of the
exist to help explain the predictions made by machine explanations provided by LIME have been raised. Our
learning models. Partial Dependence Plots[
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] show the goal in this paper is to find ways to improve the
robustmarginal efect of a feature on the outcome. Individual ness of the interpretations made by LIME to improve the
Conditional Expectation plots[
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] do the same by making reliability and therefore trustworthiness of the provided
separate plots for each individual thus allowing one to explanations.
see the variance (and not just the mean) of the efect of
each feature. The above two have a problem wherein
we consider the efect of very unlikely counterfactual 2. Problem Setup
scenarios in the case where the features in the dataset
are strongly correlated.
        </p>
      </sec>
      <sec id="sec-1-2">
        <title>The original LIME algorithm works as follows, given a trained model and a target data point:</title>
        <p>1. Sample data around the neighbourhood of the</p>
        <p>data point.
2. Get the predicted values for the sampled data
points.
3. Fit a surrogate model to the generated data</p>
        <p>weighted by distance from the target data point.
4. Explain the prediction of the main model with
the coeficients of the surrogate model.
The explanations generated by the above algorithm can LIME 2.78
be unstable for a number of reasons. LIME smoothed 2.60</p>
        <p>
          One source of instability is the sampling of data
points[
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] that is done randomly, ignoring any
correlation between features. Methods have been developed of robustness in the explanations caused by LIME is not
to estimate the required number of samples to get sta- because of LIME itself but rather the jaggedness of the
ble explanations[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] or do away with randomness in the predictions made by the model.
sampling altogether[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. We smoothen the predictions by averaging the
predic
        </p>
        <p>Another potential cause for instability in explanations, tions made on random perturbations on the data points.
especially pertinent to the case of tabular data, is the We consider the case where all features of the data point
discretization of the numerical features. While for the are numeric and continuous in this study. We perturb
most part this can yield more consistent explanations, each feature by adding it with gaussian noise of zero
target data points near the boundaries can have unstable mean. We refer to the standard deviation of the gaussian
explanations even when the model predictions (which noise to be the "strength" parameter. This is because the
don’t rely on discretization) in the vicinity are relatively greater the "strength" parameter, the larger the
perturstable. bations and the smoother the averaged predictions will
be (assuming enough samples) and so the "stronger" the
3. Related Work smoothening efect. We choose a strength value of 0.1
for our experiments and take 100 random samples for
each data point for the smoothening process.</p>
        <p>The measurement of the stability (or lack thereof)
of LIME’s explanations isn’t a new research problem.</p>
        <p>
          Alvarez-melis et al.[
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] have shown that small pertuba- 5. Experiments and Discussion
tions to the input can cause a large change in the output
without much of a change in the predictions made by the Our hypothesis is that smoothening the predictions will
model. They use the definition of Lipschitz continuity yield explanations that are more robust. To test this
hyto get the maximum possible diference in explanation pothesis, we look at the extent to which the variance of
within the neighbourhood of the data point to be ex- LIME’s explanations change before and after
smoothenplained. Their approach is similar to prior work that ing the predicting function. We define a metric called
Lipwas done to inspect the lack of robustness of predictions schitz Discontinuity Score (LDS) Score which is derived
made by neural networks[
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. from the expression used in the definition of Lipschitz
        </p>
        <p>
          Visani et al.[
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] introduce two novel metrics grounded Continuity. Our approach is similar to the one used in
in statistics to measure the extent to which repeated sam- [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. LDS is defined as follows:
pling of the data leads to a variance in the explanations.
        </p>
        <p>Ttuhreeisramndetcriocesficqieunatnvtaiflyuetsh,ethvearlioawnecre tohfethbeetsteerl.ected fea-  = 1 ∑=︁1 m̸=ax || (||) −− ( ||2 )||2 (1)</p>
        <p>
          Much more recently, Garreau et al.[
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] performed a
very deep analysis into the workings of LIME for tabular In the above expression, N is the number of records in the
data and (among other things) found that when the sur- dataset, i and j are indices to denote individual records
rogate model (the one trained for interpretability) uses and take values from 1 to N, and  () is the vector of
ordinary least squares, and the number of sampled data coeficients we get from the explanations of the LIME
points is large, the estimations by LIME are robust to mild algorithm.
perturbations. This suggests that the cause of instability We perform preliminary experiments on the publicly
could lie elsewhere. available Boston dataset, a dataset with 12 covariates for a
regression problem. We parameterize the LIME algorithm
to explain with only 3 features. The base model used is
4. Our Method the random forest regressor from scikit-learn. We use the
For our method, we smoothen the predictions of the default parameters of the random forest since it sufices
model we want to explain with the help of Gaussian for the purposes of this study. We estimate the LDS
noise. We do so because we hypothesize that the lack on the Boston dataset using 10-fold cross validation. In
table 1, we compare the LDS of the explanations of LIME
for two cases: with and without smoothening. We find
that there is a substantial improvement in the LDS when
smoothening the predictions, in line with our hypothesis.
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>6. Future Work</title>
      <p>
        In this paper, we smoothen the predictions of the machine
learning model by sampling neighbouring points
randomly multiple times and taking the average of the
output. We do this to increase the robustness of the
explanations by LIME. We chose white noise since the approach is
similar to the original LIME algorithm, but since its
introduction, various improved sampling strategies have been
proposed that result in more robust explanations[
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ].
Trying those other sampling methods for the purpose of
smoothening the predictions is beyond the scope of this
extended abstract and can be considered as one avenue
for future research.
      </p>
      <p>While we perform preliminary experiments with
tabular data, our hypothesis can be potentially true for other
forms of data, more so due to the greater dimensionality
of data like image, text, etc. In order to extend the idea
to other forms of data, the key will be to find how best
to perturb the input to get smooth predictions.</p>
      <p>Lastly, we test our hypothesis with LIME and found
promising results. Since the instability of explanations
of other interpretability methods can also be (at least
partly) explained by unstable predictions of the machine
learning model, we suspect our idea can be applied to
improve other model interpretability methods too.</p>
      <p>As we can see, there is a lot of scope for future work
and we are excited to see how research develops in this
direction.</p>
    </sec>
    <sec id="sec-3">
      <title>7. Conclusion</title>
      <p>In this paper, we propose a way to improve the robustness
of LIME, a model-agnostic explainer of the predictions
of machine learning models. We propose smoothening
the predictions made by the model to increase the
consistency of the predictions made by the model, thereby
making the explanations more trustable. We explain how
we smoothen predictions using random noise and
perform some preliminary experiments on publicly-available
datasets to achieve promising results. We also outline
future steps that can be taken to increase the scope of
the research.</p>
    </sec>
    <sec id="sec-4">
      <title>Acknowledgments</title>
      <sec id="sec-4-1">
        <title>We would like to thank Mercari Inc. for supporting the research and also the anonymous reviewers who gave very helpful feedback to improve the quality of the paper.</title>
      </sec>
      <sec id="sec-4-2">
        <title>Any remaining deficiencies left in the paper belong to the authors.</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P.</given-names>
            <surname>Karatza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Dalakleidi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Athanasiou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Nikita</surname>
          </string-name>
          ,
          <article-title>Interpretability methods of machine learning algorithms with applications in breast cancer diagnosis</article-title>
          ,
          <source>in: 2021 43rd Annual International Conference of the IEEE Engineering in Medicine &amp; Biology Society (EMBC)</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>2310</fpage>
          -
          <lpage>2313</lpage>
          . doi:
          <volume>10</volume>
          .1109/ EMBC46164.
          <year>2021</year>
          .
          <volume>9630556</volume>
          , iSSN:
          <fpage>2694</fpage>
          -
          <lpage>0604</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B. M.</given-names>
            <surname>Greenwell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Boehmke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>McCarthy</surname>
          </string-name>
          ,
          <string-name>
            <surname>A Simple</surname>
          </string-name>
          <source>and Efective Model-Based Variable Importance Measure</source>
          ,
          <year>2018</year>
          . URL: http://arxiv.org/abs/
          <year>1805</year>
          .04755. doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>1805</year>
          .
          <volume>04755</volume>
          , arXiv:
          <year>1805</year>
          .04755 [cs, stat].
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Goldstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kapelner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bleich</surname>
          </string-name>
          , E. Pitkin,
          <article-title>Peeking Inside the Black Box: Visualizing Statistical Learning with Plots of Individual Conditional Expectation</article-title>
          ,
          <year>2014</year>
          . URL: http://arxiv. org/abs/1309.6392. doi:
          <volume>10</volume>
          .48550/arXiv.1309. 6392, arXiv:
          <fpage>1309</fpage>
          .6392 [stat].
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Lundberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.-I.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          Unified Approach to Interpreting Model Predictions,
          <year>2017</year>
          . URL: http://arxiv. org/abs/1705.07874. doi:
          <volume>10</volume>
          .48550/arXiv.1705. 07874, arXiv:
          <fpage>1705</fpage>
          .07874 [cs, stat].
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Lundberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. G.</given-names>
            <surname>Erion</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.-I. Lee</surname>
          </string-name>
          ,
          <source>Consistent Individualized Feature Attribution for Tree Ensembles</source>
          ,
          <year>2019</year>
          . URL: http://arxiv.org/abs/
          <year>1802</year>
          .03888. doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>1802</year>
          .
          <volume>03888</volume>
          , arXiv:
          <year>1802</year>
          .03888 [cs, stat].
        </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>
          ,
          <source>On the Robustness of Interpretability Methods</source>
          ,
          <year>2018</year>
          . URL: http://arxiv. org/abs/
          <year>1806</year>
          .08049. doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>1806</year>
          .
          <volume>08049</volume>
          , arXiv:
          <year>1806</year>
          .08049 [cs, stat].
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Ribeiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Guestrin</surname>
          </string-name>
          ,
          <article-title>"Why Should I Trust You?": Explaining the Predictions of Any Classifier (</article-title>
          <year>2016</year>
          ). URL: https://arxiv.org/abs/1602. 04938v3. doi:
          <volume>10</volume>
          .48550/arXiv.1602.04938.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>I.</given-names>
            <surname>Covert</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.-I. Lee</surname>
          </string-name>
          , Improving KernelSHAP:
          <article-title>Practical Shapley Value Estimation Using Linear Regression</article-title>
          ,
          <source>in: Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</source>
          , PMLR,
          <year>2021</year>
          , pp.
          <fpage>3457</fpage>
          -
          <lpage>3465</lpage>
          . URL: https: //proceedings.mlr.press/v130/covert21a.html, iSSN:
          <fpage>2640</fpage>
          -
          <lpage>3498</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Udell</surname>
          </string-name>
          ,
          <article-title>"Why Should You Trust My Explanation?" Understanding Uncertainty in</article-title>
          LIME Explanations,
          <year>2019</year>
          . URL: http: //arxiv.org/abs/
          <year>1904</year>
          .12991. doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>1904</year>
          .
          <volume>12991</volume>
          , arXiv:
          <year>1904</year>
          .12991 [cs, stat].
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Hooker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>S-LIME</surname>
          </string-name>
          :
          <article-title>StabilizedLIME for Model Explanation</article-title>
          ,
          <source>in: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &amp; Data Mining, KDD '21</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2021</year>
          , pp.
          <fpage>2429</fpage>
          -
          <lpage>2438</lpage>
          . URL: https://doi.org/ 10.1145/3447548.3467274. doi:
          <volume>10</volume>
          .1145/3447548. 3467274.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Zafar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <article-title>Deterministic Local Interpretable Model-Agnostic Explanations for Stable Explainability</article-title>
          ,
          <source>Machine Learning and Knowledge Extraction</source>
          <volume>3</volume>
          (
          <year>2021</year>
          )
          <fpage>525</fpage>
          -
          <lpage>541</lpage>
          . URL: https:// www.mdpi.com/2504-4990/3/3/27. doi:
          <volume>10</volume>
          .3390/ make3030027, number: 3 Publisher: Multidisciplinary Digital Publishing Institute.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>C.</given-names>
            <surname>Szegedy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zaremba</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bruna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Erhan</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Goodfellow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fergus</surname>
          </string-name>
          ,
          <source>Intriguing properties of neural networks</source>
          ,
          <year>2014</year>
          . URL: http: //arxiv.org/abs/1312.6199. doi:
          <volume>10</volume>
          .48550/arXiv. 1312.6199, arXiv:
          <fpage>1312</fpage>
          .6199 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>G.</given-names>
            <surname>Visani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Bagli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Chesani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Poluzzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Capuzzo</surname>
          </string-name>
          ,
          <article-title>Statistical stability indices for LIME: obtaining reliable explanations for Machine Learning models</article-title>
          ,
          <source>Journal of the Operational Research Society</source>
          <volume>73</volume>
          (
          <year>2022</year>
          )
          <fpage>91</fpage>
          -
          <lpage>101</lpage>
          . URL: http://arxiv.org/abs/
          <year>2001</year>
          . 11757. doi:
          <volume>10</volume>
          .1080/01605682.
          <year>2020</year>
          .
          <volume>1865846</volume>
          , arXiv:
          <year>2001</year>
          .11757 [cs, stat].
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>D.</given-names>
            <surname>Garreau</surname>
          </string-name>
          , U. von Luxburg,
          <source>Looking Deeper into Tabular LIME</source>
          ,
          <year>2022</year>
          . URL: http://arxiv.org/abs/
          <year>2008</year>
          . 11092, arXiv:
          <year>2008</year>
          .11092 [cs, stat].
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Saito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Chua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Capel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <source>Improving LIME Robustness with Smarter Locality Sampling</source>
          ,
          <year>2021</year>
          . URL: http://arxiv.org/abs/
          <year>2006</year>
          .12302. doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>2006</year>
          .
          <volume>12302</volume>
          , arXiv:
          <year>2006</year>
          .12302 [cs, stat].
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A Modified</given-names>
            <surname>Perturbed Sampling Method for Local Interpretable Modelagnostic Explanation</surname>
          </string-name>
          ,
          <year>2020</year>
          . URL: http://arxiv. org/abs/
          <year>2002</year>
          .07434. doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>2002</year>
          .
          <volume>07434</volume>
          , arXiv:
          <year>2002</year>
          .07434 [cs, stat].
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>