<!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>Cross-lingual Training for Retrieval-based Dialogue Systems?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Table</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>. Results (R@</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ITMO University</institution>
          ,
          <addr-line>49 Kronverksky Pr., Saint Petersburg, 197101</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Speech Technology Center</institution>
          ,
          <addr-line>4 Krasutskogo St., Saint Petersburg, 196084</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In recent years, cross-lingual approaches have been successfully applied to a variety of tasks and have shown potential when available data is scarce. That potential can be e ectively leveraged when building a retrieval-based dialogue system. In this paper we investigated di erent methods of cross-lingual training of retrieval-based dialogue systems. We compare several cross-lingual approaches, including adversarial pretraining on resource-rich language dataset and further ne-tuning of pretrained models with low-resource language dialogue data. This adversarial architecture extends Dual Encoder network with language discriminator. Other approaches are based on di erent training strategies, such as mixing data in di erent languages, adversarial learning and pretraining on big data. Experiments show that adversarial learning performs competitively, which is also true for the data mixing strategy.</p>
      </abstract>
      <kwd-group>
        <kwd>Cross-Lingual Dialogue System Retrieval-Based Adversarial Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Retrieval-based dialogue systems have received a great amount of attention
recently, mainly due to their predictability and more reasonable data requirements
compared to their generative counterparts. However, retrieval-based models are
also becoming larger, needing more data in order to be successfully trained. It
is quite di cult to get a large dataset with human-human dialogues, su cient
for training a retrieval-based system. Especially when it is not English language
because most languages have limited resources.</p>
      <p>
        The lack of labeled data in most languages remains an open question and
attracts more and more attention from researchers. For example, the work of Chen
et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] studies this issue; they attempt to compensate for the lack of labeled
data in di erent languages. In the work of Chidambaram et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] the
investigated problem is to explore the cross-lingual approach for building
retrievalbased cross-lingual dialogue systems by maximizing the representational
similarity between sentence pairs drawn from parallel data.
      </p>
      <p>
        In our work we focus on the possibility of pretraining models on large dataset
and ne-tuning on the target case. One of the proposed approaches uses an
adversarial component as language discriminator for transfer semantic relations
from one language to another just as it was in the work of Chen et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. We
suggest it simpli es the adaptation of model to target domain in dialogue systems
too. Our experiments compare the proposed approach with several other
training strategies, such as training on the blending bilingual data and consequent
training with pretraining on SOURCE data and future ne-tuning on TARGET. Our
Adversarial approach show good performance and in some cases surpasses all
alternative approaches.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Architectures &amp; methods</title>
      <p>
        Retrieval-based dialogue systems. Over the last decade, various new
architectures have been proposed in attempt to maximize performance on response
retrieval datasets. Most of these use a recurrent network to construct either a at
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] or a hierarchical [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] context representation. For our experiments, we have
chosen Dual Encoder for its simplicity. This model features an RNN encoder E
with word embedding layer to produce context and response embeddings. The
probability of an utterance being a suitable reply considering the current
context is given by (cT M r), where c; r are the context and response embeddings,
respectively, and M is a learnable parameter. We refer to the module that
performs this computation as the matcher, M. A diagram of Dual Encoder can be
seen in Figure 1 (right).
      </p>
      <p>
        Pretraining and transfer learning. Pretraining a deep neural model using
