<!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>Multitask Prompt Tuning for Multimodal Human Understanding of Social Media</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bohua Peng</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chengfu Wu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wei He</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>William Thorne</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Aline Villavicencio</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yujin Wang</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Aline Paes</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Northwestern Polytechnical University</institution>
          ,
          <addr-line>Xian, 710072</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>The University of Shefield</institution>
          ,
          <addr-line>Shefield, S3 7HB</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Tsinghua University</institution>
          ,
          <addr-line>Shuangqing Road, 100084</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Universidade Federal Fluminense</institution>
          ,
          <addr-line>Niterói, RJ, 24210-346</addr-line>
          ,
          <country country="BR">Brazil</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>Large-scale pretraining and instruction tuning has facilitated visual language understanding on general purposes with broad competence. Social media processing will be highly benefit from large visual language models because messages are conveyed through joint reasoning over texts and images. Although vision-language pretraining has been widely studied, meta vision-language tuning remains underexplored. Given the ubiquity of visual content in social media, adapting pretrained Visual Language Models (VLMs) to meta social science is essential avoid extra computational expense on hyper-parameter search. This paper takes inspiration from cognitive studies to intrinsically and eficiently integrate a cross-modal reasoning into a method named FLYPE, as the runner up winner in CheckThat! 2023 task 1A. FLYPE integrates visual and text components of multiple tasks with cross-task shared prompts to guide a frozen VLM to perform as a meta classifier for unseen tasks. We evaluate our model across six social visual language understanding tasks and perform an ablation study on several modifications to the architecture. Our empirical study shows the competitive performance and training eficiency of the method. Using soft prompts can curate biased pretrained attention to focus on more task-related visual content. We release improved benchmarks with our model at https://github.com/pengbohua/Flype.</p>
      </abstract>
      <kwd-group>
        <kwd>Large visual language model</kwd>
        <kwd>parameter eficient training</kwd>
        <kwd>matrix decomposition</kwd>
        <kwd>bias analysis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Designing machine learning with multimodal perception abilities has recently gained significant
