<!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>Conference and Labs of the Evaluation Forum, September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Reshape or Update? Metric Learning and Fine-tuning for Low-Resource Influencer Profiling</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Roberto Labadie Tamayo</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Areg Mikael Sarvazyan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Author Profiling, Metric Learning, Fine-tuning, Few-shot,</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Symanto</institution>
          ,
          <country country="ES">Spain</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universitat Politècnica de València</institution>
          ,
          <addr-line>València</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>1</volume>
      <fpage>8</fpage>
      <lpage>21</lpage>
      <abstract>
        <p>In these working notes, we present our contributions to the “Profiling Cryptocurrency Influencers with Few-shot Learning” shared task at PAN 2023 under the team name pan23-dogecoin, where we participated in all three subtasks. We focused on leveraging Metric Learning and Parameter-Eficient Fine-Tuning of Transformer-based models. We conducted extensive hyper-parameter search for both techniques, resulting in early-bird results of a tri-encoder model with 0.508 of macro-f1 for our best-performing system for subtask 1, and an application of PEFT techniques to Transformer-based language models which obtained 0.517, and 0.526 of macro-f1 for subtasks 2 and 3 respectively. We observed that our proposed metric learning-based system exhibited enhanced generalization capabilities with respect to the fine-tuning of Transformer-based models. Notably, despite the larger parameter size of some Transformer-based models, we obtained robust performance by utilizing smaller models pre-trained on domain-specific knowledge.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Social media has become a fundamental part of our day-to-day lives. Through these services,
millions of users connect and discuss various topics. Over the last decade, there has been an
increasing interest in cryptocurrencies, providing the frame for the emergence of new digital
communities sharing information. Consequently, understanding the behavior of these
communities has become crucial for individuals invested in cryptocurrencies who wish to understand
market trends, identify influential figures, and predict the success of new cryptocurrencies.</p>
      <p>
        Numerous studies have explored the relationship between social media and the
cryptocurrency ecosystem, highlighting the profound impact that online communities can have on the
market [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. These studies have shown that influential figures, such as well-known
cryptocurrency analysts, traders, and enthusiasts, can significantly influence the sentiment and adoption
of specific cryptocurrencies through their social media activities. Positive or negative opinions
expressed by these individuals can sway public perception, impacting the value and market
demand for diferent digital assets.
      </p>
      <p>Furthermore, social media platforms serve as a vital source of information for individuals
seeking to stay informed about the latest news, developments, and trends within the
cryptocurrency space. Hashtags, dedicated forums, and communities surrounding cryptocurrencies on
platforms such as Twitter provide a space for discussions, news dissemination, and the sharing
of insights among community members.</p>
      <p>
        All above form the basis of the shared task “Profiling Cryptocurrency Influencers with
Fewshot Learning” [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] at PAN 2023 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], where the primary objective is to profile Twitter users to
determine their impact on cryptocurrency communities.
      </p>
      <p>These working notes describe our participation in the shared task. More specifically, in
Section 2 we review previous studies related to author profiling and few-shot learning before
delving deeper into the tasks. In Section 3, we describe the subtasks and datasets provided by
the organizers. Afterward, in Section 4 we introduce our approaches to tackle the challenge,
and in Section 5 we describe our experimental setup and the achieved results. Finally, we draw
some conclusions and present future lines of research in Section 6.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        When profiling users through semantic and stylometric features extracted from their textual
constructions on a social media platform such as Twitter, one must consider that single message
information is usually not enough for accurate profiling. Aggregating and contrasting this
information from Twitter feeds is a matter explored along several shared tasks at PAN. These
tasks have involved analyzing demographic characteristics of social media users [
        <xref ref-type="bibr" rid="ref5 ref6 ref7 ref8">5, 6, 7, 8</xref>
        ],
such as gender, language variety, age, etc.
      </p>
      <p>
        In recent years more complex tasks aiming at identifying personal traits and psychosocial
