<!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-modal Networks, Fine-Tuning, Data Augmentation and Dual Softmax Operation for MediaEval NewsImages 2023</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Antonios Leventakis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Damianos Galanopoulos</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vasileios Mezaris</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Information Technologies Institute / Centre for Research and Technology Hellas</institution>
          ,
          <addr-line>Thessaloniki</addr-line>
          ,
          <country country="GR">Greece</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Matching images to articles is challenging and can be considered a special version of the cross-media retrieval problem. This notebook paper presents our solution for the MediaEval NewsImages 2023 benchmarking task. We investigate the performance of pre-trained cross-modal networks. Specifically, we investigate two pre-trained CLIP model variations and fine-tuned one for domain adaptation. Additionally, we utilize a data augmentation technique and a method for revising the similarities produced by either one of the networks, i.e., a dual softmax operation, to improve our solutions' performance. We report the oficial results for our submitted runs and additional experiments we conducted to evaluate our runs internally. We conclude that fine-tuning benefits the performance, and it is important to consider the data's nature when selecting the appropriate pre-trained CLIP model.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In this paper, we deal with the text-to-image retrieval task adapted for the needs of the MediaEval
NewsImages 2023 task [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Nowadays, news sites publish multimedia content in their online
news articles to better convey the message the textual article wants to convey to readers. So,
associating news articles with multimedia content is crucial for several research tasks such as
cross-modal retrieval and disinformation detection. Our participation [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] in the NewsImages
2022 task showed that cross-modal networks trained on large sets of data, such as CLIP [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ],
perform optimally. Based on that outcome, to deal with image retrieval using textual articles,
this year’s approach is based on pre-trained versions of CLIP [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. To further adapt them
to this specific task, we fine-tune them with extra news article-based datasets to improve
the performance. Moreover, similarly to our previous works [
        <xref ref-type="bibr" rid="ref2 ref4">2, 4</xref>
        ], we adopt a dual-softmax
operation (DS) to recalculate the initially computed title-image similarities, an approach that in
some cases leads to improved performance. Lastly, we utilize a data augmentation technique
on the textual part of the data to increase the amount of available data for training and the
robustness that derives from the diversity that data augmentation introduces to the models.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Text-image association is a challenging task that has gained a lot of interest in recent years.
The task has been extensively examined in the multimedia research community e.g. see [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ],
and there is consensus that the evolution of deep learning methods has boosted performance.
Indicative relevant methods include VinVL [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], where an object detector is pre-trained to encode
images and visual objects on images and a cross-modal model is trained to associate visual and
textual features. Regarding the NewsImages 2021 participations, HCMUS [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] proposed a solution
based on the pre-trained model CLIP [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] along with sophisticated text preprocessing, which
achieved the best performance. In NewsImages 2022 the best-performing approach [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] explored
CLIP’s capabilities alongside a trainable cross-modal network; and concluded that using CLIP
was, by a small margin, better than training a custom cross-modal network. Therefore, utilizing
the power of CLIP models seems to be the most suitable approach for the task.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Approach</title>
      <sec id="sec-3-1">
        <title>3.1. Data, pre-processing and augmentation</title>
        <p>
          To adapt the CLIP model to the specific needs of the task, we explore the fine-tuning capabilities
for this model. We preprocess both training, evaluation and the oficial test textual data in order
to fully exploit our approach’s power. We gathered around 4.8 million image-title pairs from
the news domain to fine-tune the pre-trained CLIP model for training. Specifically, we utilize
the NYTimes800k [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], N24News [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and BreakingNews [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] datasets along with data publicly
available in kaggle.com from news websites including Al Jazeera1, CNN2, BBC3, HufPost News 4
and Bloomberg5 to fine-tune the model. To internally evaluate our approach, we merge last
year’s NewsImages training data [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] and use them to investigate the performance of our
approach. For each one of these datasets we utilize a data augmentation technique to double the
amount of data available. Specifically, we exploit the paraphrasing ability of the Text-to-Text
Transformer [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] to create diverse but semantically similar text titles for every image. This
approach not only enables us to have more training data but also lets us compute the image-title
similarities of the evaluation and test datasets from both the original and the generated text
titles for each image. Then, by using a mean pooling operation between the values that occur
from the computations we end up with our final predictions.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Pre-trained models</title>
        <p>
          As pre-trained cross-modal networks, we utilize two diferent implementations of the CLIP [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]
model in order to examine their performance. More specifically, we utilize the “ViT-L/14@336px”,
the largest version of the CLIP model currently available to the public by OpenAI, and as a second
variation, we utilize the “ViT-H/14” model of openCLIP [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], the open-source implementation
of CLIP. We use these models to calculate text and image feature representations. For a given
article, in order to retrieve the most relevant images from the test set, we calculate the cosine
similarity between the article’s title CLIP embedding and the embeddings of all test images, and
the top-100 most relevant images are selected in a ranked list, from the most relevant to the
least relevant image.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Fine-tuned model</title>
        <p>We also examined fine-tuning the “ViT-L/14@336px” CLIP model using the aforementioned
training datasets to improve its performance. We choose to keep the image encoder of the
model frozen and only train the text encoder’s parameters for one epoch with a batch size of 480
(performing gradient accumulation to handle GPU memory limitations). The Adam optimizer is
employed while the learning rate is set to 3e-7.
1 https://data.world/opensnippets/al-jazeera-news-dataset 2 https://data.world/opensnippets/cnn-news-dataset
3 https://data.world/opensnippets/bbc-uk-news-dataset 4 https://data.world/crawlfeeds/hufspot-news-dataset
5 https://data.world/crawlfeeds/bloomberg-quint-news-dataset</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Dual-softmax similarity revision</title>
        <p>
          At the retrieval stage, we calculate the similarities between all images from the test set and
all testing articles, resulting in a similarity matrix Z ∈ ℛ× , where  is the number of the
testing article queries and  the number of test images. Following [
          <xref ref-type="bibr" rid="ref2 ref4">2, 4</xref>
          ], to revise the calculated
similarities, we apply two cross-dimension softmax operations (one row-wise: dim = 0, and
one column-wise: dim = 0) as follows: Z* = Softmax(Z, dim = 0) ⊙ Softmax(Z, dim = 1):
where ⊙ denotes the element-wise product.
        </p>
      </sec>
      <sec id="sec-3-5">
        <title>3.5. Inference-stage scores aggregation</title>
        <p>As mentioned before, we also augment the test data’s textual part, resulting in two article-image
pairs for each original pair contained in the dataset. So, in all our runs (e.g. regardless of whether
we use a pre-trained CLIP or we fine-tune it), we end up with two article-image similarity scores.
To aggregate these scores, we experimented with diferent aggregation methods (not presented
here for brevity), and we chose to perform mean pooling to obtain our final prediction.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Submitted Runs and Results</title>
      <p>We submitted five runs for each testing dataset (GDELT-P1, GDELT-P2, RT), as detailed below:
• Run #1 (ViT-H/14_ds): This uses the text and image embeddings of the “ViT-H/14”
pretrained openCLIP model and calculates the cosine similarity between the embedding of
an article and all images. Then, the dual-softmax revision method is used to recalculate
the similarities. Finally, for each article, the 100 most relevant images are selected.
• Run #2 (ViT-L/14@336px): This uses the text and image embeddings of the
“ViTL/14@336px” pre-trained CLIP model and calculates the cosine similarity between the
embedding of an article and all images. Then for each article, the 100 most relevant
images are selected.
• Run #3 (ViT-L/14@336px_ds): Similarly to Run #2, additionally using dual softmax
revision to revise the computed similarities.
• Run #4 (ViT-L/14@336px_ft): We fine-tune the “ViT-L/14@336px” pre-trained model
using the original and the augmented data from the collected datasets.
• Run #5 (ViT-L/14@336px_ft_ds): Similarly to Run #4, additionally using dual softmax
revision to revise the computed similarities.</p>
      <p>We present the oficial results on the three testing datasets and results from the internal
experiments we conducted in order to evaluate our methods and select our final runs. Recall@K,
where  = 5, 10, 50, 100 and Mean Reciprocal Rank (MRR) are used as evaluation metrics.</p>
      <p>Table 1 (A) presents the results on the three testing datasets evaluated oficially by the task
organizers. Run #1 (ViT-H/14 + DS) performs the best on the GDELT-P2 dataset on all metrics.
Run #4 (ViT-L/14@336px_ft) and Run #5 (ViT-L/14@336px_ft_ds) perform the best in MRR
terms on GDELT-P1 and RT respectively, while in Recall@K terms the results are mixed. The
dual softmax operation is beneficial in the RT dataset but not in GDELT-P1 and GDELT-P2
while the CLIP fine-tuning (comparison between Run #2 and Run #4) is beneficial in all datasets
in the majority of the metrics but achieves the best results only in GDELT-P1.</p>
      <p>The above oficial results contrast with the findings of our internal experiments, conducted
prior to the release of the oficial results. Table 1 (B) presents our internal results on the dataset
we used for selecting our best models and examining our runs’ performance. From these
Test dataset
GDELT-P1
GDELT-P2
RT
B. Results on our internal evaluation dataset.</p>
      <p>Test dataset:</p>
      <p>NewsImages 2022 training data
preliminary experiments, we concluded that Run #5 constantly outperforms the rest of the
runs in every dataset, i.e. the use of the “ViT-L/14@336px” model, our fine-tuning and the dual
softmax revision seemed to be beneficial for performance.</p>
      <p>The contrast between our findings and the oficial results in the GDELT-P2 dataset is probably
explained by the significant amount (80%) of generated images that exist in that dataset. Our
results suggest that the “ViT-H/14” model is more capable of handling such synthetic data than
the “ViT-L/14@336px”, but the reasons for this need to be further investigated.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>In this work we proposed a solution for the MediaEval NewsImages task using state-of-the-art
text and image representations calculated from a pre-trained cross-modal network, a
finetuned cross-modal network and a similarity revision approach. We concluded from the oficial
evaluation results that for generated images the “ViT-H/14” model is more suitable for the
task while the “ViT-L/14@336px” models perform better for real images. Also, fine-tuning
pre-trained models for domain adaptation seems beneficial in most cases, while employing
diferent CLIP version can significantly afect the final performance.</p>
      <p>Acknowledgements This work was supported by the EU’s Horizon Europe and Horizon
2020 research and innovation programmes under grant agreements 101070190 AI4Trust and
101021866 CRiTERIA, respectively.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lommatzsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kille</surname>
          </string-name>
          , Ö. Özgöbek,
          <string-name>
            <given-names>M.</given-names>
            <surname>Elahi</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.-T.</surname>
          </string-name>
          Dang-Nguyen,
          <article-title>News Images in MediaEval 2023</article-title>
          , in:
          <source>Proceedings of the MediaEval Benchmarking Initiative</source>
          <year>2023</year>
          , CEUR Workshop Proceedings,
          <year>2024</year>
          . URL: http://ceur-ws.org/.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Galanopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mezaris</surname>
          </string-name>
          ,
          <article-title>Cross-modal Networks and Dual Softmax Operation for MediaEval NewsImages 2022</article-title>
          , in: Working
          <source>Notes Proceedings of the MediaEval 2022 Workshop</source>
          , volume
          <volume>3583</volume>
          , CEUR Workshop Proceedings,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hallacy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          , G. Goh,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          , et al.,
          <source>Learning Transferable Visual Models From Natural Language Supervision, in: Proc. of the 38th Int. Conf. on Machine Learning (ICML)</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Galanopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mezaris</surname>
          </string-name>
          ,
          <article-title>Are all combinations equal? Combining textual and visual features with multiple space learning for text-based video retrieval</article-title>
          ,
          <source>in: European Conference on Computer Vision Workshops (ECCVW)</source>
          , Springer,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>N.</given-names>
            <surname>Borah</surname>
          </string-name>
          , U. Baruah,
          <article-title>Image retrieval using neural networks for word image spotting-a review</article-title>
          , in: H.
          <string-name>
            <surname>K. Deva Sarma</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Piuri</surname>
            ,
            <given-names>A. K.</given-names>
          </string-name>
          Pujari (Eds.),
          <source>Machine Learning in Information and Communication Technology</source>
          , Springer Nature Singapore, Singapore,
          <year>2023</year>
          , pp.
          <fpage>243</fpage>
          -
          <lpage>268</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>K.</given-names>
            <surname>Ueki</surname>
          </string-name>
          ,
          <article-title>Survey of Visual-Semantic Embedding Methods for Zero-Shot Image Retrieval</article-title>
          ,
          <source>in: 2021 20th IEEE International Conference on Machine Learning and Applications (ICMLA)</source>
          , IEEE,
          <year>2021</year>
          , pp.
          <fpage>628</fpage>
          -
          <lpage>634</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Gao,</surname>
          </string-name>
          <article-title>VinVL: Revisiting visual representations in vision-language models</article-title>
          ,
          <source>in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>5579</fpage>
          -
          <lpage>5588</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>T.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ngô</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. D.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Huynh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. T.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tran</surname>
          </string-name>
          , HCMUS at MediaEval 2021:
          <article-title>Fine-tuning CLIP for Automatic News-Images Re-Matching</article-title>
          ,
          <source>in: Working Notes Proceedings of the MediaEval 2021 Workshop</source>
          , Online,
          <fpage>13</fpage>
          -15
          <source>December</source>
          <year>2021</year>
          , volume
          <volume>3181</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mathews</surname>
          </string-name>
          , L. Xie,
          <article-title>Transform and tell: Entity-aware news image captioning</article-title>
          ,
          <source>in: IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xiangxie</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Jie,</surname>
          </string-name>
          <article-title>N24News: A New Dataset for Multimodal News Classification</article-title>
          ,
          <source>in: Proceedings of the 13th Conference on Language Resources and Evaluation (LREC</source>
          <year>2022</year>
          ),
          <year>2022</year>
          , pp.
          <fpage>6768</fpage>
          -
          <lpage>6775</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Arnau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.-N.</given-names>
            <surname>Francesc</surname>
          </string-name>
          , M. Krystian,
          <article-title>BreakingNews: Article Annotation by Image and Text Processing</article-title>
          ,
          <source>in: IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1072</fpage>
          -
          <lpage>1085</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lommatzsch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kille</surname>
          </string-name>
          , Ö. Özgöbek,
          <string-name>
            <given-names>M.</given-names>
            <surname>Elahi</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.-T.</surname>
          </string-name>
          Dang-Nguyen,
          <article-title>News Images in MediaEval 2022</article-title>
          , in: Working
          <source>Notes Proceedings of the MediaEval 2022 Workshop</source>
          , volume
          <volume>3583</volume>
          , CEUR Workshop Proceedings,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>R.</given-names>
            <surname>Colin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Noam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Adam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Katherine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sharan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Michael</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yanqi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer</article-title>
          , in
          <source>: Journal of Machine Learning Research</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>67</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hallacy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          , G. Goh,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mishkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Krueger</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Sutskever</surname>
          </string-name>
          ,
          <article-title>Learning Transferable Visual Models From Natural Language Supervision</article-title>
          , in: ICML,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>