attention due to its ubiquity in various computational social science (CSS) tasks such as emotion
recognition, hate speech identification, and fact checking [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. Reasonably, many linguistic
phenomena practiced in these tasks have visual representations. Furthermore, the environments
where those tasks are more useful, such as social media, favor message conveying in textual
or visual formats. This way, identifying the correlation and contrasts between textual and
visual content to retrieve and classify relevant information is essential. For CSS tasks it is even
more challenging as it is common to disguise messages by including implicit visual elements or
exploiting linguistic phenomena such as irony and sarcasm.
      </p>
      <p>
        Although the interplay of how the brain processes images and text is an active area of
research, evidence suggests that diferent channels analyse them separately toward the final
goal and fusion happens at a later stage [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3, 4, 5</xref>
        ]. Computational methods for visual language
understanding (VLU) take them as inspiration in the following pipeline [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. First, the text
associated with the image is analysed to check for expressions related to the final task. Next or
parallel to that, the image is inspected to find task-related concepts. Finally, they are inspected
together to fuse their correlations and predict the final labels. While such a pipeline can be
instantiated with many diferent components, state-of-the-art VLU relies on transformers and
very large language models [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], which in turn require expensive hardware and a considerable
training time. This urges the development of methods that run on afordable hardware while
still achieving high predictive performance. However, while spreading fake news and hateful
messages are problematic universal behaviors, state-of-the-art multimodal transformers [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] are
hardware-hungry, making them inaccessible to a large population. This urges the development of
methods that can run on afordable hardware while still achieving high predictive performance.
      </p>
      <p>
        This paper presents FLYPE, an eficient vision-language understanding method targeting
CSS tasks. It adopts two general assumptions for eficiency: (i.) data addressed by diferent
CSS tasks hold correlated underlying patterns as spreaders of harmful content often rely on
similar visual and linguistic cues to manipulate people and deceive automatic methods, and (ii.)
prompt and prefix-based tuning has demonstrated state-of-the-art results while still requiring
less computational resources than fine-tuning entire models. FLYPE leverages both assumptions
with a novel training regime of multiple-task knowledge distillation by fusing prompts of the
two modalities and sharing prompts among diferent tasks. Moreover, as an AI-facilitated expert
system, optical character recognition (OCR) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] has been widely used for aiding understanding
of visual language content [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ]. However, a question arises whether OCR is still necessary
given that robust pretrained visual language models [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] can transliterate between images and
texts. We have refurbished six visual language understanding benchmarks with an up-to-date
OCR toolkit using Vision Transformer [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] to investigate that. Experimental results on several
tasks, including emotion recognition, ofensive comments, and automatic fact-checking, show
that FLYPE improves parameter eficiency and generalization, particularly in low-resource
settings.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related work</title>
      <p>
        Prompt &amp; Instruction Tuning. Parameter-eficient fine-tuning methods have gained traction
to address ever-increasing training times and computational requirements. One line of methods,
Prompt-Tuning [
        <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
        ], explore continuous prompts in the input space beyond the original
vocabulary. This method aims to improve both parameter and data eficiency of fine-tuning
by automatically searching for efective prompts. Instruction tuning involves fine-tuning
large language models by formulating prompts in natural language [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. This technique has
demonstrated efective enhancement in zero-shot performance of general natural language
understanding. Notably, Instruction Tuning methods often build on robust PLMs, enabling
faster convergence and yielding substantial improvements in downstream tasks. For example,
Vicuna [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] is an instruction fine-tuned version of a foundation language model, LLaMA [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
Inspired by these works, we opt to investigate parameter eficient Prompt-Tuning in cross-modal
multitask learning settings.
      </p>
      <p>
        Vision-Language Models CLIP proposes a simple yet powerful foundation model for
general visual language representation learning. The model achieves this goal with large scale
contrastive image-text alignment. This model significantly enhances the performance of
multimodal downstream tasks because the generalizable representations aligned during pretraining
can substantially improve visual content retrieval and visual grounding with its surprisingly
pleasant zero-shot predictions. Frozen [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] extends Prompt-Tuning to the cross-modal setting by
grounding a frozen large language model. Instead of learning soft text embedding, this approach
eficiently tunes the visual tokens, corresponding to the convolutional layers of the model,
presenting strong few-shot performance. Flamingo [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] proposes gated cross attention to fuse
interleaved visual and language data, allowing for superb few-shot visual language generation
which can be more aligned with real-world applications. BLIP-2 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] introduces a Q-Former,
which uses a bidrectional encoder [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] for cross-modal query tensor encoding. The approach
essentially learns soft visual tokens to bootstrap visual features from the frozen visual encoder
for visual question answering tasks. These visual tokens incorporate task information that
regularize text generation search space, mitigating the image-to-text generation loss observed
in Frozen or Flamingo. We extend the above ideas to the multitask visual language learning by
fusing task-specific prompts with high order matrix decomposition methods.
Multimodal Social Computing Multimodal social computing aims to learn the patterns of
human understanding about social media. However, some social bias, e.g., hatefulness, can be
less perceptible hidden in multiple modes of information, including texts and images. These
biased data can pose ethical threats to certain population and therefore should be curated before
training any AI models.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Method</title>
      <p>In Figure 1, we provide an overview of our cross-modal prompt tuning method, FLYPE, for
social media understanding. The method consists of two stages: a task-targeting prompt tuning
stage and a prompt fusion stage.</p>
      <p>
        Task-targeted Prompt Tuning. Inspired by [
        <xref ref-type="bibr" rid="ref1 ref21">21, 1</xref>
        ], task-targeted prompt tuning aims to
adapt a pretrained VLM to maximizing cross-modal semantic consistency of a specific CSS task.
To this end, we pass the prompts through the first few layers of the decoder to understand
entities and their relations through LLM reasoning. Then the prompt goes through a modality
connector and enter Qformer to bootstrap the most conducive visual representations from
the frozen visual backbone. Then visual tokens are compared with the last hidden state after
”answer” from the decoder by reusing cross-attention.
      </p>
      <p>Vision
Encoder</p>
      <p>Fully Connected
Fully CoCnonnencetcetdedLayer</p>
      <p>Fully
Cross-Sim</p>
      <p>Cross-Sim</p>
      <p>Cross-Sim
Q-Former</p>
      <p>MLP</p>
      <p>Decoder Layer</p>
      <p>...</p>
      <p>Decoder Layer
Decoder Layer</p>
      <p>...</p>
      <p>Decoder Layer</p>
      <p>FLYPE
check that [ocr] Cats &amp; Dogs [ocr]claimtexts answer:</p>
      <p>
        In the text channel, we organize the texts as ”(instruction, OCR and text)” to emulate the
cross-modal consistency reasoning, a cognitive process for data collection, described in [
        <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
        ].
In general, the reasoning process requires human annotators to first analyses the textual
description of the image and checks for task semantic clues. Next, they inspect the image
looking for task-oriented concepts. Finally, they connect both scrutinized components to
predict the final label.
      </p>
      <p>To emulate the process, we sequentially process the soft prompts, optical characters and text
description with the causal self-attention mechanism of a frozen text decoder. The causal mask
can enforce the self-attention to proceed from left to right, and the output probability indicates
surprisal of entailment, which will be fused into the final decision. In the image channel, we
use the same set of soft prompts but change their dimensions to bootstrap visual tokens. These
soft prompts bring task information to visual tokens, and the latter becomes input features for
classification. The process maximize a visual entailment probability, with the log-likelihood
written as follows,</p>
      <p>
        ∈ℝ×
 ′ = arg max[ log (  ∣   ,   ,   ,   )]
(1)
denote input images, OCR results, and text description, respectively.   are the labels.
where  ′ is the task-oriented prompt and   is the prompt before augmentation.   ,   , and  
Linear Prompt Fusion. Conducting independent prompt tuning for each task can be a
challenging and time-consuming process. However, [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] introduced an approach called Multitask
Prompt Tuning based on knowledge distillation for text categorization tasks. This method
incorporates task-independent components and shared prompts within its soft embedding. By
utilizing shared prompts, zero-shot learning becomes possible even for unseen tasks.
Nevertheless, when dealing with heterogeneous data in multimodal CSS tasks, the complexity of the
MPT task weights can make hyperparameter searching more dificult.
      </p>
      <p>
        To address this issue, we propose a method that leverages Higher-Order Singular Value
Decomposition (HOSVD) [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] to maximize the mutual information of task instruction through
prompt fusion. This approach allows us to reuse the computation results obtained from
tasktarget prompts, thereby minimizing additional computations while obtaining a shared prompt
and a meta classifier.
      </p>
      <sec id="sec-3-1">
        <title>As shown in Figure</title>
      </sec>
      <sec id="sec-3-2">
        <title>1, the algorithm first calculates the covariance</title>
      </sec>
      <sec id="sec-3-3">
        <title>Algorithm 1 Prompt fusion algorithm for FLYPE</title>
        <p>Helper: HOSVD - High order singular value decomposition function takes three-way arrays and
outputs singular value  ∈ ℝ  with corresponding singular vectors (,  ,  )
;
Input:  - List of unique combinations of 3 flatten prompts [(  ,   ,   ), ...];
Input:  - Error tolerance for high order singular value decomposition (HOSVD);
- The share prompt fused from task-targeted prompts;
- The codebook for task-specific prompt decoding;
 ,   ,   )
_, )
, [, ] ←  []
, [, ] ←  []
Output: 
Output: 
 ← [0]
 ← [0]</p>
        <p>, (,  ,  ) ←
