<!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>Valladolid, Spain
†These authors contributed equally.
$ hcerezo@gradiant.org (H. Cerezo-Costas); palonso@gradiant.org (P. Alonso-Doval); mhormazabal@gradiant.org
(M. Hormazábal-Lagos); aldan.creo@rai.usc.es (A. Creo)
 https://github.com/hmightypirate (H. Cerezo-Costas); https://github.com/PedroDoval (P. Alonso-Doval);
https://github.com/maxhormazabal (M. Hormazábal-Lagos); https://acmc-website.web.app/intro (A. Creo)</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Telescope: Discovering Multilingual LLM Generated Texts with Small Specialized Language Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Héctor Cerezo-Costas</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pedro Alonso-Doval</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maximiliano Hormazábal-Lagos</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Aldan Creo</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Spain</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Independent Researcher</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dublin</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ireland</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>This paper introduces Telescope, a Machine-Generated Text (MGT) detection system developed for the IberAuTexTification challenge at IberLEF 2024. Our approach is an adaptation of Binoculars, a technique which involves the change ratio of perplexity and cross-perplexity using two closely related language models to quantify the level of surprise in word selection in the generation of a sentence for identifying MGT. This is supported by an iterative threshold selection process that balances false positives and false negatives. Enhancements include ifne-tuning of pretrained linguistic models to improve performance in the minority languages present in the Iberian Peninsula. This approach obtained the best performance measured in a random split of the training used for testing in all the Iberian languages. Results extrapolate to other contexts and generation profiles, with our models finishing third of all participants in the final contest. Telescope demonstrated its robustness and eficacy across diverse linguistic contexts, with significant improvements in MGT detection over Iberian languages. These results highlight the potential of Telescope for enhancing content moderation strategies.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Machine-Generated Text (MGT) Detection</kwd>
        <kwd>Large Language Models</kwd>
        <kwd>Natural Language Processing</kwd>
        <kwd>Artificial Intelligence</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Machine-Generated Text (MGT) refers to natural language text produced, extended, or modified by
machines, predominantly large language models (LLMs) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Given the continuous advancement in
the quality of text that language models are capable of generating and, consequently, the expansion of
their application in content generation for various purposes, it is imperative to develop robust methods
for detecting MGT across diverse contexts, languages, and domains. These methods are essential for
developing efective content moderation strategies and are crucial in mitigating risks associated with
MGT, such as disinformation, phishing, and spam [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        This paper introduces Telescope, a system developed for the IberAuTexTification [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] shared task
at IberLEF 2024 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], which aims to develop models that exploit linguistic form and meaning cues to
identify MGT and Human-Written Text (HWT) using a wide variety of models, domains, and languages
from the Iberian Peninsula. Our approach primarily focuses on Subtask_1, which involves the binary
classification of text records as either machine-generated or human-written.
      </p>
      <p>
        Telescope is an adaptation of Binoculars [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], a technique that utilizes dual metrics: perplexity and
cross-perplexity (a cross-entropy measure of two perplexities) combined in a metric called , which
represents the change ratio of both metrics. This approach quantifies the level of surprise in word
selection during sentence generation from the perspective of two closely related language models, with
the hypothesis that this ratio will increase in the presence of HWT and decrease in the presence of
MGT.
      </p>
      <p>We employ open pretrained language models that achieve state-of-the-art results under optimal
conditions; however, their performance degrades when applied to specific domains or languages. Given
that this challenge involves languages from the Iberian Peninsula, some of which are considered
minority languages, Telescope proposes to enhance detection accuracy through a fine-tuning phase
to develop specialized models for defined language groups. This process involves adapting models
to better comprehend the nuances and syntactic structures of minority languages, which are often
underrepresented in mainstream datasets.</p>
      <p>As the Binoculars approach provides an indicator of the likelihood of text being HWT, the selection of
the decision threshold is critical to the performance of the detection system. To determine this threshold
value, we employ an iterative process, experimenting with various threshold values to optimize the
trade-of between false positives and false negatives, thereby achieving a higher accuracy rate in MGT
identification.</p>
      <p>By incorporating these advanced techniques and enhancements, we achieved third place in the
Subtask_1 ranking, demonstrating the efectiveness of our approach across diverse linguistic contexts.
The remainder of this paper is organized as follows:</p>
      <p>Section 2 provides an overview of current approaches to detect generated text. Section 3 describes
