<!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>The NPU-ASLP System for Deepfake Algorithm Recognition in ADD 2023 Challenge</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ziqian Wang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Qing Wang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jixun Yao</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lei Xie</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Audio, Speech and Language Processing Group</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <fpage>64</fpage>
      <lpage>69</lpage>
      <abstract>
        <p>This paper describes our NPU-ASLP system for the Deepfake Algorithm Recognition (AR) task in the Audio Deepfake Detection 2023 Challenge. This task is an open-set classification problem focusing on identifying the specific algorithms used to create the deepfake speech utterances. In this task, we introduce a deepfake AR system with contributions in data augmentation, model architecture, fine-tuning strategy, and model ensemble. We first generate training data by applying various data augmentation techniques to the deepfake speech. We then utilize ResNet101 and a long-term temporal-frequency transformer module to better capture audio context dependencies. Moreover, we employ pre-trained WavLM for better feature extraction. Additionally, our content-invariant fine-tuning strategy improves performance. Finally, model ensemble with diferent representation combinations further enhances performance. Experiments show that our system achieves an F1-score of 0.7355 on the evaluation set, and ranks fourth in the challenge.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Deepfake algorithm recognition</kwd>
        <kwd>data augmentation</kwd>
        <kwd>transformer</kwd>
        <kwd>model ensemble</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        tifying the specific algorithms used to create deepfake