behavior of users have been explored, ranging from profiling fake news [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and hate speech [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
spreaders, to users using irony to target social groups according to stereotypical categorizations
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>
        In the past, most proposed works applied traditional machine learning techniques to profile
authors, relying mainly upon Support Vector Machines [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ], Logistic Regression [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] and
Random Forest [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] over representations of the profiles as Bag of Words, n-grams and their
term-frequency based vector representation combined with linguistic features.
      </p>
      <p>
        However, given further developments in neural models and their ability to extract a more
adequate vector representation of text, many works also introduced neural techniques to both
model the set of tweets into a profile representation, and classify these profiles. These works, in
many cases, did not exclude the use of linguistic features to combine them with architectures
like Long Short Term Memory neural networks [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ], Convolutional Neural Networks [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ],
and Transformer-based models [
        <xref ref-type="bibr" rid="ref19 ref20 ref21">19, 20, 21</xref>
        ].
      </p>
      <p>
        In this year’s edition of PAN, the complex task of handling psychosocial aspects of subjects is
studied in a low-resource scenario, where the amount of information about users belonging
to each class is very limited. The latter makes the challenge of profiling users a few-shot task.
The field of few-shot learning has gained significant attention as a promising approach for
addressing the challenge of limited data availability. Few-shot learning aims to develop models
that can learn from only a few examples per class, mimicking the human ability to generalize and
recognize new concepts with limited exposure. One notable advancement in few-shot learning
is the introduction of Large Language Models (LLMs), such as OpenAI’s GPT-3 [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. These
models have been leveraged to tackle various natural language processing (NLP) tasks unseen
at training time, including text classification, sentiment analysis, and language generation, by
using strategies such as in-context learning [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].
      </p>
      <p>
        Nevertheless, to obtain competitive results, these few-shot techniques require models with
considerably large context lengths and usually perform better as they are scaled to larger
number of learned parameters. Hence, appealing to models whose training relies on prior
knowledge about the similarity between the instances of the corpus, such as Bi-Encoder [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]
and Tri-Encoder networks [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ], constitute a viable solution for many low resources tasks in
terms of computational resources and performance [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], especially for author profiling tasks
[
        <xref ref-type="bibr" rid="ref27">27</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Data</title>
      <p>
        We participate in the three subtasks proposed in the “Profiling Cryptocurrency Influencers with
Few-shot Learning” shared task: (i) low-resource influencer profiling, (ii) low-resource influencer
interest identification, and (iii) low-resource influencer intent identification. We only employ
the data provided by the task organizers [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], whose statistics are presented in Table 1. Here we
clearly observe that subtask 1 corresponds to the regular schema of a profiling task, whereas
the remaining two subtasks can also be framed as text classification tasks instead of author
profiling ones, given that for each author, we only have a single tweet instance.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Submitted Systems</title>
      <p>The systems described in these working notes rely on the use of Large Language Models (LLMs),
using them in two diferent approaches: (i) as text encoders to find relationships in a
highdimensional embedding space and (ii) as backbones to be fine-tuned for the three downstream
subtasks. We frame the first subtask as an author profiling task, treating the remaining ones as
classification tasks. To this end, we acquire textual definitions of the target classes to characterize
a type of author profile attending to the scale in which their tweets influence the cryptocurrency
community (see in Appendix A). We leverage the definitions for each category independently
of the actual task of profiling, taking into account the behavior of a Twitter user 1. While these
definitions do not reflect the writing style or content of a tweet, we appealed to the capability of
LLMs to determine useful relationships from these descriptions such that they can discriminate
between classes in a zero-shot setting.</p>
      <sec id="sec-4-1">
        <title>4.1. Metric Learning</title>
        <p>
          According to previous works on author profiling and few-shot learning [
          <xref ref-type="bibr" rid="ref26 ref29 ref30">29, 26, 30</xref>
          ], our first
approach consisted in experimenting with various configurations of bi-encoder and tri-encoder
networks.
        </p>
        <p>
          For this, we opted for a pre-trained Transformer-based [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ] language model as a backbone
to obtain profile-level embeddings, and learning a transformation in a latent space. Here, we
optimize such that samples from the same class are closer together2, whereas samples from
diferent classes are farther apart. Finally, an instance of a user profile is classified into the class
of its closest prototype, i.e., an instance from the training set or user definition.
        </p>
        <p>In the contrastive training of this metric learning approach, we explored both a bi-encoder
strategy and a triplet-based approach. A user’s profile, [AUTHOR-PROFILE], was constructed
by concatenating their tweets with the a newly introduced [SEP-TWEET] token, embedding
the resulting text as follows:</p>
        <p>Represent the cryptocurrency Tweet posts for profiling their authors into the classes nano
micro macro mega non-influencer; Input: [AUTHOR-PROFILE]</p>
        <p>We also took into account the definitions, [USER-DEFINITION], mentioned in Section 4 as
elements of our metric space when building the pairs (or triplets) for training. These definitions
were considered as instances belonging to their corresponding class. To obtain the embeddings
of definitions, we used the following prompting scheme:</p>
        <p>Represent the cryptocurrency influencers definition for comparing it with the representation
of their tweets; Input: [USER-DEFINITION]</p>
        <p>Finally, we introduced an online computation of the training pairs and triplets by recomputing
them after a fixed number of epochs to stress the learned transformation function towards
higher inter-class sparsity. For contrastive pairs we approach the construction of negative
examples under a hard criterion by selecting pairs of elements from diferent classes that are
closer in the newly-learned embedding space. Similarly for triplets, given an anchor example,
we select five random examples from its own class as positive points, and get the five closest
examples from the complementary classes as negatives, also ensuring a balanced distribution.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Fine-tuning</title>
        <p>
          In addition to the metric learning strategy described in Section 4.1, we explored a
straightforward classification approach by fine-tuning a language model for each subtask. For this, we
adapt a pre-trained Transformer-based text encoder to each subtask using the state-of-the-art
parameter-eficient fine-tuning technique LoRA [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ]. This simpler approach allows us to avoid
1Extracted and modified from https://greenhousemag.com/
2Using the squared euclidean distance.
the construction of contrastive examples, which can introduce some undesired bias into the
learning process even when we compute the triplets and pairs dynamically. Nevertheless, this
kind of language model is limited when dealing with long context sequences, forcing us to
truncate the user profile to 512 tokens. This means that most profile sequences will be truncated,
as can be seen in Figure 1.
        </p>
        <p>0.0006
0.0005</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Experiments and Results</title>
      <p>To evaluate the performance of our models in the development process, we employed a 4-fold
cross-validation strategy while preserving class balance. No text pre-processing was carried
out for any approach because we were looking for an end-to-end methodology that avoids
conditioning the learning process of the models on hand-crafted heuristics. Following the task
organizers’ decision, we report mean macro-f1 between the validation results in each fold, as
well as the macro-f1 of the private test set in our early-bird submissions.</p>
      <sec id="sec-5-1">
        <title>5.1. Metric Learning</title>
        <p>
          The bi-encoder approach was only used for the first subtask. This subtask was the only one
among all the three where a simple transformer-based sentence encoder described in Section 4.2
was unable to handle the complete profile sequences, which we address by the use of
InstructOR [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ] as the profile encoder. However, given its maximum context length of 2048, truncation
was still necessary.
        </p>
        <p>
          The profile encoder was kept frozen; only the transformation layer was learned using Adam
[
          <xref ref-type="bibr" rid="ref34">34</xref>
          ] with learning rates ranging from 1e-4 to 1e-1. The dimension of this latent space and the
frequency of pair or triplet recalculation was studied, in addition to whether the definitions as
prototypes should be included to train the network and classify new samples. To accomplish
this tuning process, we relied on Bayesian optimization as implemented in Optuna [
          <xref ref-type="bibr" rid="ref35">35</xref>
          ].
        </p>
        <p>
          During the training, we used two loss functions, contrastive [
          <xref ref-type="bibr" rid="ref36">36</xref>
          ] or triplet loss [
          <xref ref-type="bibr" rid="ref37">37</xref>
          ] for
bi-encoder and triplet-based strategies, respectively. In Table 2 we present the results of the
best combination involving both perspectives under an online example construction schema,
which involved updating the training examples after every five epochs.
        </p>
        <p>From this table, we observe how introducing the definitions from Section 4 improves the
results obtained by both pairs and triplet-based systems. Additionally, providing positive and
negative pairs, i.e., using triplet loss, results in considerable improvements in our metric learning
approach.</p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Fine-tuning</title>
        <p>When fine-tuning language models, we compared their performance by also taking into account
the size of the models due to hardware restrictions in the submission platform. For those models
which allow it, we studied whether employing low-rank adapters outperforms conventional
ifne-tuning.</p>
        <p>
          In all the cases, the tuned parameters were optimized with RMSprop [
          <xref ref-type="bibr" rid="ref38">38</xref>
          ]. Particularly when
applying conventional fine-tuning of the whole network, we apply an increasing learning rate
from shallower layers to deeper ones [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ], starting from 1e-5 and increasing it on each layer
with a factor of 0.1 units.
        </p>
        <p>
          We experimented with full fine-tuning and LoRA as implemented in the HuggingFace
ecosystem [
          <xref ref-type="bibr" rid="ref40">40</xref>
          ] for three language models: CryptoBERT3, and two BLOOM [
          <xref ref-type="bibr" rid="ref41">41</xref>
          ] models, BLOOM-1b14
and BLOOM-7b15. Table 3 shows the evaluation results after fine-tuning these models.
3tinyurl.com/cryptobert
4tinyurl.com/bloom-1b1
5tinyurl.com/bloom-7b1
with full fine-tuning. We hypothesize that given the number of examples in this low-resource
dataset, catastrophic forgetting of learned information in the pre-training phase [
          <xref ref-type="bibr" rid="ref42">42</xref>
          ] may
become more critical given the bias imposed towards such a small training set.
        </p>
        <p>Additionally, while BLOOM models exhibit many more parameters than CryptoBERT, given
the domain in which the latter has been pretrained and finetuned, this model achieves better
performance in two of the three tasks. Finally, we note that for subtask 1 all fine-tuned models
outperform our metric learning approach.</p>
      </sec>
      <sec id="sec-5-3">
        <title>5.3. Oficial Results</title>
        <p>Regarding the oficial submissions to the “Profiling Cryptocurrency Influencers with Few-shot
Learning” task in early-bird stages, we performed a majority vote for the models obtained by
ifnetuning each fold from the cross-validation process. In this way, we submitted one run for
subtask 1 involving the use of the best triplet-based model, obtaining a macro-f1 of 0.508 in the
test set. We also submitted runs using CryptoBERT-LoRA obtaining 0.465, 0.517 and 0.526 of
macro-f1 for subtasks 1, 2 and 3 respectively.</p>
        <p>Interestingly, in contrast with the results from our cross-validation scheme, the tri-encoder
system obtains more robust results for subtask 1, which is aligned with our hypothesis related
to its capacity of processing long prolfie sequences. In addition to this, we believe the fact that
it only learns a transformation of the representation space, where objects from diferent classes
are distant, and that the constructed training examples grow in cubic orders, making tri-encoder
more robust and generalizable than fine-tuned language models. We find this is an important
lesson: a robust cross-validation scheme should be one of the topmost priorities, especially
when participating in competitions with private test sets.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>In these working notes, we describe our submissions to the “Profiling Cryptocurrency Influencers
with Few-shot Learning” shared task at PAN 2023. We participated in all three subtasks,
experimenting with bi-encoders and PEFT of transformer-based models. Our best-performing
systems achieved macro-F1 measurements of 0.508, 0.517, and 0.526 for tasks 1, 2, and 3 in the
early-bird stages, respectively, based on the oficial test set. From our study, we observed that
the proposed metric learning-based system demonstrated superior generalization capabilities
with respect to fine-tuned language models. Additionally, despite the large parameter size of
some Transformer-based models, we obtained more robust performance by employing models
pre-trained on knowledge aligned with the specific task domain.</p>
      <p>While the primary focus of this task was to evaluate machine learning models’ ability to
learn in low-resource scenarios, for future work, we intend to investigate how augmenting the
training examples using methods such as back-translation impacts the systems’ generalization
capabilities. Furthermore, considering the decent results achieved by transformer-based models,
we plan to gather a more informative characterization of the classes in terms of writing style
and content. This characterization will help us select the elements that belong to the final profile
sequence by contrasting them with these defined characteristics. Subsequently, a condensed
and reduced version of the profile will be fed into the discriminative models.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This work has been partially developed with the support of valgrAI - Valencian Graduate School
and Research Network of Artificial Intelligence and the Generalitat Valenciana, and co-funded
by the European Union.
In Table 4 we present the definitions of the target classes for subtask 1 used in our metric
learning approach. These definitions intend to capture information of types of Twitter accounts
attending to the scale of their impact in social media.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>H.</given-names>
            <surname>Omar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Lasrado</surname>
          </string-name>
          ,
          <article-title>Uncover social media interactions on cryptocurrencies using social set analysis (ssa</article-title>
          ),
          <source>Procedia Computer Science</source>
          <volume>219</volume>
          (
          <year>2023</year>
          ). doi:https://doi.org/10. 1016/j.procs.
          <year>2023</year>
          .
          <volume>01</volume>
          .277, cENTERIS - International Conference on ENTERprise Information Systems / ProjMAN - International Conference on Project MANagement / HCist - International
          <source>Conference on Health and Social Care Information Systems and Technologies</source>
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ortu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vacca</surname>
          </string-name>
          , G. Destefanis,
          <string-name>
            <given-names>C.</given-names>
            <surname>Conversano</surname>
          </string-name>
          ,
          <article-title>Cryptocurrency ecosystems and social media environments: An empirical analysis through hawkes' models and natural language processing</article-title>
          ,
          <source>Machine Learning with Applications</source>
          <volume>7</volume>
          (
          <year>2022</year>
          ). doi:https://doi.org/10. 1016/j.mlwa.
          <year>2021</year>
          .
          <volume>100229</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Chinea-Rios</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Borrego-Obrador</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Franco-Salvador</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <article-title>Profiling Cryptocurrency Influencers with Few shot Learning at PAN 2023, in: CLEF 2022 Labs and Workshops</article-title>
          , Notebook Papers,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bevendorf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Borrego-Obrador</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chinea-Ríos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Franco-Salvador</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Heini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kredens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mayerl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pęzik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Stamatatos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wiegmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wolska</surname>
          </string-name>
          , , E. Zangerle, Overview of PAN 2023:
          <article-title>Authorship Verification, Multi-Author Writing Style Analysis, Profiling Cryptocurrency Influencers, and Trigger Detection</article-title>
          , in: A.
          <string-name>
            <surname>Arampatzis</surname>
            , E. Kanoulas,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Tsikrika</surname>
            ,
            <given-names>A. G.</given-names>
          </string-name>
          <string-name>
            <surname>Stefanos Vrochidis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Aliannejadi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Vlachos</surname>
          </string-name>
          , G. Faggioli, N. Ferro (Eds.),
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction. Proceedings of the Fourteenth International Conference of the CLEF Association (CLEF</source>
          <year>2023</year>
          ), Lecture Notes in Computer Science, Springer,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Verhoeven</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Daelemans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <source>Overview of the 4th Author Profiling Task at PAN</source>
          <year>2016</year>
          :
          <article-title>Cross-Genre Evaluations</article-title>
          , in: K.
          <string-name>
            <surname>Balog</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          Macdonald (Eds.),
          <source>Working Notes Papers of the CLEF 2016 Evaluation Labs</source>
          , volume
          <volume>1609</volume>
          of Lecture Notes in Computer Science,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <source>Overview of the 5th Author Profiling Task at PAN</source>
          <year>2017</year>
          :
          <article-title>Gender and Language Variety Identification in Twitter</article-title>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Goeuriot</surname>
          </string-name>
          , T. Mandl (Eds.),
          <source>Working Notes Papers of the CLEF 2017 Evaluation Labs</source>
          , volume
          <volume>1866</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Montes-y-</article-title>
          <string-name>
            <surname>Gómez</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Stein</surname>
          </string-name>
          ,
          <source>Overview of the 6th Author Profiling Task at PAN</source>
          <year>2018</year>
          :
          <article-title>Cross-domain Authorship Attribution and Style Change Detection</article-title>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>J.-Y.</given-names>
          </string-name>
          <string-name>
            <surname>Nie</surname>
          </string-name>
          , L. Soulier (Eds.),
          <article-title>CLEF 2018 Evaluation Labs</article-title>
          and Workshop - Working Notes Papers,
          <volume>10</volume>
          -
          <fpage>14</fpage>
          September, Avignon, France, CEUR-WS.org,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <source>Overview of the 7th Author Profiling Task at PAN</source>
          <year>2019</year>
          :
          <article-title>Bots and Gender Profiling</article-title>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Losada</surname>
          </string-name>
          , H. Müller (Eds.),
          <article-title>CLEF 2019 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Giachanou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ghanem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <source>Overview of the 8th Author Profiling Task at PAN</source>
          <year>2020</year>
          :
          <article-title>Profiling Fake News Spreaders on Twitter</article-title>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Eickhof</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Névéol (Eds.),
          <article-title>CLEF 2020 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. L. D. L. P.</given-names>
            <surname>Sarracén</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Fersini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <source>Profiling Hate Speech Spreaders on Twitter Task at PAN</source>
          <year>2021</year>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Maistro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Piroi</surname>
          </string-name>
          (Eds.),
          <article-title>CLEF 2021 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Ortega-Bueno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chulvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Rosso</surname>
          </string-name>
          , E. Fersini,
          <article-title>Profiling Irony and Stereotype Spreaders on Twitter (IROSTEREO). Overview for PAN at CLEF 2022</article-title>
          ., in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hanbury</surname>
          </string-name>
          , M. Potthast (Eds.),
          <article-title>CLEF 2022 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Basile</surname>
          </string-name>
          , G. Dwyer,
          <string-name>
            <given-names>M.</given-names>
            <surname>Medvedeva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Rawee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Haagsma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nissim</surname>
          </string-name>
          , N-GrAM:
          <article-title>New Groningen Author-profiling Model-Notebook for PAN at CLEF 2017</article-title>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Goeuriot</surname>
          </string-name>
          , T. Mandl (Eds.),
          <article-title>CLEF 2017 Evaluation Labs</article-title>
          and Workshop - Working Notes Papers,
          <volume>11</volume>
          -
          <fpage>14</fpage>
          September, Dublin, Ireland, CEUR-WS.org,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Pizarro</surname>
          </string-name>
          ,
          <article-title>Using N-grams to detect Bots on Twitter</article-title>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>D. E.</given-names>
          </string-name>
          <string-name>
            <surname>Losada</surname>
          </string-name>
          , H. Müller (Eds.),
          <source>Working Notes of CLEF 2019 - Conference and Labs of the Evaluation Forum, Lugano, Switzerland, September</source>
          <volume>9</volume>
          -
          <issue>12</issue>
          ,
          <year>2019</year>
          , volume
          <volume>2380</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>Martinc</surname>
          </string-name>
          , I. Škrjanec,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zupan</surname>
          </string-name>
          , S. Pollak,
          <string-name>
            <surname>PAN</surname>
          </string-name>
          <year>2017</year>
          :
          <article-title>Author Profiling - Gender and Language Variety Prediction-Notebook for PAN at CLEF 2017</article-title>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Goeuriot</surname>
          </string-name>
          , T. Mandl (Eds.),
          <article-title>CLEF 2017 Evaluation Labs</article-title>
          and Workshop - Working Notes Papers,
          <volume>11</volume>
          -
          <fpage>14</fpage>
          September, Dublin, Ireland, CEUR-WS.org,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>F.</given-names>
            <surname>Johansson</surname>
          </string-name>
          ,
          <source>Supervised Classification of Twitter Accounts Based on Textual Content of Tweets</source>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>D. E.</given-names>
          </string-name>
          <string-name>
            <surname>Losada</surname>
          </string-name>
          , H. Müller (Eds.),
          <source>Working Notes of CLEF 2019 - Conference and Labs of the Evaluation Forum, Lugano, Switzerland, September</source>
          <volume>9</volume>
          -
          <issue>12</issue>
          ,
          <year>2019</year>
          , volume
          <volume>2380</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>H.</given-names>
            <surname>Giglou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Razmara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rahgouy</surname>
          </string-name>
          , M. Sanaei,
          <article-title>LSACoNet: A Combination of Lexical and Conceptual Features for Analysis of Fake News Spreaders on Twitter-Notebook for PAN at CLEF 2020</article-title>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Eickhof</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Névéol (Eds.),
          <article-title>CLEF 2020 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>R.</given-names>
            <surname>Labadie-Tamayo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Castro-Castro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ortega-Bueno</surname>
          </string-name>
          ,
          <article-title>Fusing Stylistic Features with Deep-learning Methods for Profiling Fake News Spreader-Notebook for PAN at CLEF 2020</article-title>
          , in: L.
          <string-name>
            <surname>Cappellato</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Eickhof</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Ferro</surname>
            ,
            <given-names>A</given-names>
          </string-name>
          . Névéol (Eds.),
          <article-title>CLEF 2020 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Siino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. D.</given-names>
            <surname>Nuovo</surname>
          </string-name>
          , I. Tinnirello,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Cascia</surname>
          </string-name>
          ,
          <article-title>Detection of Hate Speech Spreaders using Convolutional Neural Networks</article-title>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Maistro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Piroi</surname>
          </string-name>
          (Eds.),
          <article-title>CLEF 2021 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>H.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Mo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kong</surname>
          </string-name>
          ,
          <article-title>A Multi-Model Voting Ensemble Classifier based on BERT for Profiling Irony and Stereotype Spreaders on Twitter</article-title>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hanbury</surname>
          </string-name>
          , M. Potthast (Eds.),
          <article-title>CLEF 2022 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>R. Labadie</given-names>
            <surname>Tamayo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. Castro</given-names>
            <surname>Castro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. Ortega</given-names>
            <surname>Bueno</surname>
          </string-name>
          ,
          <article-title>Deep Modeling of Latent Representations for Twitter Profiles on Hate Speech Spreaders Identification Task-Notebook for PAN at CLEF 2021</article-title>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Maistro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Piroi</surname>
          </string-name>
          (Eds.),
          <article-title>CLEF 2021 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>C.</given-names>
            <surname>Bagdon</surname>
          </string-name>
          ,
          <article-title>Profiling Spreaders of Hate Speech with N-grams and RoBERTa-Notebook for PAN at CLEF 2021</article-title>
          , in: G. Faggioli,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ferro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Maistro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Piroi</surname>
          </string-name>
          (Eds.),
          <article-title>CLEF 2021 Labs and Workshops, Notebook Papers, CEUR-WS</article-title>
          .org,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ryder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Subbiah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Neelakantan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shyam</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>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Herbert-Voss</surname>
          </string-name>
          , G. Krueger,
          <string-name>
            <given-names>T.</given-names>
            <surname>Henighan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Child</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ziegler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Winter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hesse</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          , E. Sigler,
          <string-name>
            <given-names>M.</given-names>
            <surname>Litwin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gray</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Chess</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clark</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Berner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>McCandlish</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Sutskever</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Language models are few-shot learners</article-title>
          , in: H.
          <string-name>
            <surname>Larochelle</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ranzato</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Hadsell</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Balcan</surname>
          </string-name>
          , H. Lin (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>33</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2020</year>
          , pp.
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          . URL: https://proceedings.neurips.cc/paper_files/ paper/2020/file/1457c0d6bfcb4967418bfb8ac142f64a-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dai</surname>
          </string-name>
          , et al.,
          <article-title>A survey on in-context learning</article-title>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>G.</given-names>
            <surname>Koch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zemel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Salakhutdinov</surname>
          </string-name>
          , et al.,
          <article-title>Siamese neural networks for one-shot image recognition, in: ICML deep learning workshop</article-title>
          , volume
          <volume>2</volume>
          ,
          <string-name>
            <surname>Lille</surname>
          </string-name>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>E.</given-names>
            <surname>Hofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ailon</surname>
          </string-name>
          ,
          <article-title>Deep metric learning using triplet network</article-title>
          , in: A.
          <string-name>
            <surname>Feragen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Pelillo</surname>
          </string-name>
          , M. Loog (Eds.),
          <source>Similarity-Based Pattern Recognition</source>
          , Springer International Publishing, Cham,
          <year>2015</year>
          , pp.
          <fpage>84</fpage>
          -
          <lpage>92</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mueller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Pérez-Torró</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Franco-Salvador</surname>
          </string-name>
          ,
          <article-title>Few-shot learning with siamese networks and label tuning, in: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</article-title>
          (Volume
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>M.</given-names>
            <surname>Chinea-Rios</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Müller</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. L. D.</surname>
          </string-name>
          <article-title>la Pena Sarrac'en</article-title>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Franco-Salvador</surname>
          </string-name>
          ,
          <article-title>Zero and few-shot learning for author profiling</article-title>
          , in: International Conference on Applications of Natural Language to Data Bases,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chinea-Rios</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Franco-Salvador</surname>
          </string-name>
          , P. Rosso,
          <article-title>PAN23 Profiling Cryptocurrency Influencers with Few-shot</article-title>
          <string-name>
            <surname>Learning</surname>
          </string-name>
          ,
          <year>2023</year>
          . URL: https://doi.org/10.5281/zenodo.7701748. doi:
          <volume>10</volume>
          .5281/zenodo.7701748.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>M.</given-names>
            <surname>Chinea-Rios</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Müller</surname>
          </string-name>
          , G. L.
          <string-name>
            <surname>De la Peña Sarracén</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Franco-Salvador</surname>
          </string-name>
          ,
          <article-title>Zero and few-shot learning for author profiling</article-title>
          , in: P.
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Basile</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Martínez</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Métais</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Meziane</surname>
          </string-name>
          (Eds.),
          <source>Natural Language Processing and Information Systems</source>
          , Springer International Publishing, Cham,
          <year>2022</year>
          , pp.
          <fpage>333</fpage>
          -
          <lpage>344</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>C.</given-names>
            <surname>Saedi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dras</surname>
          </string-name>
          ,
          <article-title>Siamese networks for large-scale author identification</article-title>
          ,
          <source>Computer Speech &amp; Language</source>
          <volume>70</volume>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. M.</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>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>E. J.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Wallis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Allen-Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Chen</surname>
          </string-name>
          , Lora:
          <article-title>Low-rank adaptation of large language models</article-title>
          ,
          <source>in: International Conference on Learning Representations</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>H.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kasai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          , et al.,
          <article-title>One embedder, any task: Instruction-finetuned text embeddings</article-title>
          ,
          <source>arXiv preprint arXiv:2212.09741</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>D. P.</given-names>
            <surname>Kingma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ba</surname>
          </string-name>
          ,
          <article-title>Adam: A method for stochastic optimization</article-title>
          , in: Y. Bengio, Y. LeCun (Eds.),
          <source>3rd International Conference on Learning Representations, ICLR</source>
          <year>2015</year>
          , San Diego, CA, USA, May 7-
          <issue>9</issue>
          ,
          <year>2015</year>
          , Conference Track Proceedings,
          <year>2015</year>
          . URL: http://arxiv.org/abs/ 1412.6980.
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>T.</given-names>
            <surname>Akiba</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Yanase</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ohta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Koyama</surname>
          </string-name>
          ,
          <article-title>Optuna: A next-generation hyperparameter optimization framework</article-title>
          ,
          <source>in: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery &amp; data mining</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>R.</given-names>
            <surname>Hadsell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chopra</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          <article-title>LeCun, Dimensionality reduction by learning an invariant mapping</article-title>
          ,
          <source>in: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06)</source>
          , volume
          <volume>2</volume>
          ,
          <year>2006</year>
          . doi:
          <volume>10</volume>
          .1109/CVPR.
          <year>2006</year>
          .
          <volume>100</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>F.</given-names>
            <surname>Schrof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kalenichenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Philbin</surname>
          </string-name>
          ,
          <article-title>Facenet: A unified embedding for face recognition and clustering</article-title>
          ,
          <source>in: Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>G.</given-names>
            <surname>Hinton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Srivastava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Swersky</surname>
          </string-name>
          ,
          <article-title>Lecture 6a overview of mini-batch gradient descent</article-title>
          , Coursera Lecture slides https://class. coursera. org/neuralnets-2012-001/lecture,[Online] (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>J.</given-names>
            <surname>Howard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ruder</surname>
          </string-name>
          ,
          <article-title>Universal language model fine-tuning for text classification</article-title>
          ,
          <source>in: Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume</source>
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <source>Association for Computational Linguistics</source>
          ,
          <year>2018</year>
          . doi:
          <volume>10</volume>
          .18653/ v1/
          <fpage>P18</fpage>
          -1031.
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>T.</given-names>
            <surname>Wolf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sanh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chaumond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Delangue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Moi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cistac</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Rault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Louf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Funtowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Davison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shleifer</surname>
          </string-name>
          , P. von Platen, C. Ma,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jernite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Plu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Le</given-names>
            <surname>Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gugger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Drame</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lhoest</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rush</surname>
          </string-name>
          , Transformers:
          <article-title>State-of-the-art natural language processing</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2020</year>
          , pp.
          <fpage>38</fpage>
          -
          <lpage>45</lpage>
          . URL: https://aclanthology.org/
          <year>2020</year>
          .emnlp-demos.6. doi:
          <volume>10</volume>
          .18653/v1/
          <year>2020</year>
          .emnlp-demos.
          <volume>6</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <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>
          , et al.,
          <article-title>BLOOM: A 176b-parameter open-access multilingual language model</article-title>
          ,
          <source>CoRR abs/2211</source>
          .05100 (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .48550/arXiv.2211. 05100.
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>T.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Glass</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <article-title>Analyzing the forgetting problem in the pretrain-finetuning of dialogue response models</article-title>
          ,
          <year>2021</year>
          . arXiv:
          <year>1910</year>
          .07117.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>