the dataset utilized in our approach. Section 4 details the methodology employed to detect MGT texts.
Section 5 presents the evaluation and model selection process. Section 6 reports the obtained results.
Section 7 discusses the implications of these results. Finally, Section 8 concludes the paper and suggests
directions for future research.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
      <p>
        Current approaches to detect machine-generated text can be categorized into several distinct groups:
• Machine Learning Classifiers : These methods employ traditional text classifiers trained on
labeled HWT and MGT. This approach can involve fine-tuning pretrained models such as BERT
or RoBERTa, or utilizing simpler techniques like logistic regression [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. However, these methods
often encounter challenges when confronted with texts generated by models more sophisticated
than those used for detection [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], or when faced with overfitting to the domains and distributions
of the training data [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
• Statistical Analysis: These models calculate the probabilities of generated text using the output
probability matrix of a model. Such approaches typically account for the common heuristics
employed in text generation. Many of these techniques demonstrate superior performance in
white-box analysis when the model generating the text to be detected is known a priori. However,
their performance deteriorates significantly when the generating model is unknown. Numerous
models in this category rely on the perplexity of the generated text [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], incorporating random
perturbations with another model to measure probability curvature [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] or analyzing the log
rank of tokens with and without perturbations [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
• Watermarking: This category encompasses strategies that require unrestricted access to the
text generation process. These methods involve altering output probabilities of the text at each
step [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] or directly filtering them [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], thereby creating a hidden pattern in the output text that
can be readily detected through statistical analysis. While watermarking is a promising approach,
it can be susceptible to evasion through paraphrasing in certain configurations. To enhance the
reliability of this scheme, more robust generation heuristics have been proposed [
        <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
        ].
• Detection via Rewriting: This innovative method, as employed by some researchers [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ],
involves tasking an LLM with rewriting the text and subsequently analyzing the result. This
approach leverages the tendency of LLMs to perceive MGT as higher-quality text, resulting in
fewer modifications. This method ofers several advantages, including the ability to utilize any
LLM, regardless of its open or proprietary nature, and requires only the final output for analysis.
      </p>
      <sec id="sec-2-1">
        <title>Language</title>
      </sec>
      <sec id="sec-2-2">
        <title>Spanish</title>
        <p>Catalan
Basque
Galician
Portuguese
English</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Dataset</title>
      <p>The dataset employed in our approach comprises a diverse collection of texts in various languages from
the Iberian Peninsula, provided by the IberAuTexTification shared task. The corpus encompasses texts
in Spanish (ES), Galician (GL), Basque (EU), Catalan (CA), Portuguese (PT), and English (EN). In total,
the dataset consists of 109, 663 texts released by the organization as training data.</p>
      <p>
        We conducted a preliminary analysis of the dataset to ascertain the distribution of texts and the
average text length per language. Table 1 presents a comprehensive overview of the text distribution
and average text length for each language represented in the corpus. The languages have been detected
using langID [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
      </p>
      <p>The corpus was strategically partitioned into three segments. The largest segment, comprising
87, 730 texts, was utilized for model fine-tuning. Two smaller segments, each containing 10, 000 texts
(hereafter referred to as 10), were employed for evaluation and testing purposes. Throughout this
paper, these segments are designated as eval-10K and test-10K, respectively, to distinguish them from the
authentic unlabeled test set released by the organization during the test phase of the IberAuTexTification
task.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Methodology</title>
      <sec id="sec-4-1">
        <title>4.1. Binoculars Detector</title>
        <p>The evaluation of statistical metrics for the detection of MGT is predicated on measuring the presence of
a statistical signature characteristic of both HWT and MGT. The underlying rationale is that language
models generally adhere to a measurable probability distribution in their word selection during text
generation. Specifically, perplexity is employed as a metric to quantify the degree of surprise generated
when selecting words that compose a text, given its prior context.</p>
        <p>A common assumption has been that when a language model analyzes the perplexity of a text,
human-written content will yield higher scores than machine-generated text. Consequently, previous
contributions have proposed identifying a threshold to diferentiate between human and
machinegenerated text based on this measure. However, this assumption has been invalidated by the advent
of larger, prompt-based models. Their outputs tend to exhibit perplexity metrics similar to
humangenerated texts due to their enhanced expressiveness. As a result, false positives are not uncommon
when analyzing perplexity in isolation.</p>
        <p>
          Binoculars proposes an alternative approach [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], based on a metric , which represents the rate of
the perplexity of an input text  of length  divided by a cross-perplexity metric that measures how
surprising are the predictions on one model to another (a sort of cross-entropy). Binoculars employs
two closely related language models,  (observer) and  (performer), executing the following steps:
• A baseline-perplexity (equation 1) of the input text is calculated. Complex prompts are expected
to increase this value. Here  () is the output probability of sentence token  obtained with
the model.
        </p>
        <p>1 ∑︁  ()
   () = −  =1
• Concurrently, cross-entropy is calculated (equation 2), measuring the degree of surprise in the
text generation by the performer from the observer’s perspective.</p>
        <p>1 ∑︁ () *  ()
   , () = −  =1
• The ratio  between these two metrics is calculated (equation 3) and compared to a decision
threshold. We adhere to the same order of performer/observer models as in the oficial Binoculars
implementation [18], that difers slightly from the paper notation of the same authors.
(1)
(2)
(3)
 =  , () =</p>
        <p>()
   , ()</p>
        <p>The rationale for employing a ratio rather than absolute baseline-perplexity and cross-perplexity values
is to mitigate the impact of complex prompts on perplexity scores. It is anticipated that both metrics
will be correlated in MGT, but not in human texts. This implies that human  values are higher than
MGT ones, justifying the use of the  ratio with a decision threshold.</p>
        <p>
          In the original work, a specialized model for English was utilized, the FALCON 7B model [
          <xref ref-type="bibr" rid="ref18">19</xref>
          ].
Performance in other languages is degraded, although the authors claim the system maintains adequate
performance across multiple contexts. They establish the reference threshold using a random split of
the reference datasets used to train the system.
        </p>
        <p>We propose two main improvements over the seminal Binoculars work. First, we introduce a
finetuning step with only generative content to enhance system performance. Second, instead of using a
single threshold to discriminate between human and generated content, we obtain multiple thresholds
using non-random splits of the data. Consequently, diferent text sizes, languages, or contexts could
potentially have diferent thresholds.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Model Fine-tuning</title>
        <p>The adjustments implemented by Binoculars in MGT detection are related to the influence of the prompt
on MGT perplexity values. Although Binoculars achieves state-of-the-art performance using pretrained
models without the need for fine-tuning, this implies that the performance of these systems will be
strictly related to the quality of pretraining of the selected models. This is why one of the most relevant
drawbacks is the noticeable decrease in performance of this algorithm when dealing with diferent
languages and domains, particularly with minority languages and specific domains.</p>
        <p>
          Our proposed method utilizes the dataset presented in Section 3, separated by languages into groups
that allow language models to specialize in minority languages (Basque and Galician) and in another
group of more widely spoken languages such as Spanish, English, and Catalan, with a final group for
Portuguese. Specifically, we fine-tuned the following models for each language:
• Basque [Latxa-7B]: A family of LLMs designed for Basque with 7 to 70 billion parameters. The
model is based on Llama 2 and was trained on a corpus of 4.3M Basque documents. Latxa was
released by a team from the HiTZ Center [
          <xref ref-type="bibr" rid="ref19">20</xref>
          ].
• Spanish, English, and Catalan [FLOR-1B3]: BLOOM architecture fine-tuned with 26 billion
tokens of Catalan, Spanish, and English text, released by the Barcelona Supercomputing Center
[
          <xref ref-type="bibr" rid="ref20">21</xref>
          ].
• Galician [Carballo-BLOOM-1B3]: Model based on FLOR-1B3 pretrained with CorpusNOS
[
          <xref ref-type="bibr" rid="ref21">22</xref>
          ], a massive Galician corpus with 2.1B words.
• Portuguese [BLOOM-1B7]: Multilingual model composed of over 1.7 billion parameters,
supporting 45 natural and 12 programming languages. It was developed by the BigScience initiative
using the Jean Zay Public Supercomputer in France [
          <xref ref-type="bibr" rid="ref22">23</xref>
          ]. We also experimented with Aira-2
[
          <xref ref-type="bibr" rid="ref23">24</xref>
          ] but did not obtain superior results in our tests.
        </p>
        <p>
          We utilized the HuggingFace Transformers library [
          <xref ref-type="bibr" rid="ref24">25</xref>
          ] to fine-tune the models using the PEFT [
          <xref ref-type="bibr" rid="ref25">26</xref>
          ]
implementation of LORA, with hyperparameters  = 16, dropout = 0.1 and rank = 64, to reduce
training complexity. Each model except the Basque was fine-tuned for 250 steps with a batch size
of 16, exclusively feeding randomly shufled training examples in the relevant language. The model
for Basque was fine-tuned for 500 steps with a batch size of 4. In this phase, only the generated data
are used. The base model and the fine-tuned models are used as performer and observer, respectively,
using the same strategy as Binoculars. With the exception of Latxa-7B, all models have a smaller size
than the original Falcon-7B to accommodate training in the available hardware. Fine-tuned and base
models share the same token dictionary, which is the main requirement for use in Binoculars.
        </p>
        <p>Following the naming convention of Binoculars, we call our models Telescope, as they are more
focused and powerful in specific scenarios but, in contrast, are less portable as they require extra models
per language and computational steps for fine-tuning. To diferentiate from the baseline that is closer
to the Binoculars strategy, we use this name only to refer to the combination that uses the fine-tuned
models.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Selection of a Classification Threshold</title>
        <p>The Telescope strategy based on Binoculars allows us to obtain a numerical indicator to decide
whether a text is HWT or MGT. However, as important as the calculation of the perplexity metrics is
the determination of the threshold value to decide the boundary between values that will be classified
as HWT or MGT. As mentioned in the methods section, the value of the B-ratio will increase if the text
was generated by a human and decrease if it was written by machines.</p>
        <p>The optimal threshold value for Binoculars is directly influenced by factors such as text length,
communicative context, linguistic environment, and the combination of models selected as performer
and observer, respectively. This is why correctly selecting the threshold value for Binoculars is crucial
for accurately determining the classification of a text at its source of generation. As this is a learning
process influenced by multiple factors, it is essential to search through a wide set of possible threshold
values around their potential combinations.</p>
        <p>Given a subset of data from the training corpus, the optimal threshold for this subset is obtained with
the AUROC score, using the ground-truth labels. For example, Figure 1 and Figure 2 show the ROC
curve for the Spanish texts in the training corpus. In these examples, the best threshold for this split is
0.76 and 0.90, respectively, using this combination of models.</p>
        <p>
          Due to resource constraints, we limit the search for the optimum threshold to a small subset of text
size splits (with a maximum of 10 splits), fixing the split by language and the subset of models used.
To select the optimum threshold for the training corpus, we employed Optuna [
          <xref ref-type="bibr" rid="ref26">27</xref>
          ]. Here, we aim to
maximize the Macro-F1 score in the test-10k, using the thresholds obtained in the eval-10k.
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Evaluation and model selection</title>
      <p>In this comparative analysis, we evaluate four model combinations. Two serve as zero-shot baselines:
FLOR-1B3/FLOR-1B3-instruct and BLOOM-1B7/BLOOMZ-1B7. The third combination, which we
designate as Telescope, utilizes the fine-tuned and base models, one model pair per language. At test
time, language is detected to apply the corresponding model pair and threshold. Finally, we aggregate
the scores of all models into a single output, termed Ensemble, assuming equal contributions from all
combinations.</p>
      <p>It is crucial to note that the Binoculars score is not symmetrical, and the designation of a model
as performer or observer significantly impacts the result. Table 2 presents a preliminary study used
to determine the optimal combination of models for Telescope. The results demonstrate that the
ifne-tuned models consistently perform better as performers across all language and model combinations
for this task.</p>
      <p>For each case (excluding the baselines), thresholds are derived from the eval-10K dataset and applied
to the test-10K dataset to compute the Macro-F1 score. The baselines, being zero-shot, utilize the
training split and eval-10k to determine the optimal thresholds.</p>
      <p>Table 3 illustrates the splits by text size and language, along with the optimal thresholds in the
eval10k for the FLOR-1B3 and FLOR-1B3-instruct model combination. Similar analyses are conducted
for the other model combinations, as shown in Tables 4 and 5. Notably, the optimal threshold varies
considerably from smaller to larger text sizes, although no clear trend is discernible.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Results</title>
      <p>To evaluate the performance of the various model combinations and their respective thresholds, we
employ the Macro-F1 score on the random split of the training corpus, designated as test-10K. Table
6 summarizes these results. Upon initial examination, a significant disparity in performance across
diferent languages is evident. The majority languages (English and Spanish) demonstrate comparatively
superior results relative to the minority languages, with Basque exhibiting the lowest score overall.
Surprisingly, certain models that purportedly support a given language, such as BLOOM-1B7, yielded
lower scores than other model combinations that do not explicitly support it, such as FLOR-1B3.</p>
      <p>When a uniform threshold is applied across all languages, as in the original Binoculars paper, the
system’s performance decreases substantially. Implementing language-specific thresholds and
incorporating thresholds based on text length enhances the performance of every model pair configuration.
Telescope demonstrates robust performance even with a shared threshold, at least when the training
and test data share the same context and model generation techniques.</p>
      <p>The utilization of fine-tuned models improves metrics across all languages. However, it is important
to note that some biases may be introduced, as we are using generated data from a diferent split
of the training corpus that follows the same distribution as the test data (e.g., context and methods
of generation). Nevertheless, the fine-tuning step appears to be particularly beneficial for minority
languages that lack substantial support in terms of the number of models and training data used to
pretrain the multilingual models.</p>
    </sec>
    <sec id="sec-7">
      <title>7. Discussion</title>
      <sec id="sec-7-1">
        <title>7.1. Selection of Models</title>
        <p>The selection of generative models for certain minority languages is constrained. Recent developments
have seen the creation of models for Catalan and Galician based on the FLOR family of models (2023)
and the release of Latxa for Basque (2024). However, multilingual models have not demonstrated
optimal performance in these languages for text detection, likely due to the limited representation of
these languages in the pretraining data. Indeed, models exclusively pretrained in a single language
demonstrated superior performance in the majority of cases. Nevertheless, model selection was often
driven by availability, as it was frequently the only option for a given language. Our implemented
strategy requires two models whose tokenizers share the same vocabulary, further constraining the
availability of models for the study.</p>
        <p>A secondary limitation arose from the constrained computing resources available. All models (with
the exception of Latxa) were fine-tuned on a single NVIDIA GeForce GTX 1080, with a hardware limit
of 12GB of RAM. The performance of larger models using this strategy remains a prospective avenue
for future research.</p>
      </sec>
      <sec id="sec-7-2">
        <title>7.2. Generalization to Other Contexts</title>
        <p>
          An intriguing question is the extent to which the implemented strategy generalizes to other contexts.
To address this, we analyze the system’s performance using the training data from Autextification 2023
[
          <xref ref-type="bibr" rid="ref27">28</xref>
          ] (utilizing only the Spanish records). In comparison with the 2024 data, the diferent domains of
2023 are more easily distinguishable.
        </p>
        <p>The 2023 training data comprised three distinct contexts: tweets (orange), how-to guides (red), and
legal texts (green). These contexts are represented in Figure 3. The clusters were obtained through a
three-step pipeline: sentence embeddings vectorization with the all-MiniLM-L12-v2 model, UMAP
for dimensionality reduction, and K-Means with  = 3.</p>
        <p>We compare the performance of the FLOR-1B3 baseline with that of the fine-tuned models across
the three clusters using the area under the receiver operating characteristic curve (AUROC). Table 7
summarizes these results. It is evident that the baseline performs poorly in detecting legal and formal
texts, despite these texts being longer in length. This is likely due to the inherent dificulty in detecting
these texts using this strategy. The baseline zero-shot model performs no better than random, and
the fine-tuned Telescope is marginally better but still far from optimal. As observed, fine-tuning the
model with generated data appears to be beneficial in all contexts, despite the fact that the training data
were obtained from diferent sources, topics, and generation strategies.</p>
        <p>We conducted a similar analysis with the 2024 data but did not observe substantial gains or drops in
performance across the clusters. Consequently, the threshold was calculated only per language and text
length.</p>
      </sec>
      <sec id="sec-7-3">
        <title>7.3. Influence of Text Size</title>
        <p>Generally, strategies for detecting MGT text tend to exhibit a positive correlation between
accuracy and text length, a trend we also observe in our proposal. Figure 4 illustrates the AUROC
calculated at text length intervals of 25 tokens for the Spanish and English records using the
FLOR-1B3/FLOR-1B3-instruct model pairs.</p>
        <p>A slight performance drop is observed between 100-300 tokens, which we hypothesize may be
attributable to factors other than text size (e.g., the context of the texts or the generation strategy). For
texts with fewer than 100 tokens, the proposed system operates far from its optimal working region.
This is logical, as this strategy relies on metrics that are averaged over the text length (such as entropy
and cross-entropy).</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>8. Conclusions</title>
      <p>This paper presents and evaluates our Telescope approach for MGT detection across multiple
languages and domains, with a particular focus on languages of the Iberian Peninsula. This work was
conducted within the context of the IberAuTexTification task for the IberLEF Campaign, whose primary
objective is to develop models that exploit linguistic form and meaning cues to identify automatically
generated texts from a wide variety of models, domains, and languages.</p>
      <p>Our primary contributions are threefold: i) Development of the Telescope approach for MGT
detection based on the statistical signatures that current language models impart on the texts they
generate; ii) Evaluation of the system’s efectiveness across various contexts; iii) Analysis of the
influence of factors such as text length and linguistic context on system performance.</p>
      <p>These objectives were largely achieved, albeit with certain limitations and constraints detailed below.
The Telescope system demonstrated eficacy in detecting generated texts across several languages,
achieving competitive performance and securing third place in the IberAutextification 2024 competition.</p>
      <p>To implement our approach, we fine-tuned a set of pretrained linguistic models for each language in
the dataset. We then selected optimal thresholds for the scores based on a split of the language variety
and text sizes using the eval-10K dataset. Finally, we evaluated the performance of diferent model
combinations and threshold selection strategies on the test-10K dataset.</p>
      <p>The results revealed notable variations in system performance according to language and text size.
While Spanish and English texts exhibited satisfactory performance, Basque texts presented the greatest
challenges. This was attributed to the limited representation of this language in training corpora,
coupled with its linguistic dissimilarity to the other studied languages. These findings underscore the
limitations of multilingual models in minority languages that difer significantly in structure from more
widely spoken languages. Furthermore, system performance generally improved with longer texts.
However, performance drops were identified for text sizes between 100 and 300 tokens, which may
be attributed to contextual factors rather than text size itself, afecting measures of surprise such as
perplexity.</p>
      <p>The most significant limitation was the limited availability of high-quality generative models for
minority languages such as Catalan, Galician, and Basque. For these languages, often only one robust
option was available, negatively impacting our ability to train and tune models for optimal performance
or to conduct comprehensive benchmarking of minority language models. It should be noted that model
selection is one of the factors afecting Binoculars performance. Additionally, computational resource
constraints prevented us from exploring larger models, more complex architectures, or extending the
range of tests for threshold values. This limited our training to a single NVIDIA GeForce GTX 1080
GPU.</p>
      <p>We identify three key areas for future research: i) Augmentation of robust models for minority
