<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>De-Factify</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Triple-Check at Factify 2: Parameter-Eficient Large Foundation Models with Feature Representations for Multi-Modal Fact Verification</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Wei-Wei Du</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hong-Wei Wu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wei-Yao Wang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wen-Chih Peng</string-name>
          <email>wcpeng@cs.nycu.edu.tw</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, National Yang Ming Chiao Tung University</institution>
          ,
          <addr-line>Hsinchu</addr-line>
          ,
          <country country="TW">Taiwan</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Washington</institution>
          ,
          <addr-line>DC</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>2</volume>
      <issue>2</issue>
      <abstract>
        <p>Multi-modal fact verification has become an important but challenging issue on social media due to the mismatch between the text and images in the misinformation of news content, which has been addressed by considering cross-modalities to identify the veracity of the news in recent years. In this paper, we propose the Pre-CoFactv2 framework with new parameter-eficient foundation models for modeling fine-grained text and input embeddings with lightening parameters, multi-modal multi-type fusion for not only capturing relations for the same and diferent modalities but also for diferent types (i.e., claim and document), and feature representations for explicitly providing metadata for each sample. In addition, we introduce a unified ensemble method to boost model performance by adjusting the importance of each trained model with not only the weights but also the powers. Extensive experiments show that Pre-CoFactv2 outperforms Pre-CoFact by a large margin and achieved new state-of-the-art results at the Factify challenge at AAAI 2023. We further illustrate model variations to verify the relative contributions of diferent components. Our team won the first prize (F1-score: 81.82%) and we made our code publicly available1.</p>
      </abstract>
      <kwd-group>
        <kwd>Multi-modal fact verification</kwd>
        <kwd>Parameter-eficient foundation models</kwd>
        <kwd>Unified ensemble learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The rapid rise of social media technology allows people to send and receive information
immediately, and also creates fertile soil for the fast spread of fake news. The proliferation of fake news
not only triggers a storm of public opinion but also manipulates public events such as elections.
For instance, there were approximately 30 million tweets from 2.2 million users on Twitter in
the five months preceding the US 2016 presidential election, and either fake or extremely biased
news was contained in 25% of these tweets [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], misleading people and seriously influencing
the outcome of the election. Moreover, this issue became even worse during the COVID-19
pandemic period. Unconfirmed news with eye-catching images is becoming popular on social
media since richer information easily attracts more viewers than news with only text. Therefore,
in order to mitigate the negative impact caused by fake news, there is an urgent need to develop
a multi-modal fake checker that can automatically assess the validity of news.
      </p>
      <p>
        Given a claim and the support information consisting of not only text but also images, the
