<!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>Can Generative AI-based Data Balancing Mitigate Unfairness Issues in Machine Learning?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Benoît Ronval</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Siegfried Nijssen</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ludwig Bothmann</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Statistics, LMU Munich</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>ICTEAM</institution>
          ,
          <addr-line>UCLouvain</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Munich Center for Machine Learning</institution>
          ,
          <addr-line>MCML</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Data imbalance in the protected attributes can lead to machine learning models that perform better on the majority than on the minority group, giving rise to unfairness issues. While a baseline method like SMOTE can balance datasets, we investigate how methods of generative artificial intelligence compare concerning classical fairness metrics. Using generated fake data, we propose diferent balancing methods and investigate the behavior of classification models in thorough benchmark studies using German credit and Berkeley admission data. While our experiments suggest that such methods may improve fairness metrics, further investigations are necessary to derive clear practical recommendations.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Fairness</kwd>
        <kwd>Generative AI</kwd>
        <kwd>Imbalanced Data</kwd>
        <kwd>Large Language Models</kwd>
        <kwd>Machine Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        These proposals include baseline methods such as random under/oversampling, and more
sophisticated methods such as SMOTE [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In this work, we investigate how generative artificial
intelligence (genAI) could mitigate unfairness issues related to ML models in ADM systems and
compare these with SMOTE.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. GenAI models</title>
      <p>
        GenAI models learn the distribution of the original data to create fake (or synthetic) observations
from that distribution. The Generative Adversarial Network (GAN) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] for creating images
comprises a generator and a discriminator, which compete against each other during training.
An alternative for tabular data is the Conditional Tabular GAN (CTGAN) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], where tabular
data is represented with a mode-specific normalization that the GAN can use.
      </p>
      <p>
        Large Language Models are important members of genAI models [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. With adequate
processing of the inputs and outputs, using, e.g., a format similar to "[feature] is [feature value]",
LLMs can be fine-tuned to generate tabular data, as demonstrated by the model GReaT [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
Using a relatively old LLM like GPT2 (or distil-GPT2) [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ], it can obtain fake data that are
closer to the original distribution than with other approaches.
      </p>
      <p>
        There exist genAI models that try to produce fair data [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ]. Their focus is to ensure that
fake data are representative of the populations. In particular, TabFairGAN [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] is specialized
for tabular data. We intend to use it in future work. Notice that we use genAI to learn better
classification models from balanced data, we do not improve genAI directly.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Dataset corrections</title>
      <p>We first need to train the genAI models. The CTGAN model has been trained for 200 epochs.
GReaT, using distil-GPT2, has been fine-tuned for 200 epochs with a batch size of 16 and a
learning rate of 0.00005. We trained the genAI models in two diferent setups: (1) using all
original data and (2) using only 80%, leaving the remaining 20% as an unseen test set.</p>
      <p>We consider diferent dataset correction methods that use the generated observations to
balance the number of male and female observations. The baseline method is called real-only
which randomly downsamples the male group. Given  and  , the original number of male
and female observations, this correction reduces  to  , resulting in 2 original observations.
The fake-only datasets are reduced to 2 observations, with equal representation of male and
female and using only fake data. The mixture-full and mixture corrections are intermediate
approaches. We add  −  fake female observations to the original dataset, reaching 2
observations. The mixture approach downsamples this augmented dataset to 2 observations.</p>
      <p>
        To compare the generative models (GReaT, CTGAN, SMOTE), corrections are done with each
model excepted: (1) real-only correction is done once as it is independent of the generative
models; (2) the combination fake-only and SMOTE is not possible as it creates data only for the
minority group. In the end, we have 9 corrected versions for a given dataset: 3 with CTGAN, 3
with GReaT, 2 with SMOTE, and 1 real-only. We checked the fake data followed the distribution
of the original with a visual comparison (not shown due to page limit). We use the German
credit dataset [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and Berkeley admission [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] and plan to add other datasets in future work.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments</title>
      <p>We use the above-generated 9 datasets to carry out thorough experiments to compare 3
different learners: logistic regression, classification trees, and random forests (RF). We tune their
hyperparameters with 100 iterations of a random search using 3-fold cross-validation (CV).</p>
      <p>
        We evaluate model performance with accuracy (ACC) and area under the curve (AUC). For
a description of performance diferences in the subgroups of the PA Gender, we use three
confusion matrix-based metrics. (There has been some criticism of using these “classical fairness
metrics” due to a lack of philosophical justification [see 20] – we therefore use these rather as
descriptive tools than for proving or disproving fairness.) For assessing demographic parity,
we compute the diference of the ratios of positive predictions for males and females (DP [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]).
For assessing equalized odds, we compute the mean of the absolute values of (i) the diference
between the true positive rates for males and females and (ii) the diference of the true negative
rates for males and females (EO [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]). Similarly, we condition on the predicted classes and
compute the mean of the absolute diferences between males and females regarding positive
and negative predictive values, aiming at conditional use accuracy equality (CUAE [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]).
      </p>
      <p>
        The experiments have two settings: (1) A resampling study carries out – on each corrected
dataset – nested resampling with 3-fold CV as inner resampling and 100 iterations of subsampling
with a train-test ratio of 80/20 as outer resampling. The goal is to analyze the behavior of the
tuned learners on unseen test data from the same distribution, including estimates of the
standard deviation for statistical significance. (2) Since a generation method that generates data
that are far from the original data distribution but rather simple to classify would also obtain
good results in the resampling, we additionally test all methods on the same 20% test sample
of the original data. In this setting, the genAI models are trained on the remaining 80% of the
original data, and the learners are tuned with 3-fold CV on the resulting datasets (which are
hence smaller as in the benchmark study). We use the R packages mlr3 [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] for performing
experiments and mlr3fairness [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] for computing fairness metrics. Results are presented in
Table 1 and Table 2, respectively.
      </p>
      <p>
        Resampling For space constraints, we selected some of the 27 combinations of learner and
correction methods: Since RF performed consistently best regarding mean ACC, we limited the
presentation of the results to RF. For the generation methods, we excluded the mixture method
since the results are between fake-only and mixture-full (mf). For the German credit data,
the generation methods outperform the results obtained by real-only (see Table 1), however,
most diferences are not statistically significant. Between the generation methods, a clear
winner cannot be distinguished, since SMOTE leads to better predictive performances, whereas
CTGAN and GReaT have better values in the fairness metrics. In-line with prior findings [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ],
fake-only versions are outperformed by mixture-full versions. As one example, we included
GReaT-fake, which later (see Table 2) sufers from a drastic drop in performance when evaluated
on original data (same holds for CTGAN-fake). For the Berkeley data (fake-versions omitted for
space constraints), the generation methods also perform better, but again, diferences are not
statistically significant. Notably, SMOTE performs rather bad in the fairness metrics. In total, it
appears that balancing the number of males and females in the datasets tends to improve the
fairness metrics of the models learned on these data.
Evaluation on real test data Table 2 summarizes the results on the 20% test sample of the
original data for the same combinations. Again, the generation methods have better values in
all metrics, where a clear winner cannot be distinguished. Consistently, SMOTE leads to a
wellperforming model and is competitive in the fairness metrics. As mentioned above, GReaT-fake
sufers from a drop in predictive performance. For Berkeley, the results of the diferent methods
are comparable to those of the resampling (omitted in Table 2).
      </p>
    </sec>
    <sec id="sec-5">
      <title>5. Discussion and Conclusion</title>
      <p>
        The presented results indicate that generative methods can help to improve fairness metrics
when facing data imbalance in the PA, where fake-only corrections do not seem to generalize
well. There is, however, no clear sign that more complex, resource-intensive genAI methods like
CTGAN and GReaT outperform more basic methods such as SMOTE, even if the distribution
of the fake data is closer to the original data than the one observed with SMOTE. Further
experiments are necessary to investigate this: beyond experiments on other real-world datasets,
we plan to do thorough simulation studies with difering degrees of imbalance and complexity
of the DGP. Other generative models such as TabFairGAN [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], specialized in the generation of
fair tabular data, will also be studied in this context.
      </p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>Computational resources have been provided by the Consortium des Équipements de Calcul
Intensif (CÉCI), funded by the Fonds de la Recherche Scientifique de Belgique (F.R.S.-FNRS)
under Grant No. 2.5020.11 and by the Walloon Region</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>N.</given-names>
            <surname>Mehrabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Morstatter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Saxena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Galstyan</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          <article-title>Survey on Bias and Fairness in Machine Learning</article-title>
          ,
          <source>ACM Computing Surveys</source>
          <volume>54</volume>
          (
          <year>2021</year>
          )
          <fpage>1</fpage>
          -
          <lpage>35</lpage>
          . doi:
          <volume>10</volume>
          .1145/3457607.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Danks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>London</surname>
          </string-name>
          , Algorithmic Bias in Autonomous Systems,
          <source>in: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence</source>
          ,
          <source>International Joint Conferences on Artificial Intelligence Organization</source>
          , Melbourne, Australia,
          <year>2017</year>
          , pp.
          <fpage>4691</fpage>
          -
          <lpage>4697</lpage>
          . doi:
          <volume>10</volume>
          .24963/ijcai.
          <year>2017</year>
          /654.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Iosifidis</surname>
          </string-name>
          , E. Ntoutsi,
          <string-name>
            <surname>Multi-fairness Under</surname>
          </string-name>
          Class-Imbalance, in: P.
          <string-name>
            <surname>Pascal</surname>
          </string-name>
          , D. Ienco (Eds.),
          <source>Discovery Science, Lecture Notes in Computer Science</source>
          , Springer Nature Switzerland, Cham,
          <year>2022</year>
          , pp.
          <fpage>286</fpage>
          -
          <lpage>301</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -18840-4_
          <fpage>21</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>V.</given-names>
            <surname>Iosifidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Fetahu</surname>
          </string-name>
          , E. Ntoutsi, FAE:
          <string-name>
            <given-names>A</given-names>
            <surname>Fairness-Aware Ensemble</surname>
          </string-name>
          Framework, in: 2019
          <source>IEEE International Conference on Big Data (Big Data)</source>
          , IEEE, Los Angeles, CA, USA,
          <year>2019</year>
          , pp.
          <fpage>1375</fpage>
          -
          <lpage>1380</lpage>
          . doi:
          <volume>10</volume>
          .1109/BigData47090.
          <year>2019</year>
          .
          <volume>9006487</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Vuttipittayamongkol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Elyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Petrovski</surname>
          </string-name>
          ,
          <article-title>On the class overlap problem in imbalanced data classification, Knowledge-Based Systems 212 (</article-title>
          <year>2021</year>
          )
          <article-title>106631</article-title>
          . doi:
          <volume>10</volume>
          .1016/j.knosys.
          <year>2020</year>
          .
          <volume>106631</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>V.</given-names>
            <surname>López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fernández</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>García</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Palade</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Herrera</surname>
          </string-name>
          ,
          <article-title>An insight into classification with imbalanced data: Empirical results and current trends on using data intrinsic characteristics</article-title>
          ,
          <source>Information Sciences 250</source>
          (
          <year>2013</year>
          )
          <fpage>113</fpage>
          -
          <lpage>141</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.ins.
          <year>2013</year>
          .
          <volume>07</volume>
          .007.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Japkowicz</surname>
          </string-name>
          ,
          <article-title>The class imbalance problem: Significance and strategies</article-title>
          ,
          <source>in: Proceedings of the International Conference on Artificial Intelligence</source>
          , volume
          <volume>56</volume>
          ,
          <year>2000</year>
          , pp.
          <fpage>111</fpage>
          -
          <lpage>117</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N. V.</given-names>
            <surname>Chawla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. W.</given-names>
            <surname>Bowyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. O.</given-names>
            <surname>Hall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. P.</given-names>
            <surname>Kegelmeyer</surname>
          </string-name>
          , SMOTE: Synthetic Minority
          <string-name>
            <surname>Over-sampling</surname>
            <given-names>Technique</given-names>
          </string-name>
          ,
          <source>Journal of Artificial Intelligence Research</source>
          <volume>16</volume>
          (
          <year>2002</year>
          )
          <fpage>321</fpage>
          -
          <lpage>357</lpage>
          . doi:
          <volume>10</volume>
          .1613/jair.953.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>I.</given-names>
            <surname>Goodfellow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pouget-Abadie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mirza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Warde-Farley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ozair</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Courville</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <article-title>Generative adversarial networks</article-title>
          ,
          <source>Communications of the ACM</source>
          <volume>63</volume>
          (
          <year>2020</year>
          )
          <fpage>139</fpage>
          -
          <lpage>144</lpage>
          . doi:
          <volume>10</volume>
          .1145/3422622.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>L.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Skoularidou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cuesta-Infante</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Veeramachaneni</surname>
          </string-name>
          ,
          <article-title>Modeling Tabular data using Conditional GAN</article-title>
          , in: H.
          <string-name>
            <surname>Wallach</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Larochelle</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Beygelzimer</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>d.</surname>
            Alché-Buc,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Fox</surname>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>32</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2019</year>
          . URL: https://proceedings.neurips.cc/paper_files/paper/2019/ ifle/254ed7d2de3b23ab10936522dd547b78-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>W. X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Min</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          , P. Liu,
          <string-name>
            <given-names>J.-Y.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-R.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <source>A Survey of Large Language Models</source>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2303.18223.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>V.</given-names>
            <surname>Borisov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Seßler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Leemann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pawelczyk</surname>
          </string-name>
          , G. Kasneci,
          <source>Language Models are Realistic Tabular Data Generators</source>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2210.06280.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Luan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          ,
          <article-title>Language models are unsupervised multitask learners</article-title>
          ,
          <source>OpenAI blog 1</source>
          (
          <year>2019</year>
          )
          <article-title>9</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          , T. Wolf,
          <article-title>DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter</article-title>
          ,
          <source>in: NeurIPS EMC2 Workshop</source>
          ,
          <year>2019</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.
          <year>1910</year>
          .
          <volume>01108</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>D.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , X. Wu,
          <article-title>FairGAN: Fairness-aware Generative Adversarial Networks</article-title>
          ,
          <source>in: 2018 IEEE International Conference on Big Data (Big Data)</source>
          , IEEE, Seattle, WA, USA,
          <year>2018</year>
          , pp.
          <fpage>570</fpage>
          -
          <lpage>575</lpage>
          . doi:
          <volume>10</volume>
          .1109/BigData.
          <year>2018</year>
          .
          <volume>8622525</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>F.</given-names>
            <surname>Friedrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Struppek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hintersdorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Schramowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Luccioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kersting</surname>
          </string-name>
          , Fair Difusion: Instructing Text-to-
          <source>Image Generation Models on Fairness</source>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          . 48550/arXiv.2302.10893.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>A.</given-names>
            <surname>Rajabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. O.</given-names>
            <surname>Garibay</surname>
          </string-name>
          ,
          <article-title>TabFairGAN: Fair Tabular Data Generation with Generative Adversarial Networks</article-title>
          ,
          <source>Machine Learning and Knowledge Extraction</source>
          <volume>4</volume>
          (
          <year>2022</year>
          )
          <fpage>488</fpage>
          -
          <lpage>501</lpage>
          . doi:
          <volume>10</volume>
          .3390/make4020022.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hofmann</surname>
          </string-name>
          ,
          <source>Statlog (German Credit Data)</source>
          ,
          <year>1994</year>
          . doi:
          <volume>10</volume>
          .24432/C5NC77.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Bickel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Hammel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W. O</given-names>
            <surname>'Connell</surname>
          </string-name>
          , Sex Bias in Graduate Admissions:
          <article-title>Data from Berkeley: Measuring bias is harder than is usually assumed, and the evidence is sometimes contrary to expectation</article-title>
          .,
          <source>Science</source>
          <volume>187</volume>
          (
          <year>1975</year>
          )
          <fpage>398</fpage>
          -
          <lpage>404</lpage>
          . doi:
          <volume>10</volume>
          .1126/science.187.4175. 398.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>L.</given-names>
            <surname>Bothmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Peters</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bischl</surname>
          </string-name>
          , What Is Fairness?
          <article-title>On the Role of Protected Attributes and Fictitious Worlds</article-title>
          , arXiv,
          <year>2024</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2205.09622.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>C.</given-names>
            <surname>Dwork</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Pitassi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Reingold</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zemel</surname>
          </string-name>
          ,
          <article-title>Fairness through awareness</article-title>
          ,
          <source>in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference</source>
          , Association for Computing Machinery, New York, NY, USA,
          <year>2012</year>
          , pp.
          <fpage>214</fpage>
          -
          <lpage>226</lpage>
          . doi:
          <volume>10</volume>
          . 1145/2090236.2090255.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Price</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Srebro</surname>
          </string-name>
          ,
          <article-title>Equality of Opportunity in Supervised Learning</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          , volume
          <volume>29</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2016</year>
          . URL: https://papers.nips.cc/paper/2016/hash/9d2682367c3935defcb1f9e247a97c0d-Abstract. html.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>R.</given-names>
            <surname>Berk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Heidari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jabbari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kearns</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roth</surname>
          </string-name>
          ,
          <article-title>Fairness in Criminal Justice Risk Assessments: The State of the Art</article-title>
          ,
          <source>Sociological Methods &amp; Research</source>
          <volume>50</volume>
          (
          <year>2021</year>
          )
          <fpage>3</fpage>
          -
          <lpage>44</lpage>
          . doi:
          <volume>10</volume>
          .1177/0049124118782533, publisher: SAGE Publications Inc.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Binder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Richter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Schratz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Pfisterer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Coors</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Au</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Casalicchio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kotthof</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. Bischl,</surname>
          </string-name>
          <article-title>mlr3: A modern object-oriented machine learning framework</article-title>
          <source>in R, Journal of Open Source Software</source>
          (
          <year>2019</year>
          ). doi:
          <volume>10</volume>
          .21105/joss.
          <year>01903</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pfisterer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Siyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lang</surname>
          </string-name>
          ,
          <source>mlr3fairness: Fairness Auditing and Debiasing for 'mlr3'</source>
          ,
          <year>2024</year>
          . URL: https://mlr3fairness.mlr-org.com.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>D.</given-names>
            <surname>Manousakas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Aydöre</surname>
          </string-name>
          ,
          <source>On the Usefulness of Synthetic Tabular Data Generation</source>
          ,
          <year>2023</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2306.15636.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>