languages and expansion of training datasets to improve representation and performance in these
languages. ii) Exploration of more advanced hardware and optimization techniques to enable the
training of larger models. iii) Further investigation into how diferent contexts and textual domains
afect system performance to improve generalization results to new areas.</p>
      <p>The generalization of the implemented strategy to other contexts is limited and influenced by the
aforementioned factors. Therefore, these three areas represent critical avenues for future research.
Nevertheless, Telescope represents a significant contribution to the field of MGT detection, having
yielded successful results within a shared task in the IberLEF campaign.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>E.</given-names>
            <surname>Crothers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Japkowicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. L.</given-names>
            <surname>Viktor</surname>
          </string-name>
          ,
          <article-title>Machine-generated Text: A Comprehensive Survey of Threat Models and Detection Methods</article-title>
          , IEEE Access (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R.</given-names>
            <surname>Mubarak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Alsboui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Alshaikh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Inuwa-Dutse</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Parkinson</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          <article-title>Survey on the Detection and Impacts of Deepfakes in Visual, Audio, and Textual Formats</article-title>
          ,
          <source>IEEE Access 11</source>
          (
          <year>2023</year>
          )
          <fpage>144497</fpage>
          -
          <lpage>144529</lpage>
          . doi:
          <volume>10</volume>
          .1109/ACCESS.
          <year>2023</year>
          .
          <volume>3344653</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Sarvazyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Á.</given-names>
            <surname>González</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>M.</given-names>
            <surname>Franco-Salvador</surname>
          </string-name>
          , Overview of IberAuTexTification at IberLEF 2024:
          <article-title>Detection and Attribution of Machine-Generated Text on Languages of the Iberian Peninsula</article-title>
          ,
          <source>Procesamiento del Lenguaje Natural</source>
          <volume>73</volume>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>L.</given-names>
            <surname>Chiruzzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Jiménez-Zafra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Rangel</surname>
          </string-name>
          , Overview of IberLEF 2024:
          <article-title>Natural Language Processing Challenges for Spanish and other Iberian Languages, in: Proceedings of the Iberian Languages Evaluation Forum (IberLEF 2024), co-located with the 40th Conference of the Spanish Society for Natural Language Processing (SEPLN 2024), CEUR-WS</article-title>
          .org,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Hans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Schwarzschild</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Cherepanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kazemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Saha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Goldblum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Geiping</surname>
          </string-name>
          , T. Goldstein,
          <article-title>Spotting LLMs With Binoculars: Zero-Shot Detection of Machine-Generated Text</article-title>
          ,
          <source>arXiv preprint arXiv:2401.12070</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>B.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          , How Close is ChatGPT to Human Experts? Comparison Corpus, Evaluation, and Detection, arXiv preprint arXiv:
          <volume>2301</volume>
          .07597 (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>G.</given-names>
            <surname>Jawahar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Abdul-Mageed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. V.</given-names>
            <surname>Lakshmanan</surname>
          </string-name>
          ,
          <article-title>Automatic Detection of Machine Generated Text: A Critical Survey</article-title>
          , arXiv preprint arXiv:
          <year>2011</year>
          .
          <volume>01314</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bakhtin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ranzato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Szlam</surname>
          </string-name>
          ,
          <article-title>Real or Fake? Learning to Discriminate Machine from Human Generated Text</article-title>
          , arXiv preprint arXiv:
          <year>1906</year>
          .
          <volume>03351</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gehrmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Strobelt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Rush</surname>
          </string-name>
          , GLTR:
          <article-title>Statistical Detection and Visualization of Generated Text</article-title>
          ,
          <source>in: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics: System Demonstrations</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>111</fpage>
          -
          <lpage>116</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E.</given-names>
            <surname>Mitchell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khazatsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          , C. Finn,
          <article-title>DetectGPT: Zero-Shot Machine-Generated Text Detection using Probability Curvature</article-title>
          , in: International Conference on Machine Learning, PMLR,
          <year>2023</year>
          , pp.
          <fpage>24950</fpage>
          -
          <lpage>24962</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Y.</given-names>
            <surname>Zhuo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wang</surname>
          </string-name>
          , P. Nakov,
          <source>DetectLLM: Leveraging Log Rank Information for Zero-Shot Detection of Machine-Generated Text, arXiv preprint arXiv:2306.05540</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Protecting Language Generation Models via Invisible Watermarking</article-title>
          , in: International Conference on Machine Learning, PMLR,
          <year>2023</year>
          , pp.
          <fpage>42187</fpage>
          -
          <lpage>42199</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kirchenbauer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Geiping</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Katz</surname>
          </string-name>
          , I. Miers,
          <string-name>
            <given-names>T.</given-names>
            <surname>Goldstein</surname>
          </string-name>
          ,
          <article-title>A Watermark for Large Language Models</article-title>
          , in: International Conference on Machine Learning, PMLR,
          <year>2023</year>
          , pp.
          <fpage>17061</fpage>
          -
          <lpage>17084</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Yin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A</given-names>
            <surname>Robust</surname>
          </string-name>
          Semantics-based
          <source>Watermark for Large Language Model against Paraphrasing</source>
          ,
          <year>2024</year>
          . arXiv:
          <volume>2311</volume>
          .
          <fpage>08721</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>A. B. Hou</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
            , T. He,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.-S.</given-names>
          </string-name>
          <string-name>
            <surname>Chuang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Shen</surname>
            ,
            <given-names>B. V.</given-names>
          </string-name>
          <string-name>
            <surname>Durme</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Khashabi</surname>
            ,
            <given-names>Y. Tsvetkov,</given-names>
          </string-name>
          <article-title>SemStamp: A Semantic Watermark with Paraphrastic Robustness for Text Generation</article-title>
          ,
          <year>2024</year>
          . arXiv:
          <volume>2310</volume>
          .
          <fpage>03991</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>C.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Vondrick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          , Raidar: Generative AI Detection via Rewriting,
          <source>arXiv preprint arXiv:2401.12970</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Lui</surname>
          </string-name>
          , T. Baldwin,
          <article-title>Cross-Domain Feature Selection for Language Identification</article-title>
          ,
          <source>in: Proceedings of 5th international joint conference on natural language processing</source>
          ,
          <year>2011</year>
          , pp.
          <fpage>553</fpage>
          -
          <lpage>561</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>E.</given-names>
            <surname>Almazrouei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Alobeidli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Alshamsi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cappelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cojocaru</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Debbah</surname>
          </string-name>
          , É. Gofinet,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hesslow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Launay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Malartic</surname>
          </string-name>
          , et al.,
          <source>The Falcon Series of Open Language Models, arXiv preprint arXiv:2311.16867</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>J.</given-names>
            <surname>Etxaniz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Sainz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Perez</surname>
          </string-name>
          , I. Aldabe,
          <string-name>
            <given-names>G.</given-names>
            <surname>Rigau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Agirre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ormazabal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Artetxe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Soroa</surname>
          </string-name>
          ,
          <article-title>Latxa: An Open Language Model and Evaluation Suite for Basque</article-title>
          ,
          <source>arXiv preprint arXiv:2403.20266</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>S.</given-names>
            <surname>Da Dalt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Llop</surname>
          </string-name>
          , I. Baucells,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pàmies</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>González-Agirre</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Villegas, FLOR: On the Efectiveness of Language Adaptation</article-title>
          ,
          <source>in: Proceedings of the 2024 Joint International Conference on Computational Linguistics</source>
          ,
          <article-title>Language Resources and Evaluation (LREC-COLING</article-title>
          <year>2024</year>
          ),
          <year>2024</year>
          , pp.
          <fpage>7377</fpage>
          -
          <lpage>7388</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [22]
          <string-name>
            <surname>I. de Dios-Flores</surname>
            ,
            <given-names>S. Paniagua</given-names>
          </string-name>
          <string-name>
            <surname>Suárez</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Carbajal Pérez</surname>
            ,
            <given-names>D. Bardanca</given-names>
          </string-name>
          <string-name>
            <surname>Outeiriño</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Garcia</surname>
          </string-name>
          , P. Gamallo,
          <source>CorpusNÓS: A Massive Galician Corpus for Training Large Language Models</source>
          ,
          <year>2024</year>
          . URL: https://doi.org/10.5281/zenodo.11655219. doi:
          <volume>10</volume>
          .5281/zenodo.11655219.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>T.</given-names>
            <surname>Le Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Akiki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Pavlick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ilić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hesslow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Castagné</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Luccioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yvon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gallé</surname>
          </string-name>
          , et al.,
          <string-name>
            <surname>Bloom</surname>
            :
            <given-names>A</given-names>
          </string-name>
          <string-name>
            <surname>176B-Parameter Open-Access Multilingual Language Model</surname>
          </string-name>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>N.</given-names>
            <surname>Kluge</surname>
          </string-name>
          , Nkluge-correa/Aira-EXPERT: release v.
          <volume>01</volume>
          ,
          <year>2022</year>
          . URL: https://doi.org/10.5281/zenodo. 6989727. doi:
          <volume>10</volume>
          .5281/zenodo.6989727.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [25]
          <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>
          , in: Q. Liu, D. Schlangen (Eds.),
          <source>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="ref25">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>S.</given-names>
            <surname>Mangrulkar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gugger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Debut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Belkada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Paul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bossan</surname>
          </string-name>
          , PEFT:
          <article-title>State-of-the-art ParameterEficient Fine-Tuning methods</article-title>
          , https://github.com/huggingface/peft,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [27]
          <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 and Data Mining</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [28]
          <string-name>
            <surname>A. M. Sarvazyan</surname>
            ,
            <given-names>J. Á.</given-names>
          </string-name>
          <string-name>
            <surname>González</surname>
            ,
            <given-names>M. Franco</given-names>
          </string-name>
          <string-name>
            <surname>Salvador</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Rangel</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Chulvi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Rosso</surname>
          </string-name>
          , Overview of AutexTification at IberLEF 2023:
          <article-title>Detection and Attribution of Machine-Generated Text in Multiple Domains</article-title>
          ,
          <source>in: Procesamiento del Lenguaje Natural</source>
          , Jaén, Spain,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>