fact checker aims to discriminate whether the claim entails the support. Recent approaches
have demonstrated that utilizing multi-modal contexts to detect fake news achieves better
performance than only using one modality. For instance, Wang et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] learned event-invariant
features using an adversarial network along with a multi-modal feature extractor to enhance
the performance of the fake news detector. More recently, Wang and Peng [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] introduced
Pre-CoFact with DeBERTa [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and DeiT [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], to extract features from both claims and documents’
text and images, respectively and then fuses multi-modal contexts with the co-attention modules,
illustrating the competitive performance without auxiliary information.
      </p>
      <p>However, Pre-CoFact fails to finetune the pre-trained model due to the large number of
parameters, which heavily depend on the post layers to learn the contextual information.
Besides, we argue that additional textual features such as stopword and URL counts provide
definitive descriptions and relations between inputs. In addition, the co-attention modules only
capture the dependencies between modalities while ignoring the relations between diferent
types of samples (i.e., claim and document). Therefore, we believe that multi-modal fact
verification remains an unexplored but essential problem.</p>
      <p>
        To tackle this task and the aforementioned limitations, we examine our proposed method on
the real-world Factify 2 challenge [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], which is the largest multi-modal fact verification dataset
consisting of 50K news items from India and the US. Specifically, each sample contains one
document with a related image representing the reliable source of information and one claim
which also includes an associated image representing another source of information whose
validity needs to be assessed. The training set, validation set, and testing set are composed
of 35000 samples, 7500 samples, and 7500 samples, respectively. As shown in Figure 1, each
sample contains a textual claim, claim image, optical character recognition (OCR) of the claim
image, document, document image, and OCR of a document image, and is classified into support,
insuficient evidence, and refute between given claims and documents (detailed labels will be
introduced in §3.1)
      </p>
      <p>
        In this paper, we propose Pre-CoFactv2 with parameter-eficient large foundation models
with feature representations to address the challenge. We utilize large-scale pre-trained
foundation models, DeBERTa [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and Swin Transformer v2 (Swinv2) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], to extract contextualized
embeddings from both textual content and visual images, respectively, and an adapter module
is used to improve model performance by finetuning the backbone with only a few
parameters. Furthermore, additional feature metadata such as the number of stopwords and URLs in
the claim and document is generated from the input to enrich the information; this enables
the model to learn explicit information from diferent perspectives. Afterwards, we integrate
the information among several modalities with multi-modal multi-type fusion modules into
corresponding embeddings to classify the category of the news.
      </p>
      <p>To summarize, the contributions of this paper are three-fold:
• We propose parameter-eficient large foundation models with feature representations
(Pre-CoFactv2) for multi-modal fact verification by integrating adapters in the
largescale foundation models to achieve competitive performance by training only lightening
parameters, and converting additional features to learn the explicit correlations between
claim and document.
• In addition to capturing information between modalities, we design multi-modal
multitype fusions for diferent types of modalities (i.e., claim text and document images,
document text and claim images), which enforces the model to distinguish between the
given claim and document.
• To boost the detection quality, we introduce a unified ensemble method to integrate
various considerations from diverse models. This approach won first place, surpassing the
second place by 1.3% and the oficial baseline by 25.9% in terms of testing score. Moreover,
extensive experiments were conducted to examine and analyze the contribution and
efectiveness of each module.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Works</title>
      <sec id="sec-2-1">
        <title>2.1. Multi-Modal Fact Verification</title>
        <p>
          In recent years, multiple modalities (e.g., text and images) have been incorporated to demonstrate
the great potential for fact verification. MAVE [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] was proposed to learn better multi-modal
shared representations with a variational autoencoder by jointly training with a fact verification
classifier to verify the posts. In addition to learning shared features among several modalities,
Qian et al. [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] introduced HMCAN with a multi-modal contextual attention module to model
the features from multiple modalities in each news post, and a hierarchical encoding module
to capture the rich hierarchical semantics of text. Besides, Wu et al. [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] proposed MCAN to
take inter-modality relations into consideration by using multiple co-attention layers to fuse
visual and textual features extracted from Transformer-based models. Recently, Chen et al. [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]
proposed CAFE, which consists of an alignment module to transform the features from each
modality into a shared semantic space, an ambiguity module to estimate the ambiguity between
diferent modalities and a fusion module to capture the multi-modal correlations.
        </p>
        <p>Existing work focuses on the importance of learning shared representations among
multimodal information, which motivates us to use attention mechanisms to achieve the purpose.
However, pre-trained models with a base size are often used in the previous approaches, which
cannot utilize more fine-grained features compared with the large-size model. To that end, we
adopt large-size pre-trained models to efectively produce embeddings of text and images from
the complex multi-modal inputs.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Pre-Trained Model for Diferent Modalities</title>
        <p>
          Transformer [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] has become the widely-used neural network architecture in various NLP and
CV tasks due to its parallel computation and long-term considerations. Since the advent of
BERT [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], a line of large-scale Transformer-based pre-trained language models (PLMs) such as
GPT-3 [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], DeBERTa [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], PaLM [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], and BLOOM [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] have been introduced to demonstrate
the generalizability of large-scale PLMs. With the drastically increased capacity of the model,
the accuracy of various language benchmarks has been significantly improved; it was therefore
been adopted to finetune downstream tasks and has achieved better performance.
        </p>
        <p>
          In addition to the success of PLMs in NLP tasks, Transformer has also started taking over
visual benchmarks recently. Dosovitskiy et al. [17] proposed Vision Transformer (ViT) for
pretraining with image patches, which has achieved competitive results compared to state-of-the-art
convolution neural networks on ImageNet-1K image-level classification benchmarks. Swin
Transformer (Swinv1) [18] constructs hierarchical feature maps and uses the shifted window
approach for computing self-attention, making it suitable as a general-purpose backbone for
various vision tasks such as object detection and semantic segmentation. Afterwards, Swin
Transformer v2 (Swinv2) [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] was proposed with several adaptations in order to better scale up
model capacity and window resolution to mitigate the unstable training and size discrepancy
between the pre-training and training images of Swinv1.
        </p>
        <p>To use the generic knowledge of textual and visual information for fact verification, we employ
SOTA large-scale PLMs as pre-trained models instead of learning from scratch. Furthermore,
we utilize adapters in large-scale PLMs to finetune PLMs with lightening parameters while
improving model performance.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Method</title>
      <sec id="sec-3-1">
        <title>3.1. Problem Formulation</title>
        <p>by  = {  ,   |=| 1 , the goal is to classify one of the five categories:</p>
        <p>}
Given a multi-modal claim denoted by  = {  ,   }|=| 1 and a fact-checking document denoted
• Support_Text: the claim text is similar but images of the document and claim are not
similar.</p>
        <p>• Support_Multimodal: both the claim text and image are similar to that of the document.</p>
        <p>• Insuficient_Text: both text and images of the claim are neither supported nor refuted by
the document.
• Insuficient_Multimodal: the claim text is neither supported nor refuted by the document
but images are similar to the document.</p>
        <p>• Refute: The images or text from the claim and document are completely contradictory.</p>
        <p>Each sample contains a claim and a document, each of which includes the OCR feature, some
special token count (e.g., stopword, @ URL), and word and character length.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Pre-CoFactv2 Overview</title>
        <p>Figure 2 illustrates an overview of the proposed Pre-CoFactv2 framework. The additional
features are generated by the feature extractor from the given claim text, claim image, document
text, and document image. Then, we adopt two parameter-eficient foundation models for
learning in-domain knowledge from pre-trained embeddings with adapters and a multi-modal
multi-type fusion module for modeling not only cross-modality (i.e., text and image) relations
but also cross-type (i.e., claim and document) relations. Outputs of these embeddings are fused
by the verification classifier with cross-entropy loss as well as supervised contrastive loss [ 19]
to separate embeddings and find clearer boundaries.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Feature Extractor</title>
        <p>Inspired by previous works for textual information in fake checking [20, 21], textual features are
extracted from both claim and document text to enable the model to learn explicit information
from diferent perspectives. Specifically, we extract statistical features from the text, namely
sentence word length, and character length. Then, we calculate the stopword, @name, and URL
counts to indicate the style of text content. Besides, OCR text extracted from images is adopted
to get the semantics information of the image instead of pixel values only.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Parameter-Eficient Foundation Model</title>
        <sec id="sec-3-4-1">
          <title>3.4.1. Foundation Model</title>
          <p>
            Benefiting from the advancement of utilizing basic knowledge as pre-trained models, we follow
[
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] to incorporate NLP and CV foundation models as the initialized embeddings of text and
images. However, previous work failed to fully exploit the knowledge of generic datasets; we,
therefore, adopt state-of-the-art foundation models with larger sizes as the pre-trained models.
Specifically, we first use DeBERTa large [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ] as our pre-trained NLP model and Swinv2 base [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ]
as our pre-trained CV model, and then the embedding layer is used for transforming pre-trained
embeddings to embeddings in our task. Formally, the  -th output of the embedding layer is
calculated as follows:
   =  (
   =  (
     +    );    =   2(
     +    );    =   2(
   =  (
   =  (
     +    );    =  (
     +    );    =  (
 ),
 ),
 ),
 ),
where the dimensions of    ,    ,    ,    are  , the activation function  uses ReLU [22].
          </p>
        </sec>
        <sec id="sec-3-4-2">
          <title>3.4.2. Parameter-Eficient Adapter</title>
          <p>Finetuning existing foundation models requires a large number of computation resources due
to the number of parameters, but is able to learn better representations for downstream tasks
which are not trained in Pre-CoFact. To that end, we design an adapter module in the foundation
models, which enables us to finetune the backbone with only a few parameters but still achieves
better performance than the freeze parameters.</p>
          <p>We follow [23], which demonstrates the competitive performance of fine-tuning between
lightening parameters and all backbone parameters, by adding an additional adapter layer in
the output layer of Swinv2 to empower the model to capture the information of images in the
downstream tasks (fake news detection in this paper). The weights of the adapter layer are
computed as follows:
  2( ) =    (
 ) ̃ +  (
 );̃  (
 ) ̃ = (  +̃ ) +  ,
(1)
(2)
(3)
(4)
(5)
where  ̃ is the output embedding before the feed-forward layer of Swin-Transformerv2,    ( )
is the original feed-forward layer, and  ( )
the same dimension of    ( )
from the input-related weights.</p>
          <p>produces the adapted representations with</p>
          <p>We note that we cannot add adapter layers to our NLP foundation models since our GPU
memory will OOM, but we believe that this concept can improve the performance as well.</p>
        </sec>
      </sec>
      <sec id="sec-3-5">
        <title>3.5. Multi-Modal Multi-Type Fusion</title>
        <p>and the others follow a similar process:
Previous work only considered 1) images of claims and documents, 2) text of claims and
documents, 3) images of claims and text of documents, and 4) images of claims and text of claims
to produce context embeddings. However, the relations between diferent types are critical
to judge the text and images across claims and documents. Therefore, we add two additional
co-attention blocks to model correlations between 5) images of documents and text of claims,
and 6) images of documents and text of documents. The co-attention block is a variation of the
multi-head self-attention block, which takes two modalities as inputs to learn interactions and
relations. Specifically, we compute the dot products of the query and the key, divide each by
and apply a softmax function to the attention scores to obtain the weights on the values, which
indicates the relative importance of each value for a given query.</p>
        <p>We illustrate the computation of images of claims (   ) and documents (   ) as examples,