speech utterances. With the rapid advancements in deep
In recent years, the progress of deep learning has resulted learning as speech synthesis and voice conversion,
deepin significant advancements in speech synthesis [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and fake audio [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ] has become an increasingly significant
voice conversion [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] technologies. These technologies concern. It has the potential to be misused for various
are capable of producing speech that is highly realistic malicious purposes, such as spreading false information,
and bears a strong resemblance to natural human speech. creating non-consensual audio, and impersonating
inHowever, if misused, these technologies have the po- dividuals. Furthermore, this task is complicated by the
tential to cause harm to society. Therefore, detecting fact that deepfake algorithms can be trained on a wide
deepfake audio, which is manipulated audio created by variety of data sources, such as real speech samples,
syndeep learning algorithms, has become an urgent task to thesized speech, or a combination of both. Additionally,
prevent any potential misuse. deepfake audio can be generated using a variety of
meth
      </p>
      <p>
        The objective of the second edition of the Audio Deep- ods, leveraging the recent advancements in deep learning
fake Detection Challenge (ADD 2023) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is to inspire re- based audio generation [
        <xref ref-type="bibr" rid="ref10 ref11 ref12">10, 11, 12</xref>
        ]. These complexities
searchers to develop innovative and pioneering technolo- make the development of efective deepfake detection
gies that can boost and encourage further exploration algorithms a challenging problem.
in identifying and analyzing deepfake speech utterances. This report describes our system for the deepfake AR
Unlike earlier challenges (such as the previous edition of task. We shape this task as an open set classification
ADD challenge [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], and the ASVspoof challenge [
        <xref ref-type="bibr" rid="ref5 ref6 ref7">5, 6, 7</xref>
        ]), problem [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], due to the evaluation set containing an
unADD 2023 aims to transcend the limitations of binary known counterfeit. Specifically, we introduce a
thresholdreal/fake classification and instead focus on identifying based classification and detection system with
contributhe exact regions that are manipulated in a partially fake tions in four primary areas, including augmenting the
speech, as well as identifying the source responsible for available data, enhancing the model architecture,
adoptgenerating any fake audio. Additionally, ADD 2023 com- ing a content-invariant finetuning strategy, and utilizing
prises multiple evaluation rounds for the fake audio game model ensemble techniques. First, data augmentation
sub-challenge. approaches are investigated to expand the oficial dataset.
      </p>
      <p>
        The Deepfake Algorithm Recognition (AR) task in We adopt the noise and room impulse response clips
ADD 2023 is an essential challenge that focuses on iden- and simulate training data by adding distortions to the
deepfake speech utterances. We further apply random
sampling, time stretching, time and frequency masking to
the mixed audio to better reveal the artifacts in the
deepfake speech utterances. As for the model architecture,
on the augmented data, which better captures long-term
temporal-frequency dependencies and further aggregates
global hierarchical contextual information. Moreover,
we leverage the pre-trained audio-LLM WavLM [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] to
facilitate versatile latent representations. Additionally,
we explore feature concatenation and multi-channel
representation fusion as feature combination techniques.
      </p>
      <p>Finally, we utilize model ensemble to imporove the
robustness and generalization ability of our system.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Deepfake AR System</title>
      <sec id="sec-2-1">
        <title>2.1. System Overview</title>
        <p>
          Our system comprises three main modules designed to
improve the performance of deepfake audio detection.
We select ResNet101 [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] as the backbone network due
to its exceptional capabilities in various classification
tasks. To better capture contextual dependencies, we
introduce a transformer [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] based Temporal-frequency
modeling module dubbed TFT. In addition, we leverage
the pre-trained audio-LLM WavLM [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] to extract latent
representations, thereby enhancing the compactness and
generalization of the input features.
        </p>
        <p>When inputting an audio to be detected, log mel
spectra and latent representations are extracted first. Two
alternative combination techniques, namely feature
concatenation and multi-channel fusion, are employed to
derive the input features. The combined features are
then fed into the ResNet101-TFT network to generate
predicted probabilities. To determine the classification, we
establish a hyperparameter threshold denoted as T and
compare the maximum probability of prediction against
this threshold. If the maximum probability is below T, the
prediction is labeled as an unknown counterfeit, while
exceeding the threshold identifies it as belonging to a
specific category. The details are illustrated in Figure 1.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Backbone Network</title>
        <sec id="sec-2-2-1">
          <title>WavLM</title>
        </sec>
        <sec id="sec-2-2-2">
          <title>Log Mel Spectra</title>
        </sec>
        <sec id="sec-2-2-3">
          <title>Latent Representions</title>
        </sec>
        <sec id="sec-2-2-4">
          <title>Feature</title>
        </sec>
        <sec id="sec-2-2-5">
          <title>Concatenation</title>
        </sec>
        <sec id="sec-2-2-6">
          <title>Multi-Channel</title>
        </sec>
        <sec id="sec-2-2-7">
          <title>Fusion</title>
        </sec>
        <sec id="sec-2-2-8">
          <title>Input Features</title>
        </sec>
        <sec id="sec-2-2-9">
          <title>ResNet101-TFT</title>
        </sec>
        <sec id="sec-2-2-10">
          <title>Output Probabilities (P)</title>
        </sec>
        <sec id="sec-2-2-11">
          <title>Threshold (T) P &gt; T Y N</title>
        </sec>
        <sec id="sec-2-2-12">
          <title>Real and 6 Counterfeit</title>
        </sec>
        <sec id="sec-2-2-13">
          <title>Unknown Counterfeit</title>
          <p>
            ResNet [
            <xref ref-type="bibr" rid="ref17">17</xref>
            ] is a well-known convolutional neural net- 2.3. TFT Module
work (CNN) based network that have achieved great
performance in diferent tasks, the use of residual con- Speech signals are inherently long sequences of data
nections allows information from earlier layers of the that exhibit time-varying and periodic characteristics.
network to be easily passed forward to later layers, ad- To efectively capture long-term temporal dependencies
dressing the problem of vanishing gradients in deep net- and aggregate contextual information across diferent
works. To this end, we utilize ResNet101 as the backbone. frequency bands, inspired by [18, 19], we introduce the
The structure of ResNet 101 as shown in Figure 2, is Temporal-Frequency Transformer (TFT) module. By
incomposed of a series of building blocks, each of which corporating the TFT module, we aim to enhance the
abilconsists of multiple convolutional layers and a skip con- ity of our system to capture complex temporal
dynamnection that bypasses the convolutional layers. The first ics and exploit the contextual relationships in deepfake
block in ResNet101 consists of a single convolutional speech utterances. TFT includes two branches that
enlayer followed by a max pooling layer, while the remain- able the modeling of long-term dependencies along both
ing blocks each contain multiple residual blocks. The the temporal and frequency dimensions. These branches,
ifnal layer of the network is a fully connected layer with called the adaptive temporal modeling branch and the
e
p
a
h
s
e
R
C
X
F
X
T
X
B
e
p
a
h
s
e
R
x
T
)x C
F
B
(
x
F
)x C
T
B
(
          </p>
          <p>A
N S
B HM</p>
          <p>A
N S
B HM</p>
          <p>Temporal Modeling</p>
          <p>N
B
N
B
i-BURG leuR irneLa
i-BRUG leuR irneaL</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Experiments</title>
      <sec id="sec-3-1">
        <title>3.1. Datasets</title>
        <p>adaptive frequency modeling branch, use two adaptive
weights  and . The module incorporates an improved
transformer, which includes a multi-head self-attention
(MHSA) module and a GRU-based feed-forward network.</p>
        <p>
          Residual connections and batch normalization are also
employed. To better model long-term dependencies, the
feed-forward network uses a bi-directional GRU (Bi-GRU)
instead of the first fully connected layer in the traditional
transformer [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. These changes allow the TFT module
to capture long-term dependencies more efectively. A
diagram of the TFT module is shown in Figure 3.
        </p>
        <p>
          The training and development datasets of ADD 2023
Challenge Task 3 consist of 22,397 and 8,400 audio clips,
respectively. We rearrange the training set and
development set in a ratio of 9 to 1. All audios are in
single2.4. Utilization of Pre-trained WavLM channel 16KHz 16-bit format, ranging from 1 to 105
seconds. In the training and development datasets, there are
Recently, following the success of the language model a total of 7 categories, with 1 category representing real
BERT on textual data representation, various models audio and the remaining 6 categories representing
counwhich learn audio data representation have been devel- terfeit audio. Each of these categories is labeled from 0
oped. The objective is to train a system for a single task to 6. The test dataset, on the other hand, comprises 8
requiring an extensive representation of the underlying categories, including the 7 categories found in the
trainaudio data. Once the network is trained, the last few ing and development datasets and an additional category
layers are then removed to get a system building an ex- representing an unknown counterfeit. To better leverage
tensive vectorial representation of audio data, which can the training data, we clip long-duration deepfake speech
then be used as input features. WavLM [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] is the lat- utterances into segments ranging from 4 to 8 seconds
est self-supervised model built with transformer blocks with the same label. ADD 2023 Challenge permits the
trained on Mix94k, a corpus of 94k hours drawn from use of external non-speech resources (e.g. noise samples
LibriLight, VoxPopuli and GigaSpeech. WavLM learns to and impulse responses), therefore 50,000 noise and room
represent speech by masking a part of the signal and try- impulse response audio clips are sampled from the 4th
ing to predict the hidden part. On this aspect, this model DNS challenge [22] and utilized in our training pipeline.
is similar to the self-supervised models HuBERT [20] and
wav2vec2.0 [21]. WavLM is task agnostic and achieves
state-of-the-art performance on various benchmarks. To
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Data Augmentation</title>
        <p>To further reveal the artifacts in the deepfake speech
utterances and make the deep learning based model robust,
our data augmentation pipeline comprises two
strategies. One is that we generate mixed audio by mixing
speeches, noises, and room impulse responses. One
original deepfake speech audio is added by a piece of noise
recording with a signal-to-noise ratio (SNR) drawn from
a Gaussian distribution with N(−5, 20)dB with an 80%
possibility. Then, this audio is convolved with a piece
of room impulse response with a possibility of 50%. The
other is that random sampling, time stretching, time,
and frequency masking are applied to the mix audios
generated by the first strategy with a certain probability.
Specifically, one mix audio is upsampled or downsampled
ranging in [8kHz, 16kHz, 24kHz], then processed with
speed shifting and temporal and frequency masking.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Preprocessing</title>
        <p>We extract input features from the augmented audios
in diferent hierarchies. To be exact, we facilitate
128dimensional log Mel spectrograms extracted with 1024
samples of Hann window and 512 samples shift as
low × ×1 , we further exploit the
level common features F
pre-trained WavLM to extract high level general latent
 × ×1 . We explore two diferent
fearepresentations Rℎℎ
ture combination techniques: one is concatenating
lowlevel features and high-level features along the feature
dim as feature concatenation resulting in the input
features I × ×1 , the other is combining low-level features
and high-level features as multi-channel representation
fusion resulting in the input features I × ×2 , in which
T denotes time-frames and F denotes the feature dim.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Training Details</title>
        <p>The augmented training data are clipped into 4-sec long
segments. AdamW optimizer is adopted to train the
model and ReduceLROnPlateau learning rate scheduler
is applied to control the learning rate. Batch size is set
to 48 and the upper limit of training epochs is set to
100. The optimization criteria are Cross Entropy loss
and the Kullback-Leibler divergence loss [23] between
the prediction probabilities and target labels as we set
the output size of the last fully connected layer in our
deepfake AR system to be 7, the highest logit indicates
the predicted class. The targets are set to be the same
size, where the probability of the true class is 1 and the
others are 0. The hyperparameters  and  in the TFT
module are initialized to 1. Early stop is utilized when
the accuracy rate on the dev set stops improving for 10
epochs. gradient clipping is employed to avoid
overfitting and encourage the models to learn more robust and
generalizable representations.</p>
      </sec>
      <sec id="sec-3-5">
        <title>3.5. Finetuning Strategy</title>
        <p>We intuitively perceive the Deepfake Algorithm
Recognition as a content-invariant classification task, due to
the fact that humans tend to assess the authenticity of an
audio through aspects such as pitch, tone, naturalness,
emotions, and subjective auditory perception, rather than
the actual content of the audio. To this end, we draw on
the experience of the mixup strategy [24, 25, 26] from
computer vision and introduce a content-invariant
finetuning strategy. Specifically, we fully exploit the oficial
dataset provided by ADD Challenge in two ways. One
is that we simulate multi-speaker audios by mixing
different deepfake utterances with the same label with a
signal-to-noise ratio (SNR) drawn from a Gaussian
distribution with N(−5, 20)dB, and the other is that we
randomly clip deepfake utterances with the same label
into 1-2 secs and concatenate together to obtain new
audio sequences. We then employ the generated data
to finetune our model and achieve better results on the
evaluation set, the details are discussed in Section 4.</p>
      </sec>
      <sec id="sec-3-6">
        <title>3.6. Model Ensemble</title>
        <p>Model ensemble [27, 28] is a machine learning
technique that combines the predictions of multiple models
to achieve better performance than any individual model,
which reduces the impact of individual model biases and
errors and improves the overall accuracy and robustness
of the predictions.</p>
        <p>As the test dataset includes an additional category for
an unknown counterfeit, which is not present in the
training and development datasets, we set the output size of
our deepfake AR system to 7. To detect the unknown
counterfeit, we compare the posterior probability output
P with a hyperparameter threshold T. If the posterior
probability P is less than the threshold T, we consider
the audio to be the unknown counterfeit, otherwise, the
audio is classified into the 7 known categories. The
hyperparameter T is tuned by the performances on the
evaluation set.</p>
        <p>= ∑︁ ∑︀
=1 −1

 + 
 + 
(1)</p>
        <p>In model ensemble, we use weighted averaging [29]
to combine the predictions of multiple models and
obtain the ensembled posterior probability, demonstrated
in Equation (1). The ensemble prediction probability is
calculated by taking a weighted average of the individual
model predictions. The weights  are assigned based
on the accuracy of each model on the development set,
which ensures that the more accurate models are given</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>X.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Soong</surname>
          </string-name>
          , T.-Y. Liu,
          <article-title>A survey on neural speech synthesis</article-title>
          ,
          <source>arXiv preprint arXiv:2106.15561</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B.</given-names>
            <surname>Sisman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yamagishi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>King</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>An overview of voice conversion and its challenges: From statistical modeling to deep learning</article-title>
          ,
          <source>IEEE/ACM Transactions on Audio, Speech, and Language Processing</source>
          <volume>29</volume>
          (
          <year>2020</year>
          )
          <fpage>132</fpage>
          -
          <lpage>157</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X. Y.</given-names>
            <surname>Ruibo Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <year>Add 2023</year>
          :
          <article-title>the second audio deepfake detection challenge</article-title>
          ,
          <source>in: IJCAI 2023 Workshop on Deepfake Audio Detection and Analysis (DADA</source>
          <year>2023</year>
          ),
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Nie</surname>
          </string-name>
          , H. Ma,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <year>Add 2022</year>
          :
          <article-title>the first audio deep synthesis detection challenge</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2202</volume>
          .
          <fpage>08433</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kinnunen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Evans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yamagishi</surname>
          </string-name>
          , [18]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Tian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hanilçi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sahidullah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sizov</surname>
          </string-name>
          ,
          <year>Asvspoof 2015</year>
          : L.
          <article-title>Xie, Multi-task deep residual echo suppression the first automatic speaker verification spoofing with echo-aware loss</article-title>
          , in: ICASSP 2022
          <article-title>-2022 IEEE and countermeasures challenge</article-title>
          ,
          <source>in: Sixteenth an- International Conference on Acoustics, Speech and nual conference of the international speech com- Signal Processing (ICASSP)</source>
          , IEEE,
          <year>2022</year>
          , pp.
          <fpage>9127</fpage>
          - munication association,
          <year>2015</year>
          .
          <volume>9131</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Kinnunen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sahidullah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Delgado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Todisco</surname>
          </string-name>
          , [19]
          <string-name>
            <given-names>G.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Evans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yamagishi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. A.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>The asvspoof 2017 Dual-branch attention-in-attention transformer for challenge: Assessing the limits of replay spoofing single-channel speech enhancement, in: ICASSP attack detection (</article-title>
          <year>2017</year>
          ).
          <fpage>2022</fpage>
          - 2022 IEEE International Conference on
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Todisco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vestman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sahidullah</surname>
          </string-name>
          , Acoustics, Speech and
          <string-name>
            <given-names>Signal</given-names>
            <surname>Processing</surname>
          </string-name>
          (ICASSP),
          <string-name>
            <given-names>H.</given-names>
            <surname>Delgado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nautsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yamagishi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Evans</surname>
          </string-name>
          ,
          <year>2022</year>
          , pp.
          <fpage>7847</fpage>
          -
          <lpage>7851</lpage>
          . T. Kinnunen,
          <string-name>
            <given-names>K. A.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <year>Asvspoof 2019</year>
          : Future [20]
          <string-name>
            <given-names>W.-N.</given-names>
            <surname>Hsu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bolte</surname>
          </string-name>
          , Y.
          <string-name>
            <surname>-H. H. Tsai</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>Lakhohorizons in spoofed and fake audio detection, arXiv tia</article-title>
          , R. Salakhutdinov,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohamed</surname>
          </string-name>
          , Hubert: preprint arXiv:
          <year>1904</year>
          .
          <volume>05441</volume>
          (
          <year>2019</year>
          ).
          <article-title>Self-supervised speech representation learning by</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Lyu</surname>
          </string-name>
          ,
          <article-title>Deepfake detection: Current challenges and masked prediction of hidden units, IEEE/ACM next steps</article-title>
          , in: 2020 IEEE international conference Transactions on Audio, Speech, and
          <article-title>Language Proon multimedia &amp; expo workshops (ICMEW)</article-title>
          , IEEE, cessing
          <volume>29</volume>
          (
          <year>2021</year>
          )
          <fpage>3451</fpage>
          -
          <lpage>3460</lpage>
          .
          <year>2020</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . [21]
          <string-name>
            <given-names>A.</given-names>
            <surname>Baevski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohamed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Auli</surname>
          </string-name>
          , wav2vec
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Almutairi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Elgibreen</surname>
          </string-name>
          ,
          <article-title>A review of modern 2.0: A framework for self-supervised learning of audio deepfake detection methods: Challenges and speech representations</article-title>
          ,
          <source>Advances in neural inforfuture directions, Algorithms</source>
          <volume>15</volume>
          (
          <year>2022</year>
          )
          <article-title>155</article-title>
          . mation processing systems
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>12449</fpage>
          -
          <lpage>12460</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>V.</given-names>
            <surname>Popov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Vovk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Gogoryan</surname>
          </string-name>
          , T. Sadekova, [22]
          <string-name>
            <given-names>H.</given-names>
            <surname>Dubey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Gopal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cutler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Aazami</surname>
          </string-name>
          , S. MatuM. Kudinov,
          <article-title>Grad-tts: A difusion probabilistic sevych, S</article-title>
          . Braun,
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Eskimez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Thakker</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>Yoshmodel for text-to-speech</article-title>
          , in: International Confer- ioka, H. Gamper,
          <string-name>
            <given-names>R.</given-names>
            <surname>Aichner</surname>
          </string-name>
          ,
          <article-title>Icassp 2022 deep noise ence on Machine Learning</article-title>
          , PMLR,
          <year>2021</year>
          , pp.
          <fpage>8599</fpage>
          -
          <lpage>suppression</lpage>
          challenge,
          <year>2022</year>
          . arXiv:
          <volume>2202</volume>
          .
          <fpage>13288</fpage>
          . 8608. [23]
          <string-name>
            <surname>J. M. Joyce</surname>
          </string-name>
          ,
          <article-title>Kullback-leibler divergence</article-title>
          , in: Interna-
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yoon</surname>
          </string-name>
          ,
          <article-title>Glow-tts: A gener- tional encyclopedia of statistical science, Springer, ative flow for text-to-speech via monotonic align-</article-title>
          <source>2011</source>
          , pp.
          <fpage>720</fpage>
          -
          <lpage>722</lpage>
          . ment search,
          <source>Advances in Neural Information Pro</source>
          <volume>-</volume>
          [24]
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cisse</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. N.</given-names>
            <surname>Dauphin</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          Lopez-Paz,
          <source>cessing Systems</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>8067</fpage>
          -
          <lpage>8077</lpage>
          . mixup:
          <article-title>Beyond empirical risk minimization</article-title>
          , arXiv
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T.</given-names>
            <surname>Kaneko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kameoka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Tanaka</surname>
          </string-name>
          , N. Hojo, preprint arXiv:
          <volume>1710</volume>
          .09412 (
          <year>2017</year>
          ).
          <article-title>Cyclegan-vc2: Improved cyclegan-based non-</article-title>
          [25]
          <string-name>
            <given-names>H.</given-names>
            <surname>Inoue</surname>
          </string-name>
          ,
          <article-title>Data augmentation by pairing samparallel voice conversion, in: ICASSP 2019- ples for images classification</article-title>
          ,
          <source>arXiv preprint 2019 IEEE International Conference on Acoustics</source>
          , arXiv:
          <year>1801</year>
          .
          <volume>02929</volume>
          (
          <year>2018</year>
          ).
          <source>Speech and Signal Processing (ICASSP)</source>
          , IEEE,
          <year>2019</year>
          , [26]
          <string-name>
            <given-names>C.</given-names>
            <surname>Si</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Liu</surname>
          </string-name>
          , M. Sun, pp.
          <fpage>6820</fpage>
          -
          <lpage>6824</lpage>
          .
          <article-title>Better robustness by more coverage: Adversarial</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>W. J.</given-names>
            <surname>Scheirer</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. de Rezende Rocha</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sapkota</surname>
            ,
            <given-names>T. E.</given-names>
          </string-name>
          <article-title>and mixup data augmentation for robust finetuning, Boult, Toward open set recognition, IEEE transac- in: Findings of the Association for Computational tions on pattern analysis and machine intelligence Linguistics: ACL-IJCNLP</article-title>
          <year>2021</year>
          ,
          <year>2021</year>
          , pp.
          <fpage>1569</fpage>
          -
          <lpage>1576</lpage>
          . 35 (
          <year>2012</year>
          )
          <fpage>1757</fpage>
          -
          <lpage>1772</lpage>
          . [27]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>A deep learning-</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <article-title>A novel resnet101 model based on dense based multi-model ensemble method for cancer dilated convolution for image classification, SN prediction</article-title>
          ,
          <source>Computer methods and programs in Applied Sciences</source>
          <volume>4</volume>
          (
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          . biomedicine 153 (
          <year>2018</year>
          )
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          , [28]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Ganaie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Malik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tanveer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>SugJ. Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kanda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Yoshioka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Xiao</surname>
          </string-name>
          , et al.,
          <article-title>Wavlm: anthan, Ensemble deep learning: A review, EngiLarge-scale self-supervised pre-training for full neering Applications of Artificial Intelligence 115 stack speech processing</article-title>
          ,
          <source>IEEE Journal of Selected</source>
          (
          <year>2022</year>
          )
          <fpage>105151</fpage>
          . Topics in
          <source>Signal Processing</source>
          <volume>16</volume>
          (
          <year>2022</year>
          )
          <fpage>1505</fpage>
          -
          <lpage>1518</lpage>
          . [29]
          <string-name>
            <given-names>D.</given-names>
            <surname>Card</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Smith</surname>
          </string-name>
          , Deep weighted
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          , J. Uszkoreit, averaging classifiers,
          <source>in: Proceedings of the conferL. Jones</source>
          , et al.,
          <article-title>Attention is all you need, in: Proc. ence on fairness, accountability, and transparency</article-title>
          ,
          <source>NeurIPS</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>5998</fpage>
          -
          <lpage>6008</lpage>
          .
          <year>2019</year>
          , pp.
          <fpage>369</fpage>
          -
          <lpage>378</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>K.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , S. Ren,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <article-title>Deep residual learning for image recognition</article-title>
          ,
          <source>in: Proc. CVPR</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>770</fpage>
          -
          <lpage>778</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>