<!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>V. Krug);</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Bias in Activations of Deep Neural Networks as Topographic Maps</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Valerie Krug</string-name>
          <email>valerie.krug@ovgu.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christopher Olson</string-name>
          <email>christopher.olson@ovgu.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sebastian Stober</string-name>
          <email>stober@ovgu.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Artificial Intelligence Lab, Otto-von-Guericke-University Magdeburg</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>1840</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Deep Neural Networks (DNNs) are successful but work as black-boxes. Elucidating their inner workings is crucial as DNNs are prone to reproducing data biases and potentially harm underrepresented or historically discriminated demographic groups. In this work, we demonstrate an approach for visualizing DNN activations that facilitates to visually detect biases in learned representations. This approach displays activations as topographic maps, similar to common visualization of brain activity. In addition to visual inspection of activations, we evaluate diferent measures to quantify the quality of the topographic maps. With visualization and measurement of quality, we provide qualitative and quantitative means for investigating bias in representations and demonstrate this for activations of a pre-trained image recognition model when processing images of peoples' faces. We find biases for diferent sensitive variables, particularly in deeper layers of the investigated DNN, and support the subjective evaluation with a quantitative measure of visual quality.</p>
      </abstract>
      <kwd-group>
        <kwd>explainable AI</kwd>
        <kwd>deep neural networks</kwd>
        <kwd>topographic activation maps</kwd>
        <kwd>representation analysis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Deep Neural Networks (DNNs) are highly successful but it is dificult to interpret how they