data from a di erent domain is a common method for nding a good
initialization point for successful further training, or ne-tuning, on target data. A large
number of works from various elds prove the e ectiveness of this procedure
and explore the principle behind it. For example, the work of Erhan et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]
demonstrated that pretraining acts as a regularization mechanism, enabling
better generalization in deep neural networks. Recent works in NLP also show the
importance of unsupervised pretraining for language modeling [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and machine
translation [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>In the current work, we investigate the potential of pretraining a
retrievalbased dialogue model using data in another language for improving performance
in target language. Conceptually, we attempt to perform a sort of transfer
learning by using weights of the model trained on the source dataset as a starting
point for ne-tuning on the target dataset.</p>
      <p>
        Adversarial learning. To extend our base model to a scenario where the
available data is bilingual, we add the language discriminator, Q, which aims to
identify the language of an input text. Speci cally, the inputs of Q are
embeddings given by E of pairs of contexts and responses in both languages. Similarly
to ADAN [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], Q models an unbounded Lipschitz function with K = 0:05, and
strives to minimize the Wasserstein distance between P src and P tgt, which are
the distributions of hidden features of E when the data iEs either inEthe source or
the target language, respectively:
      </p>
      <p>Jq( e)
max
q E(x)EP src [Q(E (x))]</p>
      <p>E
E(x0)E P tgt [Q(E (x0))]</p>
      <p>E
(1)
Response matching loss is binary cross-entropy, denoted as Lm( ; ), between
prediction from M and the ground truth label:</p>
      <p>Jm( e)
min E [Lm(M(E (x)); y)]</p>
      <p>M x;y
Adversarial loss is therefore given by:</p>
      <p>Je
min Jm( e) + Jq( e)
e
(2)</p>
      <p>Ubuntu RU Customer support
DE, ru 0.13 / 0.24 / 0.55 0.23 / 0.40 / 0.75
DE, en+ru 0.30 / 0.48 / 0.80 0.40 / 0.62 / 0.91
DE, pretr en 0.24 / 0.39 / 0.72 0.37 / 0.60 / 0.90
ADE, pretr en 0.27 / 0.42 / 0.75 0.40 / 0.65 / 0.92</p>
      <p>ADE, pretr en+ru 0.17 / 0.32 / 0.66 0.27 / 0.49 / 0.82</p>
      <p>We hypothesize that such training will allow E and M to learn
languageindependent knowledge to improve response retrieval performance on our target
dataset compared to the baseline, the monolingual Dual Encoder.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Experiments</title>
      <p>3.1</p>
      <sec id="sec-3-1">
        <title>Data and Evaluation Metrics</title>
        <p>
          Our experiments include target data of 2 types. First is Ubuntu Corpus [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ],
machine-translated to Russian, which is parallel to the original on a sentence
level. We have extracted non-overlapping parts of both corpora for pretraining
and ne-tuning. This corpus helps to study the problem of transfer knowledge
between languages. In experiments using this corpus, we used the rst 80 percent
of the dialogues from the English corpus and 20 percent of the translated. The
second type of data is customer service dialogs of a large Russian mobile network
operator. The structure and domain of the data is very di erent from the Ubuntu
corpus and these experiments re ect a more realistic setting.
        </p>
        <p>The Ubuntu Corpus. The English data set is the Ubuntu Corpus which
contains multi-turn dialogues collected from chat logs of the Ubuntu Forum. The
data set consists of 1 million context-response pairs for training, 20 thousand
pairs for validation, and 20 thousand pairs for testing. Positive responses are true
responses from humans, and negative ones are randomly chosen sampled from
other responses in the training set. The ratio of the positive and the negative is
1: 1 in training, and 1: 9 in validation and testing.</p>
        <p>The Ubuntu Corpus, Machine Translated to Russian. Some of our
experiments also used the Ubuntu corpus in Russian. The data was obtained using
a machine translation of the full Ubuntu Corpus into Russian. Our goal was
to keep data intersection to minimum. Therefore, in the Russian version, we
transliterated all the English words, thus received zero intersection between
dictionaries. In experiments using this corpus, we used the rst 80 percent of the
dialogues from the English corpus and 20 percent of the translated.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Russian Customer Support Dialogues. The Russian language corpus in</title>
        <p>cludes dialogues of customer support services of a large Russian mobile network
operator. It consists of 200 thousand context-response pairs in training set and
20 thousand in validation and testing. Similar to Ubuntu corpus, negative
examples were randomly selected from other parts of the training set. The ratio of the
positive and the negative is 1: 1 in training, and 1: 9 in validation and testing.
Dictionaries of current corpus and English Ubuntu intersect on 1 percent.
3.2</p>
      </sec>
      <sec id="sec-3-3">
        <title>Evaluation Metrics.</title>
        <p>For evaluation we use Recall@k (R@k) metric. The test dataset was prepared
that for each context-response pair another 9 responses were selected from
elsewhere in the test data. The 10 options for response were ranked, and the result
was agged as positive if the correct response was included in the top-k of ranked
utterances. The percentage of positive results yields Recall@k, a conventional
metric for evaluating retrieval-based models.
3.3</p>
      </sec>
      <sec id="sec-3-4">
        <title>Experiments and Results</title>
        <p>Our main results are shown in Table 1, which aggregates performance of the
retrieval process for di erent pretraining and training methods. We conduct
our experiments with random embeddings initialization (experiments with
pretrained bilingual word embeddings (BWEs) didn't show any other correlations).
For calculating R@k, k 2 f1; 2; 5g is being used. Whenever pretraining is
conducted in SOURCE language, we save the best model with best recalls on SOURCE
validation set, and the same is for TARGET. All results in the Table 1 have been
evaluated with test set in TARGET language.</p>
        <p>We conducted a series of experiments with classical Dual Encoder network
to learn about generalization ability of this siamese RNN for the case of
crosslingual learning. First of all, we made straightforward training of DE with TARGET
dataset. Following the idea of training with only low-resource data available, we
consider TARGET-only training as baseline. Evaluation (Row 1) gives the lowest
recalls (TARGET test set).</p>
        <p>After that, we conduct two cross-lingual experiments. For that, we utilize
SOURCE dataset, which volume is 4x larger than TARGET dataset. We exploit
Ubuntu corpus to minimize domain divergence. The rst cross-lingual setup
implies SOURCE pretraining and subsequent ne-tuning with TARGET data. We
observe recall increase during evaluation on the test set. The essence of the next
experiment is blending languages during training. Without any pretraining , we
train dual encoder on mixed bilingual data, so that for every 4 SOURCE-language
documents there is one TARGET-language. Row (3) represents TARGET-test and
rise of recalls compared with TARGET-only and pretraining methods.</p>
        <p>To investigate e ectiveness of adding language discriminator to DE
architecture, we conduct two series of experiments, one with pretraining on SOURCE-only
data and another one with blending SOURCE and TARGET languages. Following
the design scheme of baselines, we prepare pretrained model and then ne-tune it
with TARGET language, then evaluate with calculating recalls. Language
discriminator is always trained on both SOURCE and TARGET languages, while encoder
part of the system may be trained with SOURCE-only and SOURCE-TARGET joint
mix, which led to two separate results. We compare ADE performance with
original DE performance and observe that adversarial learning gives performance
increase compared to train on TARGET language, thus it gives competitive results
comparing to DE trained on the blended data.</p>
      </sec>
      <sec id="sec-3-5">
        <title>3.4 Impact of Bilingual Word Embeddings</title>
        <p>
          For the basic experiments we exploit initialization of random word embeddings
by the embedding layer of the encoder. This allows us to track relative change
of the evaluation metrics. For the experiment we use pre-trained cross-lingual
word embeddings by Conneau et al. [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] with Russian-English align and joint
Russian-English dictionary. Results show that exploiting Bilingual Word
Embeddings (BWEs) is not always a winning practice, and there is no strict
correlation between results with BWEs and without them. This uncertainty could be
explained with the domain-speci c nature of data we use in all the cases, and
the fact pretrained BWEs are created for a general purpose.
        </p>
      </sec>
      <sec id="sec-3-6">
        <title>3.5 Implementation details</title>
        <p>
          For all our experiments on both languages, the encoder E is implemented as
one-directional LSTM, with 300 hidden units. We set the 300-dimensional
embedding layer to be trainable. Language discriminator is implemented with 2
linear layers and ReLU non-linearities. Dual Encoder and Language
Discriminator are optimized using separate Adam optimizers [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. We set learning rate
equal for Q and E of 0.001. The weights of Q are clipped to [ 0:05; 0:05]. We
implement pretraining for both DE and ADE for 5 epochs and use early
stopping technique exploiting harmonic mean of recalls as stopping criteria. For the
further training, we run 13 epochs and also use early stopping. Both DE and
ADE are implemented with PyTorch [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Discussion</title>
      <p>According to the results of Table 1, it can be noted that DE model trained
on blended data (DE, en+ru) and the model pretrained by the ADE method on
English set (ADE, pretr en) outperform the DE model, which simply sequentially
learns on English set and then ne-tune on Russian set (DE, pretr en). This e ect
can be explained by the fact that model (DE, pretr en) can have over tting
on target data. In this case, adding a mixture of data in (DE, en+ru) and
discriminator (ADE, pretr en) serves as a kind of regularization.</p>
      <p>In Table 2 we present the absolute values of the loss function on training data
during the training model English and Russian Ubuntu with Random
embeddings in order to study this issue in more detail. The results also con rm that
the absolute values of the loss function in model (DE pr(en)) on the TARGET
language are lower than the others, and therefore the model in this case can be
over tted.</p>
      <p>The results obtained with adversarial training on machine translation corpus
make us think that the discriminator does not su ciently bridges the gaps
between languages. This comes from the fact that ADE performs no better than
joint DE trained on the blend of English and Russian data. Therefore, it seems
that the generalization ability of the encoder itself is higher when it gradually
fed with bilingual data. Our main hypothesis was that adversarial component
would make encoder to generate language-independent features. However, it can
be seen that adversarial training su ce more when the target data is not directly
matching source data. We speculate that the reason of this may lie into the
hidden latent factors of the sentence representations. Along with language latent
component, a representation contains semantic latent component. When we feed
the discriminator with parallel data, it does not know a di erence between these
latent factors and strives to use all possible dissimilarities to predict whether
the sentence is from SOURCE or TARGET. So, when the semantic factor becomes
diminished, representations become meaningless | and correct response can
hardly be matched to context. However, when datasets are not aligned perfectly,
this e ect does not occur, maybe due to correct consideration of latent factors
by discriminator (or, at least, in a more balanced way). This side e ect makes
language discriminator, as we constructed it, not very e ective in the terms of
cross-lingual adaptation, but helps to bridge the gaps between di erent domains,
which is also important.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and Future Work</title>
      <p>In this work we investigated di erent methods of cross-lingual training of
retrievalbased dialogue systems. These methods include pretraining on resource-rich
language dataset and further ne-tuning of pretrained models with low-resource
language dataset. Also, we experimented with blending data in di erent
languages for improving training. We exploited LSTM-based Dual Encoder network
as basic retrieval-based model. We also introduce adversarial cross-lingual
architecture, ADE, which is based on Dual Encoder model and exploits language
discriminator. We validate e ectiveness of these methods conducting experiments
on English-language Ubuntu Dialogue Corpus and two Russian-language corpora
| machine translation of the Ubuntu Corpus and Russian Customer Support
Corpus. Experiments show e ectiveness of mixing low- and rich-resource data
and training improvement, compared to regular pretraining. Moreover, we
observe competitive performance of ADE on cross-lingual tasks.</p>
      <p>In future work we plan on adapting a more advanced retrieval-based model
to an adversarial setting. We may also explore the impact of using a transformer
model as the encoder of the proposed adversarial model.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Athiwaratkun</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cardie</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Weinberger</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Adversarial deep averaging networks for cross-lingual sentiment classi cation</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          ,
          <volume>6</volume>
          ,
          <fpage>557</fpage>
          -
          <lpage>570</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Chidambaram</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yuan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sung</surname>
            ,
            <given-names>Y.-H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strope</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurzweil</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Learning cross-lingual sentence representations via a multi-task dual-encoder model</article-title>
          . arXiv preprint arXiv:
          <year>1810</year>
          .
          <volume>12836</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Lowe</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pow</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Serban</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pineau</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>The ubuntu dialogue corpus: A large dataset for research in unstructured multi-turn dialogue systems</article-title>
          .
          <source>arXiv preprint arXiv:1506.08909</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Kadlec</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kleindienst</surname>
          </string-name>
          , J.:
          <article-title>Improved Deep Learning Baselines for Ubuntu Corpus Dialogs</article-title>
          .
          <source>arXiv preprint arXiv:1510.03753</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dong</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yan</surname>
            <given-names>R</given-names>
          </string-name>
          .
          <article-title>: Multi-view Response Selection for Human-Computer Conversation</article-title>
          .
          <source>Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing</source>
          ,
          <volume>372</volume>
          {
          <fpage>381</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Erhan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Courville</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manzagol</surname>
          </string-name>
          , P.-A.,
          <string-name>
            <surname>Vincent</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Why Does Unsupervised Pre-training Help Deep Learning?</article-title>
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>11</volume>
          (Feb),
          <fpage>625</fpage>
          -
          <lpage>660</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Radford</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narasimhan</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salimans</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Improving Language Understanding by Generative Pre-Training</article-title>
          . URL https://www.semanticscholar. org/paper/Improving-Language-
          <article-title>Understanding-by-</article-title>
          <source>Generative-Radford/ cd18800a0fe0b668a1cc19f2ec95b5003d0a5035. Last accessed Jan 17</source>
          <year>2020</year>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ramachandran</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <surname>Q.</surname>
          </string-name>
          :
          <article-title>Unsupervised Pretraining for Sequence to Sequence Learning</article-title>
          .
          <source>arXiv preprint arXiv:1611.02683</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Conneau</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lample</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ranzato</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Denoyer</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jegou</surname>
          </string-name>
          , H.:
          <article-title>Word Translation Without Parallel Data</article-title>
          .
          <source>arXiv preprint arXiv:1710.04087</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D. P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , J.:
          <article-title>Adam: A Method for Stochastic Optimization</article-title>
          .
          <source>arXiv preprint arXiv:1412.6980</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Paszke</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gross</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chintala</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chanan</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Devito</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Desmaison</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Antiga</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lerer</surname>
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Automatic Di erentiation in PyTorch</article-title>
          . URL https: //pdfs.semanticscholar.org/b36a/5bb1707bb9c70025294b3a310138aae8327a. pdf?_
          <source>ga=2.199060591.154285120.1579522748-1279907765.1576757633. Last accessed Jan 17</source>
          <year>2020</year>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>