For predicting the label of the given claims and documents, all of the 12 aggregated outputs
from the multi-modal multi-type fusion, the 4 aggregated embeddings of    , 
the 32 dimensions output from the feature extractor are concatenated as the input 
  , 
  , 
  , and
of the
classifier:
 ̂ =  (( (</p>
        <p>1 ))  2 ),
  =    
  =    
  ,    =    
  ,    =    
  ,    =    
  ,   =    

   ,
 

 (</p>
        <p>,    ) =  (
  =   (
 ,
=   (   (
  +  (
  (   )</p>
        <p>√
  ,    ))
 ) +   )
)   )
sentence or image embeddings.</p>
      </sec>
      <sec id="sec-3-6">
        <title>3.6. Category Classifier</title>
        <p>
          where    ,    ,    ,    ,    ,    ∈ ℝ× , and   
method and feed-forward network as in [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
        </p>
        <p>To use fewer parameters, we share weights in a co-attention block for improving performance
because of allowing the model to learn common representations of the inputs. Finally, we apply
the mean aggregation to fuse all the results into one embedding to represent the corresponding
and   
is the same normalization
√ ,
(6)
(7)
(8)
(9)
(10)
(11)
where   1 ∈ ℝ48×  and   2 ∈ ℝ  ×5. Note that  uses ReLU which is the same as  .</p>
        <p>To enhance the generalization of our method, we jointly train supervised contrastive learning
[19] and cross-entropy. Thus, embeddings with the same label would become closer, while
embeddings with diferent labels would increase the distance. The loss function is as follows:
||
=1
 =  × −</p>
        <p>∑   ( ̂  ) + (1 − ) ×  ,
where 
0.3 for supervised contrastive loss respectively1.</p>
        <p>indicates a supervised contrastive loss. We set 0.7 for cross-entropy loss and</p>
      </sec>
      <sec id="sec-3-7">
        <title>3.7. Unified Ensemble Techniques</title>
        <p>
          To eliminate the efect of noisy data and to integrate various advantages, ensemble learning with
power weighted sum has been used to integrate the informative knowledge from diferent models
to achieve a better predictive performance of the overall model via the voting technique [
          <xref ref-type="bibr" rid="ref3">3, 24</xref>
          ].
However, we argue that using diferent powers for each model improves the generalizability
since each model does not require to use of the same projection space. Therefore, we propose
a unified ensemble method that the final predicted probabilities
 are computed with the
independent power weighted sum as:
 =  1 1 ×  1 + ⋯ +  
  ×   ,
where  is set to 3 in this work,  1, ⋯ ,   are weights of the corresponding model, and
 1, ⋯ ,   are weights of power. We tune these hyper-parameters based on the validation set
and use ensemble weights as 0.2, 0.7, and 0.6 and powers as 0.125, 0.125, and 0.25, respectively.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results and Analysis</title>
      <sec id="sec-4-1">
        <title>4.1. Implementation Details</title>
        <p>The dimension of additional features from text and image was set to 32, the embedding dimension
 of text and image were both set to 256, the inner dimension of the feed-forward layer was
512, and the number of heads was set to 12. The hidden dimension of the classifier 

was
128. The dropout rate was 0.1, and the max sequence length was 512. The batch size was 24,
the learning rates were set to 5e-5 and 1e-5, the pre-training epochs were set to 10 and the
training epochs were set to 15, and the seeds were tested with 42. The pre-trained DeBERTa was
deberta-large2, and the Swinv2 was swinv2-base-patch4-window8-2563. All of the parameters
in the two pre-trained models are first finetuned by another dataset [
25] to enhance the model
capability, and then by the Factify 2 dataset. In the feature extractor module, all images were
transformed by resizing to 256, center cropping to 256, and normalizing. On the other hand, all
text was normalized by replacing emojis in text strings using demoji 4, all the abbreviations are
1We empirically found that supervised contrastive loss is not beneficial in this task ( §4.2.1), thus the final model
sets  as 1.
(12)
(13)
Feature Extractor</p>
        <p>PLMCV
PLMNLP</p>
        <p>Adapters</p>
        <p>SupConLoss
expanded, and we delete the @name and URL to shorten the length of the text with meaningless
words. All the experiments were conducted on a machine with AMD Ryzen Threadripper 3960X
24-Core Processor, Nvidia GeForce RTX 3090, and 252GB RAM. To evaluate the performance of
the task, the weighted average F1 score was used across the 5 categories. The source code is
available at https://github.com/wwweiwei/Pre-CoFactv2-AAAI-2023.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Ablation Study</title>
        <sec id="sec-4-2-1">
          <title>4.2.1. Variations of Our Proposed Model</title>
          <p>To examine the relative contribution of our proposed module, we first conduct the ablative
experiments by removing each module as the variants of Pre-CoFactv2. Table 1 summarizes the
results of the variations on the validation set. We can observe that adopting diferent pre-trained
models (i.e., CoatNet [26] and BigBird [27]) with feature extractor (1) slightly outperforms
PreCoFact. Moreover, using a pre-trained CV model with Swinv2 with an adapter and a pre-trained
NLP model with Deberta-large (3) significantly improves the performance compared with
PreCoFact, which illustrates the importance of not only larger PLMs and finetuning them with
lightening parameters but also the multi-modal multi-type fusion. Comparing the variations
(2) with (3), additional information from the feature extractor further boosts the performance
by capturing explicit information instead of only semantic information from the embeddings.
It is worth noting that adding contrastive loss to the embeddings after fusion fails to benefit
overall performance, which suggests that calculating the contrastive loss of images and text
respectively may be more efective. Nonetheless, our proposed framework signifies the ability to
incorporate multi-modal claims and documents with explicit features and lightening parameters
to efectively classify the veracity of the news.</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>4.2.2. Variations of Our Ensemble Technique</title>
          <p>To ensure the efectiveness of our unified ensemble technique, we conducted a comprehensive
ablation study of variants of ensemble techniques by integrating all the predictions in diferent
weights and powers. (1) is the subset of (2) when all the weight is the same, (2) is the subset of</p>
          <p>Model</p>
          <p>Support Text F1 (%)
Support Multimodal F1 (%)</p>
          <p>Insuficient Text F1 (%)
Insuficient Multimodal F1 (%)</p>
          <p>Refute F1 (%)
(3) when all the power equals 1, and (3) is the subset of (4) when all the power is equal. Table 2
proves that the unified power weighted sum achieves the best result, which demonstrates that
our proposed unified ensemble method is superior to other techniques by up to 1.7%.</p>
          <p>We can observe that averaging all predictions improves the performance only slightly, while
setting diferent importance and powers boosts the performance more. Our unified ensemble
technique, in contrast, achieves the best quality compared to diferent ensemble methods. We
note however that these parameters are manually tuned, which requires more costs to achieve
better performance.</p>
        </sec>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Testing Performance</title>
        <p>The results for the testing set are shown in Table 3 in terms of the weighted F1-score. Our
approach achieved the state-of-the-art performance of 81.82% of the weighted F1-score, winning
ifrst place in the multi-modal fact-checking challenge, and outperformed the second place and
the oficial baseline by 1.3% and 25.9%, respectively. This again indicates the reasonable and
efective design of Pre-CoFactv2.</p>
        <p>To further analyze the classification details, we illustrate the confusion matrices of the
validation set as well as the testing set of Pre-CoFactv2. As shown in Figure 3, we can observe
that the class of refute is the most distinguishable category, while some of the classes between
insuficient_text and support_text misclassify each other.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>In this work, we introduce parameter-eficient large foundation models with feature
representation (Pre-CoFactv2) to mitigate the issue of disseminating multi-modal fake news. With the
integration of adapters with foundation models, we are able to finetune the backbones with
only a few parameters while achieving better performance. In addition, feature representations
provide explicit information about both text and images of claims as well as documents to clarify</p>
      <p>Support_Text (%)
Support_Multimodal (%)</p>
      <p>Insuficient_Text (%)
Insuficient_Multimodal (%)</p>
      <p>Refute (%)
Final (%)</p>
      <p>Triple-Check Baseline
the relations between them with multi-modal multi-type fusion. With the help of a unified
ensemble technique, Pre-CoFactv2 is ranked first on the oficial leaderboard with an F1 score of
0.81, which outperforms the baseline by 25.9% and greatly benefits the research of multi-modal
fact verification. Furthermore, extensive ablative experiments demonstrate the efectiveness of
each module in our proposed framework.
Major, I. Beltagy, H. Nguyen, L. Saulnier, S. Tan, P. O. Suarez, V. Sanh, H. Laurençon,
Y. Jernite, J. Launay, M. Mitchell, C. Rafel, A. Gokaslan, A. Simhi, A. Soroa, A. F. Aji,
A. Alfassy, A. Rogers, A. K. Nitzav, C. Xu, C. Mou, C. Emezue, C. Klamm, C. Leong, D. van
Strien, D. I. Adelani, et al., BLOOM: A 176b-parameter open-access multilingual language
model, CoRR abs/2211.05100 (2022).
[17] A. Dosovitskiy, L. Beyer, A. Kolesnikov, D. Weissenborn, X. Zhai, T. Unterthiner, M.
Dehghani, M. Minderer, G. Heigold, S. Gelly, J. Uszkoreit, N. Houlsby, An image is worth
16x16 words: Transformers for image recognition at scale, in: ICLR, OpenReview.net,
2021.
[18] Z. Liu, Y. Lin, Y. Cao, H. Hu, Y. Wei, Z. Zhang, S. Lin, B. Guo, Swin transformer: Hierarchical
vision transformer using shifted windows, in: ICCV, IEEE, 2021, pp. 9992–10002.
[19] B. Gunel, J. Du, A. Conneau, V. Stoyanov, Supervised contrastive learning for pre-trained
language model fine-tuning, in: ICLR, OpenReview.net, 2021.
[20] C. Castillo, M. Mendoza, B. Poblete, Information credibility on twitter, in: WWW, ACM,
2011, pp. 675–684.
[21] J. Gao, H. Hofmann, S. Oikonomou, D. Kiskovski, A. Bandhakavi, Logically at the factify
2022: Multimodal fact verification, CoRR abs/2112.09253 (2021).
[22] A. F. Agarap, Deep learning using rectified linear units (relu), CoRR abs/1803.08375 (2018).
[23] C. Fu, Z. Chen, Y. Lee, H. Lee, Adapterbias: Parameter-eficient token-dependent
representation shift for adapters in NLP tasks, in: NAACL-HLT (Findings), Association for
Computational Linguistics, 2022, pp. 2608–2621.
[24] W. Wang, Y. Tang, W. Du, W. Peng, Nycu_twd@lt-edi-acl2022: Ensemble models with
VADER and contrastive learning for detecting signs of depression from social media, in:
LT-EDI, Association for Computational Linguistics, 2022, pp. 136–139.
[25] S. Mishra, S. S, A. Bhaskar, P. Chopra, A. N. Reganti, P. Patwa, A. Das, T. Chakraborty,
A. P. Sheth, A. Ekbal, FACTIFY: A multi-modal fact verification dataset, in: Proceedings of
De-Factify: Workshop on Multimodal Fact Checking and Hate Speech Detection, volume
3199 of CEUR Workshop Proceedings, ceur, 2022.
[26] Z. Dai, H. Liu, Q. V. Le, M. Tan, Coatnet: Marrying convolution and attention for all data
sizes, in: NeurIPS, 2021, pp. 3965–3977.
[27] M. Zaheer, G. Guruganesh, K. A. Dubey, J. Ainslie, C. Alberti, S. Ontañón, P. Pham,
A. Ravula, Q. Wang, L. Yang, A. Ahmed, Big bird: Transformers for longer sequences, in:
NeurIPS, 2020.
[28] S. Suryavardan, S. Mishra, M. Chakraborty, P. Patwa, A. Rani, A. Chadha, A. Reganti,
A. Das, A. Sheth, M. Chinnakotla, A. Ekbal, S. Kumar, Findings of factify 2: multimodal
fake news detection, in: proceedings of defactify 2: second workshop on Multimodal
Fact-Checking and Hate Speech Detection, CEUR, 2023.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bovet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. A.</given-names>
            <surname>Makse</surname>
          </string-name>
          ,
          <article-title>Influence of fake news in twitter during the 2016 US presidential election</article-title>
          , CoRR abs/
          <year>1803</year>
          .08491 (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yuan</surname>
          </string-name>
          , G. Xun,
          <string-name>
            <given-names>K.</given-names>
            <surname>Jha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Gao,</surname>
          </string-name>
          <article-title>EANN: event adversarial neural networks for multi-modal fake news detection</article-title>
          , in: KDD, ACM,
          <year>2018</year>
          , pp.
          <fpage>849</fpage>
          -
          <lpage>857</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Peng</surname>
          </string-name>
          , Team yao at factify 2022:
          <article-title>Utilizing pre-trained models and co-attention networks for multi-modal fact verification (short paper)</article-title>
          , in: DE-FACTIFY@AAAI, volume
          <volume>3199</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>P.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          , W. Chen,
          <article-title>Deberta: decoding-enhanced bert with disentangled attention, in: ICLR, OpenReview</article-title>
          .net,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cord</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Douze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Massa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sablayrolles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jégou</surname>
          </string-name>
          ,
          <article-title>Training data-eficient image transformers &amp; distillation through attention</article-title>
          , in: ICML, volume
          <volume>139</volume>
          <source>of Proceedings of Machine Learning Research, PMLR</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>10347</fpage>
          -
          <lpage>10357</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Suryavardan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Patwa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chakraborty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Reganti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chadha</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. Das</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Sheth</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Chinnakotla</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ekbal</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Kumar</surname>
          </string-name>
          ,
          <article-title>Factify 2: A multimodal fake news and satire news dataset</article-title>
          ,
          <source>in: proceedings of defactify 2: second workshop on Multimodal Fact-Checking and Hate Speech Detection, CEUR</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <article-title>Swin transformer V2: scaling up capacity and resolution</article-title>
          , in: CVPR, IEEE,
          <year>2022</year>
          , pp.
          <fpage>11999</fpage>
          -
          <lpage>12009</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Khattar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Goud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Varma</surname>
          </string-name>
          ,
          <article-title>MVAE: multimodal variational autoencoder for fake news detection</article-title>
          , in: WWW, ACM,
          <year>2019</year>
          , pp.
          <fpage>2915</fpage>
          -
          <lpage>2921</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Qian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <article-title>Hierarchical multi-modal contextual attention network for fake news detection</article-title>
          , in: SIGIR, ACM,
          <year>2021</year>
          , pp.
          <fpage>153</fpage>
          -
          <lpage>162</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <article-title>Multimodal fusion with co-attention networks for fake news detection</article-title>
          ,
          <source>in: ACL/IJCNLP (Findings)</source>
          , volume ACL/
          <article-title>IJCNLP 2021 of Findings of ACL, Association for Computational Linguistics</article-title>
          ,
          <year>2021</year>
          , pp.
          <fpage>2560</fpage>
          -
          <lpage>2569</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lv</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Tun</surname>
          </string-name>
          , L. Shang,
          <article-title>Cross-modal ambiguity learning for multimodal fake news detection</article-title>
          , in: WWW, ACM,
          <year>2022</year>
          , pp.
          <fpage>2897</fpage>
          -
          <lpage>2905</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <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>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>in: NIPS</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>5998</fpage>
          -
          <lpage>6008</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          ,
          <article-title>BERT: pre-training of deep bidirectional transformers for language understanding, in: NAACL-HLT (1), Association for Computational Linguistics</article-title>
          ,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>T. B. Brown</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Mann</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ryder</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Subbiah</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Kaplan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Dhariwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Neelakantan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Shyam</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Sastry</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Askell</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Herbert-Voss</surname>
            , G. Krueger,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Henighan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Child</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Ramesh</surname>
            ,
            <given-names>D. M.</given-names>
          </string-name>
          <string-name>
            <surname>Ziegler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Winter</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Hesse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
            , E. Sigler,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Litwin</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Gray</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Chess</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Berner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>McCandlish</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Radford</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Language models are few-shot learners</article-title>
          , in: NeurIPS,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Chowdhery</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Mishra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Barham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. W.</given-names>
            <surname>Chung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Sutton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gehrmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Schuh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tsvyashchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Maynez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Barnes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Prabhakaran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Reif</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Hutchinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Pope</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bradbury</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Austin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Isard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Gur-Ari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Duke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Levskaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ghemawat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Michalewski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Garcia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Misra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Robinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fedus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ippolito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Luan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Zoph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Spiridonov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sepassi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dohan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Omernick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. S.</given-names>
            <surname>Pillai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pellat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lewkowycz</surname>
          </string-name>
          , E. Moreira,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Polozov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Saeta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Diaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Firat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Catasta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Meier-Hellstern</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Eck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Petrov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Fiedel</surname>
          </string-name>
          , Palm:
          <article-title>Scaling language modeling with pathways</article-title>
          ,
          <source>CoRR abs/2204</source>
          .02311 (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>T. L.</given-names>
            <surname>Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Akiki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Pavlick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ilic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hesslow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Castagné</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Luccioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yvon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gallé</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Rush</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Biderman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Webson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. S.</given-names>
            <surname>Ammanamanchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Sagot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Muennighof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. V.</given-names>
            <surname>del Moral</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Ruwase</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bawden</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bekman</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . McMillan-
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>