perform their learned task [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. This is particularly dangerous in critical applications where
biases in the decision making can negatively afect certain groups of people, often those who
are underrepresented and discriminated against already. To detect undesired behavior of DNNs,
model introspection aims to better understand their inner processes. In this work, we investigate
biases in representations of DNNs. In particular, we visualize activations as topographic maps,
similar to how brain activity is commonly presented [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. We explain the visualization approach
and evaluate diferent measures of visual quality of the topographic maps. Then, we use our
technique to investigate representational bias in a pre-trained image recognition model.
Introspection
      </p>
      <p>
        Feature visualization explains learned patterns by creating inputs that
maximally activate particular filters [
        <xref ref-type="bibr" rid="ref1 ref3 ref4">1, 3, 4</xref>
        ]. Attribution techniques explain the output of a DNN
for input examples by quantifying the relevance of each input value for the output [
        <xref ref-type="bibr" rid="ref5 ref6 ref7 ref8">5, 6, 7, 8</xref>
        ].
Data representation analysis investigates activations of a large amount of data [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref9">9, 10, 11, 12, 13</xref>
        ],
some provide a graphical user interface [
        <xref ref-type="bibr" rid="ref14 ref15 ref16 ref17">14, 15, 16, 17</xref>
        ] and some investigate training processes
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Our approach also analyzes and visualizes representations but focuses more on the ease of
visual inspection and less on highly detailed information about activation similarity of neurons.
Bias Detection and Mitigation DNNs are prone to reproducing or emphasizing biases of
data they are trained on. Diferent approaches to detect and mitigate bias have been introduced.
For example, researchers showed racial discrimination in the online ad delivery by Google [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ],
debiased word embeddings [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] or evaluated discrimination in facial recognition [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. More
recently, researchers investigated biases in transformer-based models [
        <xref ref-type="bibr" rid="ref22 ref23 ref24">22, 23, 24</xref>
        ]. Balanced
evaluation data sets like Gender Shades [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] or Fair Face [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] facilitate bias analyses. In this
work, we visualize bias in representations of a DNN, diferent to investigating its output [
        <xref ref-type="bibr" rid="ref21 ref25">21, 25</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Method</title>
      <p>
        In this section, we introduce our approach of visualizing DNN activity as topographic maps.
An implementation is available at https://github.com/valeriekrug/ANN-topomaps.
Group-Specific Activations We use an averaging approach to characterize DNN activity
for groups of examples [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. For each group, we average the activations in the layer of interest
and subtract the average over all groups. We obtain positive and negative values that represent
higher and lower activity in comparison to the other groups. Finally, we stack them for all
groups as a  ×  matrix, where  and  denote the number of groups and neurons, which we
refer to as the Neuron Activation Profile ( NAP). Notably, any grouping can be used, independent
of the predicted model classes.
      </p>
      <p>
        Topographic Activation Map Inspired by how brain activity is displayed as topographic
maps, we map DNN neurons to allow for a similar activation visualization [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. First, we
distribute neurons in a 2D space such that neurons of similar activity are close to each other
with a UMAP projection. Then, we evenly distribute the neurons in the 2D space by treating
them as particles that attract each other to close gaps and repel others to avoid two particles at
the same position. For the set of particles  , we compute a force for each particle  ∈ 
 (, ) = 1.5 ⋅
((, ) + 1
 () =
∑∈⧵
)−3
( (, ) −  (, )
| ⧵ |
      </p>
      <p>)
 (, ) = 15 ⋅ 
−((,)/2)
(1)
where  = Euclidean distance of particle coordinates and apply it for 1000 iterations.</p>
      <p>Finally, we visualize the NAP in the computed layout, mapping the values to a 0-symmetric
continuous color scale from blue over white to red. This way, equal colors represent the
same value in each group. Then, we linearly interpolate the colors. In Convolutional Neural
Networks (CNNs), we compute the layout such that each feature map is assigned a position in a
2D space and that similar feature maps are close to each other. To assign each position a color
for a group, we use the respective feature map’s mean NAP value.</p>
      <p>Quality Measures We investigate approaches to measure the visual quality of topographic
activation maps in terms of ease of visual interpretability. We consider the quality as high if
there are few distinguishable regions which jointly cover a large area. This does not imply
quality of the activations themselves but only the visual quality. Figure 1 shows relevant steps
of computing the diferent measures.</p>
      <p>To test whether each position in a topographic map is similar to its neighborhood, we measure
robustness against image perturbations. We perturb either by a Gaussian blur or by downscaling
and then upscaling to the original size (with bicubic interpolation). Then, we compute the Mean
Squared Error (MSE) between the perturbed and the original image. We use Gaussian blur with
radii 2 px to 20 px in steps of 2 px and investigate downscaling sizes to 55 × 55 px to 10 × 10 px
in steps of 5 px (see Figure 1A). Finally, we aggregate the MSEs for the diferent parameters
with an estimated area under the curve (AUC) value (trapezoidal rule). We call the measures
“blur MSE AUC” and “resize MSE AUC”.</p>
      <p>We further quantify topographic map quality based on connected components (compare
Figure 1B). First, we separate the image into the red and blue channel. For both channels, we
apply a binary threshold at pixel value of 240 to separate regions from the background. Note that
small values in the red channel indicate a blue region and vice versa. In the binarized images,
we detect connected components using OpenCV1. We compute the number of components
larger than 10 px area (“count”) and the average component size relative to the circle area.</p>
      <p>
        Generally, few large components are considered as high quality. However, this does not
account for whether the components are large but interwoven with others. Therefore, we
further compute the convexity of each connected component as ℎ/ , where ℎ is the length of
the convex hull and  the perimeter of the connected component (Figure 1B on the right depicts
perimeter and hull). Finally, we aggregate convexity values of the components and reward
larger components. To this end, we compute the fraction of total circle area occupied by each
component and use these as weights for a weighted sum of convexity values. This results in a
value in the range of [
        <xref ref-type="bibr" rid="ref1">0, 1</xref>
        ]. We will refer to this quality measure as “size-weighted convexity”.
1https://github.com/opencv/opencv-python
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Evaluating Quality Measures</title>
      <sec id="sec-3-1">
        <title>3.1. Experimental Design</title>
        <p>
          For evaluation of the measures, we use a simple model and data set. As data, we use MNIST [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ].
MNIST contains grayscale images of handwritten digits from 0 to 9, which are of size 28 × 28 px,
centered and normalized in scale. There are 60, 000 training and 10, 000 test data examples. We
train a Multi-Layer Perceptron (MLP) with one fully-connected hidden layer of 128 neurons
and ReLU [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] activation. During training, we use dropout with a dropout rate of 0.5. We use
TensorFlow [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ], with batch size of 32 for 1 epoch, Adam optimizer [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ] with default parameters
and categorical cross-entropy. Our evaluation uses the MNIST test data set and activations from
the hidden layer. Based on a set of manually created topographic activation maps, we choose a
quality measure that best describes the visual quality under diferent conditions. We then use
this measure for the representation bias experiment in Section 4.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Results</title>
        <p>We manually created the topographic activation maps shown in Figure 2 as representative
cases to see which quality measure aligns best with our expectations. Maps A and B represent
ideal topographic activation maps for which we expect the highest quality. C represents a poor
activation map that is dificult to visually interpret, so its quality should be low. D has few
large components, however, they are interwoven with each other and should have lower visual
quality. E1 and E2 are more realistic and visually qualitative examples which difer in that the
blue region is split by a small gap. Both should obtain good visual quality and the gap should
not afect the value too strongly. F 1 and F2 are examples to test whether nested components are
separated correctly. For our last example G, which represents sparse regions, we expect a low
quality that should be higher than that of C as it contains more information.</p>
        <p>Comparing the measures, size-weighted convexity is most consistent with our expectations
as it gives the highest quality to A and B and the lowest to C and G. Only the low convexity
of D in comparison to E1,2 or F1,2 does not reflect well. Therefore, we will continue using the
size-weighted convexity quality measure in the following. Note that average relative component
size and size-weighted convexity are not 1 or 0.5 for the ideal examples A and B due to the pixel
grid and approximations when obtaining connected components.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Bias Analysis</title>
      <sec id="sec-4-1">
        <title>4.1. Experimental Design</title>
        <p>
          We perform the bias experiments for representations of VGG16 [32], a pre-trained CNN model
that can be used as feature extractor for downstream applications like image recognition DNNs.
As test data, we use FairFace [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ], a balanced data set of images of people from diferent age
groups, races and binary genders. Moreover, to investigate the significance, we compare to
groups of randomly drawn examples. We obtain VGG16 from TensorFlow Keras applications2
module and use the second and fith maxpooling layer (layers 6 and 18) as an example.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Results</title>
        <p>Topographic maps for sensitive variables in layers 6 and 18 of VGG16 are shown in Figure 3.
Appendix Figure 4 shows results for several more layers of in VGG16.</p>
        <p>“race”: In layer 6, each category has a specific activation pattern. However, in layer 18, class
activations become more similar between particular groups. Specifically, Black and Indian
categories are highly similar, as well as East Asian, Southeast Asian and Latino Hispanic. The
observations indicate that there is a racial bias in deeper layers. Surprisingly, the Middle Eastern
and White categories do not show clear activation patterns, potentially because the model
learns more individual representations for these categories.
2https://github.com/keras-team/keras</p>
        <p>“gender”: Topographic activation maps of Female and Male category almost are the inverse
of each other, which is expected for a binary grouping. Clearly, in layer 18, the Female and
Male groups show stronger over-/under-activation than the random groups, indicating that the
representation in deeper layers distinguishes between these categories.</p>
        <p>“age”: Groups of similar age are similarly activated, which is reasonable considering the
categories’ fuzzy boundaries. In layer 6, we observe clusters of high similarity: age groups 0-2,
10-49 and &gt;50. Layer 18 shows more continuous changes and strongest activation deviation from
the mean in the lowest and highest age groups. There seems to be no systematic disadvantage
for any individual group but the groups would be distinguishable in a downstream application.
Significance To evaluate the significance of the results, we contrast sensitive variables and
random groups regarding color intensity of topographic maps and visual diference of groups.</p>
        <p>We observe stronger color intensity for sensitive variables than random groups. Further,
activation diferences are more pronounced between the sensitive variables than between the
random groups. Both indicate that the observed similarities and patters are not only a random
efect but really related to the sensitive variables.</p>
        <p>We notice that visual quality is generally lower in layer 18. This might be related to the
higher number of feature maps in layer 18 (512) compared to layer 6 (128). Visualizing more
feature maps means that each influences a smaller part of the map. Therefore, the regions are
likely to become less convex. We further observe that there is a large white region common to
all groups, which decreases the visual quality. It represents feature maps that are inactive or
unspecific to the groups but potentially sensitive to features that are not present in face images.</p>
        <p>In general, the quality of visualizations for sensitive variables is higher than for the
corresponding random groups which supports the significance of the results.</p>
        <p>Diversity of Groups We appreciate the eforts of the FairFace data set to provide balanced
evaluation data. However, the sensitive variables still have potential to be further diversified.
For example, “gender” is only considered as a binary or age group “&gt;70” includes a larger range
of ages than other groups. We still consider the data suitable to demonstrate our technique but
encourage the community to conduct studies with more diverse data sets upon availability.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>Topographic activation maps are a promising tool to visually inspect bias in representation of
DNNs and our visual quality measure supports the otherwise only subjective evaluation.</p>
      <p>Our approach does not provide an explanation of the patterns responsible for the bias, neither
do we mitigate biases. We consider our method to be a visual overview to spot likely biases to
look for. Moreover, we expect that topographic activations maps are useful for people without
expert knowledge in Machine Learning to get a simplified insight into DNN internals.</p>
      <p>In this work, we only considered the sensitive variables independently. As this does not
consider intersectionality, we will investigate combinations of sensitive variables in future work.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This research has been funded by the Federal Ministry of Education and Research of Germany
(BMBF) as part of the project “CogXAI – Cognitive neuroscience inspired techniques for
eXplainable AI”. We also thank Raihan Kabir Ratul for implementing FairFace dataset pre-processing.
arXiv:1412.6980 (2014).
[32] K. Simonyan, A. Zisserman, Very deep convolutional networks for large-scale image
recognition, arXiv preprint arXiv:1409.1556 (2014).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Yosinski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clune</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Fuchs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lipson</surname>
          </string-name>
          ,
          <article-title>Understanding neural networks through deep visualization</article-title>
          ,
          <source>arXiv preprint arXiv:1506.06579</source>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>K.</given-names>
            <surname>Maurer</surname>
          </string-name>
          , T. Dierks,
          <source>Atlas of Brain Mapping: Topographic Mapping of EEG and Evoked Potentials</source>
          , Springer Science &amp; Business
          <string-name>
            <surname>Media</surname>
          </string-name>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Erhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Courville</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Vincent</surname>
          </string-name>
          ,
          <article-title>Visualizing higher-layer features of a deep network</article-title>
          , University of Montreal 1341 (
          <year>2009</year>
          )
          <article-title>1</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mordvintsev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Olah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tyka</surname>
          </string-name>
          , Inceptionism:
          <article-title>Going deeper into neural networks</article-title>
          ,
          <source>Google Research Blog. Retrieved June</source>
          <volume>20</volume>
          (
          <year>2015</year>
          )
          <article-title>5</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Zeiler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fergus</surname>
          </string-name>
          ,
          <article-title>Visualizing and understanding convolutional networks</article-title>
          ,
          <source>in: European Conference on Computer Vision (ECCV)</source>
          , Springer,
          <year>2014</year>
          , pp.
          <fpage>818</fpage>
          -
          <lpage>833</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Springenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dosovitskiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Brox</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Riedmiller</surname>
          </string-name>
          ,
          <article-title>Striving for simplicity: The all convolutional net</article-title>
          ,
          <source>arXiv preprint arXiv:1412.6806</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.-J.</given-names>
            <surname>Kindermans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. T.</given-names>
            <surname>Schütt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Alber</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-R. Müller</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Erhan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Dähne</surname>
          </string-name>
          ,
          <article-title>Learning how to explain neural networks: Patternnet and patternattribution</article-title>
          ,
          <source>International Conference on Learning Representations (ICLR)</source>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>K.</given-names>
            <surname>Schulz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Sixt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Tombari</surname>
          </string-name>
          , T. Landgraf,
          <article-title>Restricting the flow: Information bottlenecks for attribution</article-title>
          ,
          <source>International Conference on Learning Representations (ICLR)</source>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>G.</given-names>
            <surname>Alain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <article-title>Understanding intermediate layers using linear classifier probes</article-title>
          ,
          <source>International Conference on Learning Representations (ICLR)</source>
          , Workshop Track Proceedings (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>B.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wattenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gilmer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wexler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Viegas</surname>
          </string-name>
          , et al.,
          <article-title>Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)</article-title>
          ,
          <source>in: International Conference on Machine Learning (ICML)</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>2668</fpage>
          -
          <lpage>2677</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Fiacco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Choudhary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rose</surname>
          </string-name>
          ,
          <article-title>Deep neural model inspection and comparison via functional neuron pathways, in: Annual Meeting of the Association for Computational Linguistics (ACL</article-title>
          ),
          <year>2019</year>
          , pp.
          <fpage>5754</fpage>
          -
          <lpage>5764</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Morcos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raghu</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Bengio,</surname>
          </string-name>
          <article-title>Insights on representational similarity in neural networks with canonical correlation</article-title>
          , arXiv preprint arXiv:
          <year>1806</year>
          .
          <volume>05759</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T.</given-names>
            <surname>Nagamine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Seltzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Mesgarani</surname>
          </string-name>
          ,
          <article-title>Exploring how deep neural networks form phonemic categories, Annual Conference of the International Speech Communication Association (Interspeech) (</article-title>
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Carter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Armstrong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Schubert</surname>
          </string-name>
          , I. Johnson, C. Olah, Activation atlas,
          <source>Distill</source>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>F.</given-names>
            <surname>Hohman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Robinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. H. P.</given-names>
            <surname>Chau</surname>
          </string-name>
          , Summit:
          <article-title>Scaling deep learning interpretability by visualizing activation and attribution summarizations</article-title>
          ,
          <source>IEEE transactions on visualization and computer graphics 26</source>
          (
          <year>2019</year>
          )
          <fpage>1096</fpage>
          -
          <lpage>1106</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>H.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <surname>N. Das</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Duggal</surname>
            ,
            <given-names>A. P.</given-names>
          </string-name>
          <string-name>
            <surname>Wright</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Shaikh</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Hohman</surname>
            ,
            <given-names>D. H. P.</given-names>
          </string-name>
          <string-name>
            <surname>Chau</surname>
          </string-name>
          , Neurocartography:
          <article-title>Scalable automatic visual summarization of concepts in deep neural networks</article-title>
          ,
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          <volume>28</volume>
          (
          <year>2021</year>
          )
          <fpage>813</fpage>
          -
          <lpage>823</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wexler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pushkarna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Bolukbasi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wattenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Viégas</surname>
          </string-name>
          , J. Wilson,
          <article-title>The what-if tool: Interactive probing of machine learning models</article-title>
          ,
          <source>IEEE transactions on visualization and computer graphics 26</source>
          (
          <year>2019</year>
          )
          <fpage>56</fpage>
          -
          <lpage>65</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Scheidegger</surname>
          </string-name>
          ,
          <article-title>Visualizing neural networks with the grand tour</article-title>
          ,
          <source>Distill</source>
          <volume>5</volume>
          (
          <year>2020</year>
          )
          <article-title>e25</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>L.</given-names>
            <surname>Sweeney</surname>
          </string-name>
          ,
          <article-title>Discrimination in online ad delivery</article-title>
          ,
          <source>arXiv preprint arXiv:1301.6822</source>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>T.</given-names>
            <surname>Bolukbasi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.-W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Y.</given-names>
            <surname>Zou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Saligrama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. T.</given-names>
            <surname>Kalai</surname>
          </string-name>
          ,
          <article-title>Man is to computer programmer as woman is to homemaker? debiasing word embeddings</article-title>
          , volume
          <volume>29</volume>
          ,
          <year>2016</year>
          , pp.
          <fpage>4349</fpage>
          -
          <lpage>4357</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>J.</given-names>
            <surname>Buolamwini</surname>
          </string-name>
          , T. Gebru,
          <article-title>Gender shades: Intersectional accuracy disparities in commercial gender classification, in: S. A</article-title>
          .
          <string-name>
            <surname>Friedler</surname>
          </string-name>
          , C. Wilson (Eds.),
          <source>Proceedings of the 1st Conference on Fairness, Accountability and Transparency</source>
          , volume
          <volume>81</volume>
          ,
          <string-name>
            <surname>PMLR</surname>
          </string-name>
          ,
          <year>2018</year>
          , pp.
          <fpage>77</fpage>
          -
          <lpage>91</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sainju</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <article-title>Detecting gender bias in transformer-based models: A case study on BERT</article-title>
          ,
          <source>arXiv preprint arXiv:2110.15733</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>J.</given-names>
            <surname>Ahn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Oh</surname>
          </string-name>
          ,
          <article-title>Mitigating language-dependent ethnic bias in BERT</article-title>
          ,
          <source>in: Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>533</fpage>
          -
          <lpage>549</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>K.</given-names>
            <surname>Karkkainen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Joo</surname>
          </string-name>
          , Fairface:
          <article-title>Face attribute dataset for balanced race, gender, and age for bias measurement and mitigation</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>1548</fpage>
          -
          <lpage>1558</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>A.</given-names>
            <surname>Krug</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ebrahimzadeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Alemann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Johannsmeier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Stober</surname>
          </string-name>
          ,
          <article-title>Analyzing and visualizing deep neural networks for speech recognition with saliency-adjusted neuron activation profiles</article-title>
          ,
          <source>MDPI Electronics 10</source>
          (
          <year>2021</year>
          )
          <fpage>1350</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>V.</given-names>
            <surname>Krug</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. K.</given-names>
            <surname>Ratul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Olson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Stober</surname>
          </string-name>
          ,
          <article-title>Visualizing deep neural networks with topographic activation maps</article-title>
          ,
          <source>in: HHAI</source>
          <year>2023</year>
          :
          <article-title>Augmenting Human Intellect</article-title>
          , IOS Press,
          <year>2023</year>
          , pp.
          <fpage>138</fpage>
          -
          <lpage>152</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>Y.</given-names>
            <surname>LeCun</surname>
          </string-name>
          , C. Cortes,
          <article-title>MNIST handwritten digit database</article-title>
          , http://yann.lecun.com/exdb/mnist/,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>V.</given-names>
            <surname>Nair</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          ,
          <article-title>Rectified linear units improve restricted boltzmann machines (</article-title>
          <year>2010</year>
          )
          <fpage>807</fpage>
          -
          <lpage>814</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>M.</given-names>
            <surname>Abadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Barham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Brevdo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Citro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. S.</given-names>
            <surname>Corrado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Davis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Devin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ghemawat</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Goodfellow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Harp</surname>
          </string-name>
          , G. Irving,
          <string-name>
            <given-names>M.</given-names>
            <surname>Isard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jozefowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kudlur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Levenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Mané</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Monga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Moore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Murray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Olah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Schuster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Shlens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Steiner</surname>
          </string-name>
          , I. Sutskever,
          <string-name>
            <given-names>K.</given-names>
            <surname>Talwar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Tucker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vanhoucke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vasudevan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Viégas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Vinyals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Warden</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wattenberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wicke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <source>TensorFlow: Large-scale machine learning on heterogeneous systems</source>
          ,
          <year>2015</year>
          . URL: https://www.tensorflow.org/, software available from tensorflow.
          <source>org.</source>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>D. P.</given-names>
            <surname>Kingma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ba</surname>
          </string-name>
          ,
          <article-title>Adam: A method for stochastic optimization</article-title>
          , arXiv preprint
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>