for (  ,   ,   ) in  do</p>
        <p>×
_ ←  (</p>
        <p>
          HOSVD( 
for each dimension   in  do
if   &gt; []
[] ← 
[, ] ← []
then

end if
end for
end for
matrix of every three-task-combo because the maximum dimensionality is three as we write this
paper. Covariance matrix is computed on flatten prompts. For each covariance matrix, we apply
higher-order singular value decomposition. For each dimension, we take the largest singular
value (mode) and singular vectors to preserve and discard the rest. The proposed linear fusion
method is shown in Algorithm 1. The algorithm can also be considered as learning a codebook
to encode task-specific instructions as a joint instruction in a task-instruction space.
Training parameter eficiency. We analyze the theoretical training eficiency of Model
Souping [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ], task targeted prompt tuning and prompt fusion with regard to self-attention
mechanism. Model Souping is a meta fientuning method that averages  fully finetuned model
weights with k-fold cross-validation on  tasks, the complexity is ( ×  ×  2 ×  × ) , where n
is the input sequence length, d is the number of dimensions of transformer embeddings, and
m is the average number of validation samples in each held-out dataset. In the task-targeted
prompt tuning, the complexity is reduced to ( ×  ×  × ( + ) ×  × ) , where only 
prompt tokens need to be tuned. In FLYPE, the HOSVD prompt fusion has a complexity of
(( × ) 3 × ) . But since  &lt;  &lt;&lt;  , it can be considered as ( × ) . There is no need for
redundant cross-validation as the meta classifier shares hyper across all tasks. The complexity
is therefore (( ×  × ( + ) ×  + ) × ) . HOSVD has explicitly enforced mutual information
maximization across diferent social tasks. The hyper-parameter search space of the meta
classifier is also reduced because the prompt length of the meta classifier is fixed. The parameter
eficiency of prompt fusion is superior to Model Souping and task targeted prompt tuning.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Experimental Setup</title>
      <p>
        Tasks and Datasets. The statistics of the datasets used in our experiments can be found in
Table 1. Emotion Recognition on Comic Scenes (EmoRecCom) is a competition dataset
designed to tackle the task of recognising emotions based on comic panels, text in speech
balloons or captions, and onomatopoeia [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. CheckThat! 2023 subtask 1A explores whether
tweets are worth fact-checking. Each instance is an image and a tweet, used to determine
checkworthiness [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. SER30K classifies the emotion conveyed by stickers and accompanying text, if
present, used in online conversations [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]. Multimedia Automatic Misogyny Identification
(MAMI) classifies whether text-image examples are misogynistic and then further classifies
into a misogyny type [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. Here we explore the binary setting only. HatefulMemes tackles
the spread of toxic content in memes [
        <xref ref-type="bibr" rid="ref30 ref31">30, 31</xref>
        ]. Catching Out-of-Context Misinformation
using Self-Supervised Learning (COSMOS) tries to classify images that have been used out
of context to mislead a reader [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]. All the datasets we are using are benchmarks from shared
task competitions and ethical issues were already tackled there, to the best of our knowledge.
Implementation details. We select the VQA foundation model, BLIP-2 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], with ViT [38] as
the visual encoder and OPT [39] as the text encoder for CSS classfication tasks. We employ the
largest model that can fit into one RTX3090 to leverage the power of scale in prompt tuning.
To avoid overfitting, we randomly mask 20% of patches to avoid overfitting. Instead of using
the provided validation sets, we apply 10-fold cross-validation for hyperparameter search of
the current task and reuse the resulting prompts for fusion. Ideally, more folds will result in
better results because the estimated covariance matrix will also be more precise. To compute
HOSVD [40], we follows the implementation of TensorToolbox [41]. Additional experimental
details and hyper-parameters are in Appendix B.
      </p>
      <p>Results. Table 1 shows the performance of FLYPE and zero-shot FLYPE compared with baselines
including finetuned CLIP and frozen BLIP-2. Task Best Performers are winning models of each
challenge, with concrete architecture detailed in A. FLYPE tunes task-targeted prompts.
Zeroshot FLYPE fuses task-targeted prompts into a shared prompt and plug it into the frozen VLM,
testing the model with unseen data from held-out tasks. Compared with CLIP, FLYPE uses
cross-modal prompts to bootstrap image content into vision tokens with cross attention, and
then fuses them with self-attention, which can be considered as a multi-stage fusion technique.
Table 3 shows the improvement of FLYPE on training parameter eficiency. The table also shows
that the number of training parameters increases linearly with the prompt length. Compared
to fine-tuning a Q-former, FLYPE reduces the number of training parameters from 188MB
to 0.01MB, significantly reducing the memory usage without loss of precision. Lengthy soft
prompts improve the expressiveness of the model, but can lead to unexpected overfitting or
noise injection to the visual tokens. The length of soft prompt is essential for CSS tasks, where
each class sometimes only has a few hundred labeled samples, and overfitting can easily happen.</p>
      <p>To understand other components of FLYPE, we perform an ablation of a number of techniques
on the MAMI and CheckThat! datasets, as shown in Tables 4- A. The expert system, OCR, is still
helpful for solving CSS tasks with visual language foundation models. As the pretrained fusion
layers, the Q-former’s pretrained self-attentions are biased towards visual question answering,
which are curated by soft prompts tuned for CSS tasks. This is demonstrated by unnoticeable
performance drop of replacing visual tokens with noise.</p>
      <p>(a) (b) (F ) (G )
Figure 2: Comparison of layer-wise relevance propagation (LRP) saliency maps of prompts with protective
attributes. (a) and (b) analyze bias against race. (a) ”Being an Asian, Arabic fact checking texts.”; (b) ”Being a White,
the same texts.”. (c) and (d) analyze bias against species. (c) ”Being a human, hateful texts.”; (d) ”Being a dog, the
same hateful texts.”. The correct prompts surprisingly activate relevant salient facial features and optical character
features. By contrast, the biased prompts have much less salient activation, or rather sparse activation.</p>
      <p>Cross-modal Bias Figure 3 shows the saliency map for a check worthiness sample and a
hatefulness detection sample. We implement the salient feature detection with LRP[42] to the
image pixels. If certain claims can be inferred from the image, the relevant image regions will be
activated and considered for classification. The saliency maps validate our hypothesis. BLIP is
converting CSS tasks into visual entailment tasks. Figure 3 compares the false negative equality
diference of groups with protective attributes for the emotion recognition task. The adult
(b)
Old
(d)
-Models
- TSsmal
- TSbase
- TSxi
- TSxxl
- OOPPTT26..77
L.</p>
      <p>Young
-Models
- TSsmal
- TSbase
- TSxi
- TSxxl
- OPT2.7</p>
      <p>OPT6.7
---- OTTTOSSSPPxbxTTaxi26ls..77e
JU a
or.a, quE0.02
.:;
z.a, e
.a, iv
JU u
lC)q
;: E
or
LorIVag
e
e
zlC)lC)tiv 0.00
se
la-0.01
F
-0.02
(a)
Old
(c)
N</p>
      <p>N
group shows consistently lower false precision rate, which means their emotions are less likely
to be wrongly classified as positive. Words with protective attributes may intrigue cross-modal
bias when using hard prompts. By contrast, soft prompts can curate the potential bias from
pretraining tasks. The use of soft prompts can contribute to making the deployment of LLMs
safer and more ethical.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>In this paper, we investigate visual language reasoning problem and introduces FLYPE, a
crossmodal meta prompt tuning method, which eficiently enhances visual language understanding.
Our extensive experiments on six benchmark datasets demonstrate the efectiveness of this
method for unseen dataset. The eficiency-wise comparison shows the training eficiency of
this method. Through bias analysis, our work finds hard prompts can activate cross-modal bias
which can raise ethical concerns. In our future work, we aim to categorize these cross-modal
bias and address them with eficient approaches for safer deployment of large visual language
models.</p>
    </sec>
    <sec id="sec-6">
      <title>Ethical Disclaimer</title>
      <p>FLYPE, developed with various public datasets, may generate outputs that are not factually
accurate. Users should exercise caution for factual correctness. FLYPE is a research prototype,
not intended for any commercial activities. Additionally, due to ethical issues of LLMs [43], any
use of FLYPE on human cognition, psychology, and related fields is prohibited without explicit
permission from the corresponding author.
sequential fusion system for multimodal misogynous meme identification, in: Proceedings
of the 16th International Workshop on Semantic Evaluation (SemEval-2022), 2022, pp.
585–596.
[36] G. K. Kumar, K. Nanadakumar, Hate-clipper: Multimodal hateful meme classification
based on cross-modal interaction of clip features, arXiv preprint arXiv:2210.05916 (2022).
[37] T.-V. La, Q.-T. Tran, T.-P. Tran, A.-D. Tran, D.-T. Dang-Nguyen, M.-S. Dao, Multimodal
cheapfakes detection by utilizing image captioning for global context, in: Proceedings of
the 3rd ACM Workshop on Intelligent Cross-Data Analysis and Retrieval, 2022, pp. 9–16.
[38] 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: 9th International Conference
on Learning Representations, ICLR 2021, 2021.
[39] S. Zhang, S. Roller, N. Goyal, M. Artetxe, M. Chen, S. Chen, C. Dewan, M. Diab, X. Li,
X. V. Lin, et al., Opt: Open pre-trained transformer language models, arXiv preprint
arXiv:2205.01068 (2022).
[40] T. G. Kolda, B. W. Bader, Tensor decompositions and applications, SIAM review 51 (2009)
455–500.
[41] B. W. Bader, T. G. Kolda, et al., Tensor toolbox for matlab, 2023. URL: http://www.</p>
      <p>tensortoolbox.org, general software, latest release.
[42] A. Binder, G. Montavon, S. Bach, K.-R. Müller, W. Samek, Layer-wise relevance propagation
for neural networks with local renormalization layers, 2016. arXiv:1604.00825.
[43] R. Blumenthal, et al., The “leak” of meta’s ai model, https://www.blumenthal.senate.gov/
imo/media/doc/06062023metallamamodelleakletter.pdf, 2023.
[44] R. Frick, I. Vogel, Fraunhofer sit at checkthat! 2023: Mixing single-modal classifiers to
estimate the check-worthiness of multi-modal tweets, arXiv preprint arXiv:2307.00610
(2023).
[45] J. Zhang, Y. Wang, SRCB at SemEval-2022 task 5: Pretraining based image to text late
sequential fusion system for multimodal misogynous meme identification, in: Proceedings
of the 16th International Workshop on Semantic Evaluation (SemEval-2022), Association
for Computational Linguistics, Seattle, United States, 2022, pp. 585–596. URL: https://
aclanthology.org/2022.semeval-1.81. doi:10.18653/v1/2022.semeval- 1.81.
[46] I. Loshchilov, F. Hutter, Decoupled weight decay regularization, in: 7th International
Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9,
2019, OpenReview.net, 2019.
[47] A. Gotmare, N. S. Keskar, C. Xiong, R. Socher, A closer look at deep learning heuristics:</p>
      <p>Learning rate restarts, warmup and distillation, arXiv preprint arXiv:1810.13243 (2018).</p>
    </sec>
    <sec id="sec-7">
      <title>A. Explanation of Task Best Performers</title>
      <p>To provide further clarification on the model comparison, we present the Task Best Performer
for each task as follows:
• Check-worthiness (CheckThat!): [44] submitted an ensemble BERT classifier based on
Model Souping. Model Souping is a meta-learning technique that aims to provide a better
zero-shot classifier by averaging the weights of multiple independently fine-tuned models.
The averaging process requires finetuning with k-fold cross-validation on each task, and
the averaged models are further merged across tasks, leading to a meta classifier similar
to FLYPE.
• Emotion Recognition (EmoRecCom): S-NLP used ResNet as image encoder and RoBERTa
as text encoder. Both early and late level fusion are performed and combined in the
ifnal submission. In the early fusion stage, RoBERTa merges static image embedding and
learnable text embeddings with finetuning. This model, however, requires much more
training memory than prompt tuning an early stage fusion encoder, e.g., Q-former, as
used in our work.
• Cheap Fake Detection (COSMOS): Boosting Image Captioning for Global Context [37]
employs pretrained image caption models to describe images and predicts labels based on
text description and context. The method essentially leverages the semantic understanding
ability acquired through the next sentence prediction task of BERT’s pretraining. The
model further measures if two sentences are logically connected from the perspective of
fake news detection.
• Hatefulness Detection (HatefulMemes): Hate-CLIPper [36] extracted image and text
features independently with a frozen CLIP encoder. Then it computed cross-modal
correlation scores with a bilinear pooling layer, and the the outer products are used for
classification.
• Sticker Emotion Recognition (SER30K): The method used multi-stage fusion with Pyramid
Vision Transformer (PVT), which is similar to visual feature extraction of BLIP-2. The
method applied a spatial-reduction attention mechanism, where tokens are selected based
on their attention scores with the CLS token. This actually models a recursive probability
conditioned on a global latent variable.
• Gender Bias Misogyny Identification (MAMI): [ 45] finetuned late stage fusion layers on
static image and text features extracted by a CLIP encoder with domain-adversarial loss,
and used robust features to finetune a task specific classifier.</p>
    </sec>
    <sec id="sec-8">
      <title>B. Additional Implementation Details</title>
      <p>For image preprocessing, ViT randomly resized and cropped inputs to 224 × 224, and further
cropped them to 16 × 16 non-overlapping patches. We search the optimal prompt token length
from {5, 10, 20}. We use a batch size of 16, a learning rate of 1 × 10−3 for AdamW [46] with
learning rate warm-up [47]. We train FLYPE with the weighted cross-entropy loss for 5 epochs,
which empirically guarantees convergence.</p>
    </sec>
    <sec id="sec-9">
      <title>C. Visualization of Shared Prompt Performance on CSS tasks</title>
      <p>of task-targeted prompts and the orange lines are the performance of the shared prompt.
Ablation study on MAMI.</p>
      <p>Combination
soft prompts + ocr + visual tokens
ocr + visual tokens
soft prompts + visual tokens
replace image with noise
replace text with noise
replace visual tokens with noise
0.82</p>
      <p>Acc.
0.84</p>
      <p>Prec.
0.82</p>
      <p>Recall
0.82</p>
      <p>F1
0.73</p>
      <p>Acc.
0.69</p>
      <p>Test</p>
      <p>Prec.
0.65</p>
      <p>Recall
0.86</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>E.</given-names>
            <surname>Blaier</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Malkiel</surname>
          </string-name>
          , L. Wolf,
          <article-title>Caption enriched samples for improving hateful memes detection</article-title>
          ,
          <source>in: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing</source>
          , ACL,
          <year>2021</year>
          , pp.
          <fpage>9350</fpage>
          -
          <lpage>9358</lpage>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .emnlp-main.
          <volume>738</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .emnlp- main.738.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>F.</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cresci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Chakraborty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dimitrov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. D. S.</given-names>
            <surname>Martino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shaar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Firooz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</surname>
          </string-name>
          ,
          <article-title>A survey on multimodal disinformation detection</article-title>
          ,
          <source>in: Proceedings of the 29th International Conference on Computational Linguistics</source>
          ,
          <source>International Committee on Computational Linguistics</source>
          , Gyeongju, Republic of Korea,
          <year>2022</year>
          , pp.
          <fpage>6625</fpage>
          -
          <lpage>6643</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .coling-
          <volume>1</volume>
          .
          <fpage>576</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>T. C.</given-names>
            <surname>Biggs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. H.</given-names>
            <surname>Marmurek</surname>
          </string-name>
          ,
          <article-title>Picture and word naming: Is facilitation due to processing overlap?</article-title>
          ,
          <source>The American Journal of Psychology</source>
          (
          <year>1990</year>
          )
          <fpage>81</fpage>
          -
          <lpage>100</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Reed</surname>
          </string-name>
          ,
          <article-title>Cognitive architectures for multimedia learning</article-title>
          ,
          <source>Educational psychologist 41</source>
          (
          <year>2006</year>
          )
          <fpage>87</fpage>
          -
          <lpage>98</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <article-title>Dynamic cognitive processes of text-picture integration revealed by event-related potentials</article-title>
          ,
          <source>Brain Research</source>
          <volume>1726</volume>
          (
          <year>2020</year>
          )
          <fpage>146513</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Alayrac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Donahue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Luc</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Miech</surname>
          </string-name>
          , I. Barr,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hasson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lenc</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mensch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Millican</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Reynolds</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ring</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Rutherford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cabi</surname>
          </string-name>
          , T. Han,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Gong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Samangooei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Monteiro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Menick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Borgeaud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Brock</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nematzadeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sharifzadeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Binkowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Barreira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Vinyals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zisserman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Simonyan</surname>
          </string-name>
          ,
          <article-title>Flamingo: a visual language model for few-shot learning</article-title>
          ,
          <source>in: NeurIPS</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Savarese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hoi</surname>
          </string-name>
          ,
          <article-title>Blip-2: Bootstrapping language-image pre-training with frozen image encoders and large language models</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2301</volume>
          .
          <fpage>12597</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Batra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Parikh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Vilbert: Pretraining task-agnostic visiolinguistic representations for vision-and-language tasks</article-title>
          , in: H.
          <string-name>
            <surname>Wallach</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Larochelle</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Beygelzimer</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <article-title>d'Alché-</article-title>
          <string-name>
            <surname>Buc</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Fox</surname>
          </string-name>
          , R. Garnett (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>32</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2019</year>
          . URL: https://proceedings.neurips.cc/ paper_files/paper/2019/file/c74d97b01eae257e44aa9d5bade97baf-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>C.</given-names>
            <surname>Amrhein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Clematide</surname>
          </string-name>
          ,
          <article-title>Supervised ocr error detection and correction using statistical and neural machine translation methods</article-title>
          ,
          <source>J. Lang. Technol. Comput. Linguistics</source>
          <volume>33</volume>
          (
          <year>2018</year>
          )
          <fpage>49</fpage>
          -
          <lpage>76</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Afli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Qui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Way</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sheridan</surname>
          </string-name>
          ,
          <article-title>Using smt for ocr error correction of historical texts (</article-title>
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Azadbakht</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. R.</given-names>
            <surname>Kheradpisheh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Farahani</surname>
          </string-name>
          ,
          <article-title>Multipath vit ocr: A lightweight visual transformer-based license plate optical character recognition</article-title>
          ,
          <source>2022 12th International Conference on Computer and Knowledge Engineering (ICCKE)</source>
          (
          <year>2022</year>
          )
          <fpage>092</fpage>
          -
          <lpage>095</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <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>
          ,
          <source>in: International Conference on Machine Learning</source>
          ,
          <year>2021</year>
          . URL: https://api.semanticscholar.org/CorpusID:231591445.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Dosovitskiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Beyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kolesnikov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Weissenborn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Unterthiner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dehghani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Minderer</surname>
          </string-name>
          , G. Heigold,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gelly</surname>
          </string-name>
          , et al.,
          <article-title>An image is worth 16x16 words: Transformers for image recognition at scale</article-title>
          , arXiv preprint arXiv:
          <year>2010</year>
          .
          <volume>11929</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Qian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          , Gpt understands, too, arXiv:
          <fpage>2103</fpage>
          .10385 (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>W. L.</given-names>
            <surname>Tam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Xue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Dong</surname>
          </string-name>
          , J. Liu,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <article-title>Parametereficient prompt tuning makes generalized and calibrated neural text retrievers</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2207</volume>
          .
          <fpage>07087</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bosma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. Y.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Guu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. W.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Lester</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q. V.</given-names>
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <surname>FINETUNED LANGUAGE MODELS ARE ZERO-SHOT</surname>
            <given-names>LEARNERS</given-names>
          </string-name>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zheng</surname>
          </string-name>
          , W.-L. Chiang,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. P.</given-names>
            <surname>Xing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. E.</given-names>
            <surname>Gonzalez</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Stoica</surname>
          </string-name>
          ,
          <article-title>Judging llm-as-a-judge with mt-bench and chatbot arena</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2306</volume>
          .
          <fpage>05685</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>H.</given-names>
            <surname>Touvron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lavril</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Izacard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Martinet</surname>
          </string-name>
          , M.
          <article-title>-</article-title>
          <string-name>
            <surname>A. Lachaux</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Lacroix</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Rozière</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Goyal</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Hambro</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Azhar</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rodriguez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Joulin</surname>
            , E. Grave, G. Lample, LLaMA: Open and
            <given-names>Eficient</given-names>
          </string-name>
          <string-name>
            <surname>Foundation Language Models</surname>
          </string-name>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2302</volume>
          .
          <fpage>13971</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Tsimpoukelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Menick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cabi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M. A.</given-names>
            <surname>Eslami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Vinyals</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Hill</surname>
          </string-name>
          ,
          <article-title>Multimodal few-shot learning with frozen language models</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems</source>
          <year>2021</year>
          , NeurIPS
          <year>2021</year>
          ,
          <year>2021</year>
          , pp.
          <fpage>200</fpage>
          -
          <lpage>212</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <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</article-title>
          ,
          <source>in: Proc. of the</source>
          <year>2019</year>
          <article-title>Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</article-title>
          , NAACL-HLT
          <year>2019</year>
          , ACL,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>E.</given-names>
            <surname>Müller-Budack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Theiner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Diering</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Idahl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ewerth</surname>
          </string-name>
          ,
          <article-title>Multimodal analytics for real-world news using measures of cross-modal entity consistency</article-title>
          ,
          <source>in: Proceedings of the 2020 International Conference on Multimedia Retrieval</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>16</fpage>
          -
          <lpage>25</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>N.-V.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.-S.</given-names>
            <surname>Vu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rigaud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jiang</surname>
          </string-name>
          , J.-C. Burie,
          <article-title>Icdar 2021 competition on multimodal emotion recognition on comics scenes</article-title>
          , in: J.
          <string-name>
            <surname>Lladós</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Lopresti</surname>
          </string-name>
          , S. Uchida (Eds.),
          <source>Document Analysis and Recognition - ICDAR 2021</source>
          , Springer International Publishing, Cham,
          <year>2021</year>
          , pp.
          <fpage>767</fpage>
          -
          <lpage>782</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>G. S.</given-names>
            <surname>Cheema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hakimov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sittar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Müller-Budack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Otto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ewerth</surname>
          </string-name>
          ,
          <article-title>MM-claims: A dataset for multimodal claim detection in social media, in: Findings of the Association for Computational Linguistics: NAACL 2022, Association for Computational Linguistics</article-title>
          , Seattle, United States,
          <year>2022</year>
          , pp.
          <fpage>962</fpage>
          -
          <lpage>979</lpage>
          . URL: https://aclanthology.org/
          <year>2022</year>
          .findings-naacl.
          <volume>72</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2022</year>
          .findings- naacl.72.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Panda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Karlinsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Feris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <article-title>Multitask prompt tuning enables parameter-eficient transfer learning</article-title>
          ,
          <source>arXiv preprint arXiv:2303.02861</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>L. R.</given-names>
            <surname>Tucker</surname>
          </string-name>
          ,
          <source>Some mathematical notes on three-mode factor analysis, Psychometrika</source>
          <volume>31</volume>
          (
          <year>1966</year>
          )
          <fpage>279</fpage>
          -
          <lpage>311</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>M.</given-names>
            <surname>Wortsman</surname>
          </string-name>
          , G. Ilharco,
          <string-name>
            <given-names>S. Y.</given-names>
            <surname>Gadre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Roelofs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Gontijo-Lopes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Morcos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Namkoong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Farhadi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Carmon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kornblith</surname>
          </string-name>
          , et al.,
          <article-title>Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference time</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>23965</fpage>
          -
          <lpage>23998</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A.</given-names>
            <surname>Barrón-Cedeño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Caselli</surname>
          </string-name>
          , G. Da San Martino, T. Elsayed,
          <string-name>
            <given-names>A.</given-names>
            <surname>Galassi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Haouari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ruggeri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Struss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. N.</given-names>
            <surname>Nandi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. S.</given-names>
            <surname>Cheema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Azizov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nakov</surname>
          </string-name>
          ,
          <article-title>The clef-2023 checkthat! lab: Checkworthiness, subjectivity, political bias, factuality, and authority</article-title>
          , in: J.
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Crestani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Maistro</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Joho</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Gurrin</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          <string-name>
            <surname>Kruschwitz</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Caputo (Eds.),
          <source>Advances in Information Retrieval</source>
          , Springer Nature Switzerland, Cham,
          <year>2023</year>
          , pp.
          <fpage>506</fpage>
          -
          <lpage>517</lpage>
          . URL: https://checkthat.gitlab.io/clef2023/task1/.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>S.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , J. Yang,
          <article-title>Ser30k: A large-scale dataset for sticker emotion recognition</article-title>
          ,
          <source>in: Proceedings of the 30th ACM International Conference on Multimedia, MM '22</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2022</year>
          , p.
          <fpage>33</fpage>
          -
          <lpage>41</lpage>
          . URL: https://doi.org/10. 1145/3503161.3548407. doi:
          <volume>10</volume>
          .1145/3503161.3548407.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>E.</given-names>
            <surname>Fersini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gasparini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Rizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Saibene</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lees</surname>
          </string-name>
          , J. Sorensen, SemEval
          <article-title>-2022 task 5: Multimedia automatic misogyny identification</article-title>
          ,
          <source>in: Proceedings of the 16th International Workshop on Semantic Evaluation (SemEval-2022)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Seattle, United States,
          <year>2022</year>
          , pp.
          <fpage>533</fpage>
          -
          <lpage>549</lpage>
          . URL: https:// competitions.codalab.org/competitions/34175#learn_the_details. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2022</year>
          . semeval-
          <volume>1</volume>
          .
          <fpage>74</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kiela</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Firooz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Goswami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ringshia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Testuggine</surname>
          </string-name>
          ,
          <article-title>The hateful memes challenge: Detecting hate speech in multimodal memes</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems</source>
          <year>2020</year>
          , NeurIPS
          <year>2020</year>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kiela</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Firooz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Goswami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. A.</given-names>
            <surname>Fitzpatrick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bull</surname>
          </string-name>
          , G. Lipstein,
          <string-name>
            <given-names>T.</given-names>
            <surname>Nelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Muennighof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Velioglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Rose</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Lippe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Holla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chandra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rajamanickam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Antoniou</surname>
          </string-name>
          , E. Shutova,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yannakoudakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sandulescu</surname>
          </string-name>
          , U. Ozertem,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pantel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Specia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Parikh</surname>
          </string-name>
          ,
          <article-title>The hateful memes challenge: Competition report</article-title>
          , in: H.
          <string-name>
            <surname>J. Escalante</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          Hofmann (Eds.),
          <source>Proceedings of the NeurIPS 2020 Competition and Demonstration Track</source>
          , volume
          <volume>133</volume>
          <source>of Proceedings of Machine Learning Research, PMLR</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>344</fpage>
          -
          <lpage>360</lpage>
          . URL: https://proceedings.mlr.press/v133/kiela21a.html.
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>S.</given-names>
            <surname>Aneja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bregler</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Nießner, COSMOS: Catching Out-of-Context Misinformation with Self-Supervised Learning</article-title>
          , in: ArXiv preprint arXiv:
          <volume>2101</volume>
          .06278,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>N.-V.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.-S.</given-names>
            <surname>Vu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rigaud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jiang</surname>
          </string-name>
          , J.-C. Burie,
          <article-title>Icdar 2021 competition on multimodal emotion recognition on comics scenes</article-title>
          ,
          <source>in: International Conference on Document Analysis and Recognition</source>
          , Springer,
          <year>2021</year>
          , pp.
          <fpage>767</fpage>
          -
          <lpage>782</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>F.</given-names>
            <surname>Alam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Barrón-Cedeño</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. S.</given-names>
            <surname>Cheema</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hakimov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hasanain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Míguez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Mubarak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. K.</given-names>
            <surname>Shahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zaghouani</surname>
          </string-name>
          , et al.,
          <article-title>Overview of the clef-2023 checkthat! lab task 1 on check-worthiness in multimodal and multigenre content</article-title>
          , Working Notes of CLEF (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          , Srcb at semeval-
          <source>2022 task 5: Pretraining based image to text late 0.84 0.79 0.81 0.77 0.79 0.85 0.81 0.83 0.78 0.78 0.82 0.77 0.79 0.71 0.68 0.84 0.82 0.84 0.84 0.93 0.75 0.74 0.74 0.64 0.72 0.71 0.69 0.69 0.59 0.63 0.66 0.64 0.63 0.57 0.58 0.91 0.88 0.89 0.74 0</source>
          .
          <fpage>94</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>