<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Classify Fine-grained, Fake News Statements?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mark Mifsud</string-name>
          <email>mark.mifsud.16@um.edu.mt</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Colin Layfield</string-name>
          <email>colin.layfield@um.edu.mt</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Joel Azzopardi</string-name>
          <email>joel.azzopardi@um.edu.mt</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>John Abela</string-name>
          <email>john.abela@um.edu.mt</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Amsterdam, Netherlands</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dept of Artificial Intelligence, Faculty of ICT, University of Malta</institution>
          ,
          <addr-line>Msida</addr-line>
          <country country="MT">Malta</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Dept of Computer Information Systems, Faculty of ICT, University of Malta</institution>
          ,
          <addr-line>Msida</addr-line>
          <country country="MT">Malta</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>OHARS'21: Second Workshop on Online Misinformationand Harm-Aware Recommender Systems</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Fake news refers to deceptive online content and is a problem which causes social harm [1]. Early detection of fake news is therefore a critical but challenging problem. In this paper we attempt to determine if state-of-the-art models, trained on the LIAR dataset [2] can be leveraged to reliably classify short claims according to 6 levels of veracity that range from “True” to “Pants on Fire” (absolute lies). We investigate the application of transformer models BERT [3], RoBERTa [4] and ALBERT [5] that have previously performed significantly well on several natural language processing tasks including text classification. A simple neural network (FcNN) was also used to enhance each model's result by utilising the sources' reputation scores1. We achieved higher accuracy than previous studies that used more data or more complex models. Yet, after evaluating the models' behaviour, numerous flaws appeared. These include bias and the fact that they do not really model veracity which makes them prone to adversarial attacks. We also consider the possibility that language-based, fake news classification, on such short statements is an ill-posed problem.</p>
      </abstract>
      <kwd-group>
        <kwd>News Statements?</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Social media has made the creation and spreading of information easier, quicker and cheaper
than ever before. This scenario has resulted in an epidemic of what is termed as ‘fake news’
content that deliberately gives false information to deceive and manipulate, often with negative
results [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <sec id="sec-1-1">
        <title>1.1. Fake News Classification</title>
        <p>
          Since fake news spread fast, early detection is necessary in order to limit the spread and,
consequently, the harm. The use of Machine Learning (ML) techniques for Natural Language
Processing (NLP) is one way to build classifiers that could serve as potential early detectors.
Two distinct approaches that use NLP-based models [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] are:
        </p>
        <p>CEUR
1. Model-Based approaches: A ML model is used to find some reliable features in a dataset
that correlate to the classification label.
2. Feature-Based approaches: The ML model relies on pre-defined, linguistic or textual
feature(s) assumed to indicate deception.</p>
        <p>Our approach is model-based, since transformer models are used to learn features that correlate
short statements with their respective class labels.</p>
      </sec>
      <sec id="sec-1-2">
        <title>1.2. Transformers</title>
        <p>
          Transformers are deep learning architectures that have changed the face of NLP research in
recent years. A transformer is initially trained on a large corpus of text to build a ‘language
model’. This model represents words as vectors, yet unlike traditional word embeddings (like
Word2Vec), the representation of each word is sensitive to the context within which the word
occurs. The trained transformer can then be used for various NLP tasks, such as Question
Answering, Named Entity Recognition, Text Classification and others [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
        </p>
        <p>
          Google’s BERT [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] was the first to gain popularity since it performed very well on a number
of NLP benchmark-tasks. Facebook later released RoBERTa which, although sharing many
common features, was pre-trained using diferent algorithms on an English corpus 10 times
larger and also supported a larger vocabulary [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. RoBERTa outperformed BERT in multiple
instances. ALBERT, by Google and Toyota is an optimised version of the original BERT that
is highly scalable thus making larger architectures possible. ALBERT too performed better at
many NLP tasks than previous attempts [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
        </p>
      </sec>
      <sec id="sec-1-3">
        <title>1.3. The LIAR Dataset</title>
        <p>
          The LIAR dataset [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] contains 12,836 short claims by prominent players in US politics, extracted
from politifact.com. Statements are labelled as either True, Mostly-True, Half True, Barely-True
(mostly false), False or Pants-on-fire (6 classes). This makes the measure for veracity more finely
grained than a binary (real or fake) label [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]; which is appropriate since statements can have a
mix of true and false claims.
        </p>
        <p>
          Each statement in LIAR also comes with textual metadata including the job title of the speaker,
the speaker’s afiliation, state of origin and the context in which the claim was uttered, (namely
an interview, a debate or another event) [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. The speaker’s reputation is a numeric value
that represents the total number of claims under each category of truthfulness uttered by that
speaker. These values are important in some studies, and referred to as the speakers’ history,
credibility or reputation.
        </p>
      </sec>
      <sec id="sec-1-4">
        <title>1.4. Previous Works on LIAR</title>
        <p>
          Among the studies leading to this one, two are very relevant to our approach. Kirilin &amp; Strube
(2018) [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] have the best accuracy score (45.7%) on the 6-way classification, while Liu et al
(2019) [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] were among the first to use BERT to classify LIAR entries.
        </p>
        <p>
          Kirilin &amp; Strube represented the statements and the textual metadata as FastText [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] word
embeddings and subsequently used LSTMs to carry out the classification. The reputation score
and the classification result were then combined using an attention mechanism. A dense neural
network performs a final classification [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>
          Liu et al used BERT-base to classify the statements and textual metadata (except for the
speaker’s names). BERT’s output-vector and the reputation were then utilized in an attention
network followed by a simple neural network to carry out the classification. This entire layout
was repeated twice. The first one produced a coarse grained (true or false) classification. This
output was passed to the second segment, together with the initial input, to derive a final 6-way
classification [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
      </sec>
      <sec id="sec-1-5">
        <title>1.5. Ill-posed &amp; Ill-conditioned Problems</title>
        <p>
          The mathematical definition of a well-posed problem is attributed to mathematician Jacques
Hadamard [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. Pattern classification problems can be viewed as well-posed or ill-posed
problems in the sense of Hadamard [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
        </p>
        <p>
          A problem is well-posed if it satisfies the following 3 criteria [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]:
        </p>
        <sec id="sec-1-5-1">
          <title>1. It has a solution</title>
          <p>
            2. It has only one, uniquely defined solution; and
3. The solution’s behaviour changes continuously with the initial conditions
Thus, an ill-posed problem is a problem that fails one or more of the above criteria [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ]. Such
problems require some modification to be solved or approximated which may include additional
data, measurements or boundaries [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ].
          </p>
          <p>When considering a few of the short statements from the LIAR dataset, it becomes apparent
that many statements can have multiple possible truth-levels based on context, time or who the
speaker is. For instance, the veracity of the statement: “I am pro-life, he is not” will depend on
the speaker, the subject and their opinions at a given time.</p>
          <p>
            These multiple, possible solutions violate the second rule for a well posed problem, giving a
strong reason to believe that purely language-based classification of fake news is an ill-posed
problem. Another class of problems is called ill-conditioned. Such problems may not satisfy
the definition of ill-posed problems but are considered similarly unstable for practical purposes
since a small change in the input results in a large change in the output [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ].
          </p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Aims and Objectives</title>
      <p>The principal aim of this research was to build a Fake-News Classifier, that matches, or exceeds,
previous classifiers’ accuracy scores on the LIAR dataset. Objectives to reach this aim included:
1. To analyse the efectiveness of transformers, given that they are the current
state-of-theart NLP models, for the classification task.
2. To investigate whether better trained or larger transformers can achieve a higher accuracy.
3. To evaluate whether the overall classification result can be enhanced by adding neural
network layers that use both the transformer’s output and the source’s reputation score.</p>
      <p>Two other objectives were added with the aim of determining the reliability of the resulting
models.</p>
      <p>4. To investigate the bias, behaviour and learning of the models achieved.
5. To investigate the argument that fake news classification, performed using only NLP
(without the classifier having knowledge of the real world), is an ill-posed or ill-conditioned
problem.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Design &amp; Implementation</title>
      <sec id="sec-3-1">
        <title>3.1. The Classification Models</title>
        <p>Three BERT variants were used in order to determine if the diferences in transformer size,
pre-training or optimisations matter (as initially hypothesised). These were:</p>
        <sec id="sec-3-1-1">
          <title>1. BERT-base, the smallest of the models used. 2. RoBERTa-Large: a larger model pre-trained on a larger amount of data. 3. ALBERT-Large-V2: comparable to a larger version of BERT that was pre-trained for a longer time.</title>
          <p>6-way classification for diferent levels of truthfulness was performed on the statements in
LIAR without the use of any metadata.</p>
          <p>Fine tuning the transformers was performed manually for reasons of limited disk space. 80%
of LIAR’s data was used for fine tuning (training), 10% was used for validation and 10% for
testing. LIAR comes already split into these segments allowing for a fair comparison with
results reported in diferent studies.</p>
          <p>
            BERT and RoBERTa converged after two epochs at learning rates of 1.8−5 and 2.2−5
respectively. ALBERT took 4 epochs at a learning rate of 2.2−5. The batch size for training all models
was 64.
3.1.1. Using the Reputation Score
To use both the statement and the reputation scores for classification we created FcNN (Fully
Connected Neural Network). This was necessary because NLP-transformers are not applicable
for classification with numerical data such as the reputation score [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ]. The utilised FcNN has
24 nodes in its first hidden layer, 12 in the second hidden layer and an output of 6 nodes each
corresponding to one of our classifications. All layers use the tanh activation function since the
values of the transformers’ output vector vary from -1 to 1 (or close) just like the upper and
lower limits of the hyperbolic tangent function.
          </p>
          <p>Each of the transformers produces a classification vector consisting of 6 values in its final
layer, which can be extracted programmatically. These are input to the FcNN together with the
6 values of the reputation score (Figure 1) after the latter are normalised (divide by 200, since
this is a value close to the largest reputation score). FcNN is then trained at a learning rate of
9-4. To avoid overfitting their result was checked every 500 epochs of training and the best
iftting model was used. In every run, the FcNN managed to fit in less than 9000 epochs.</p>
          <p>In a separate attempt, FcNN was applied on its own, for classification using only the reputation
vector. This provided a baseline against which other models could be compared to (Table 3).</p>
          <p>None of the textual metadata was used because a speaker’s name, job or similar details were
considered to be unrelated to a statement’s truthfulness. Furthermore, these values either repeat
frequently, are often null or not normalized (non-atomic and diferent spelling can be found for
the same value). Because of this, we were concerned that it would bias the models unnecessarily.</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Quantifying the Classifiers’ Bias</title>
        <p>
          Relying too heavily on the individual’s reputation may result in labelling liars instead of lies [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
To test if this was the case with our models, a small set of 226 statements was used as a test-set
for our baseline, FcNN-only model that utilises only the reputation score.
        </p>
        <p>This test-set’s 226 statements are truths from liars and lies from mostly-honest speakers.
These were chosen by computing each speaker’s honesty ratio P, a measure of how honest a
speaker is, based on each speaker’s classification of his or her claims, such that:
 = 1.5(   −    ) + (     −  )
(1)</p>
        <p>The numerical diference of a speaker’s pants-on-fire statements from true ones was multiplied
to give it a higher weighting. Speakers with values close to zero (balanced liars) were ignored.
Those with scores less than -15 are considered liars so we take their truthful statements. Speakers
scoring more than 4 are honest ones, for which we take their lies. The reason for these cut-of
points was because speakers with honesty ratio between -15 and 4 were ones with relatively
fewer claims. The inequality resulted from the fact that the labels of liars are skewed to begin
with (3 false, 1 neutral and 2 true labels). Thus, the set of 226 statements was collected.</p>
        <p>While only the FcNN-only model (trained normally on LIAR’s training set) was used to classify
these 226 statements, it was expected that even the FcNN models using the transformer’s output
will be prone to this same bias, if confirmed.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Investigating the Efect of Data Quality on Learning</title>
        <p>We also trained the same models on datasets with diferent data quality than that of LIAR and
compared the results. This was meant to reveal the efect that the quality of the data has on the
models’ learning and also if the models are truly able to learn the intended classification task or
not.</p>
        <p>For this task, two variations of LIAR were created. The first is called Shufled-LIAR and was
obtained by randomly shufling the spoken claims attribute among all entries in the training set,
while leaving every other attribute (column) untouched. By having a dataset with randomised
text and all other attributes untouched, we can better determine how much the text really afects
the result. If the same results on the actual, unshufled set are also achievable on a completely
random set, then one can conclude that the results are accidental and hence insignificant.</p>
        <p>
          Additionally, the Cleaned-LIAR dataset was created in order to allow training and testing
on data of better quality (less errors) [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. This was done by compensating for flaws found in
LIAR2. Cleaned-LIAR omits 207 entries that were discovered to not be stated claims at all [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
For example, some entries are test data, many indicate whether a speaker changed opinion
(known as flip-flops on Politifact.com) while others are in Spanish (so the words used would
not be in the vocabulary of transformers trained on an English corpus).
        </p>
        <p>The spelling and grammar of the statements were also corrected manually, under the
assumption that since the transformers were pre-trained on good quality text and have a limited
vocabulary, classification may receive a boost from these corrections. If accuracy is not improved
when training on this set, this may suggest that the flawed entries were responsible for the
higher accuracy on the original (unchanged) LIAR.</p>
        <p>On Cleaned-LIAR, BERT was trained for 2 epochs at a 2−5 learning rate. RoBERTa and
ALBERT were trained at a learning rate of 1.2−5 for 3 and 2 epochs respectively. The models
failed to fit for Shufled-LIAR.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Testing the Ill-conditioned Property</title>
        <p>If instances of the same basic model produce highly varied classifications when they are trained
on data that difers gradually (when tested on the same test data); it may indicate that the
problem is ill-conditioned (at least in the way the problem is being treated here).</p>
        <p>Five copies of the same transformer were trained with training data that varies proportionally
each time. The dataset’s original training and validation portions were joined and their order
2Spelling and other mistakes in LIAR mostly result from how the data was scraped from polifact.com to produce
the dataset.
randomised. The resulting set was then stratified, splitting it in 5 folds (parts), such that all
folds contain virtually an identical number of statements and variety of labels (truth levels).
This keeps the label balance identical for each fold and thus for the 5 folds. For each of the five
training runs, a diferent combination of 4 folds would be used for training, and the fith would
be used for validation. The test set was the same in each of the 5 runs.</p>
        <p>
          This classification was performed with both LIAR and Cleaned-LIAR separately, using the
BERT-base model. Then this was all repeated with RoBERTa-Large. For comparison, the same
procedure was repeated using the two transformers to carry out a 5-way sentiment analysis on
the Stanford Sentiment Treebank (SST-5) dataset [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. This would ofer a baseline. Assuming
sentiment analysis is well-conditioned, fake-news classification would give a similar variability
to sentiment only if it is well-conditioned too.
        </p>
        <p>The same hyperparameters were used to train the transformers (2−5 learning rate, 64 batch
size for 2 epochs).</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results &amp; Evaluation</title>
      <p>In our evaluation, we managed to achieve a higher accuracy than other results reported in
literature. However, all other test results suggest that our models are flawed despite their higher
accuracy. This is described in more detail below.</p>
      <sec id="sec-4-1">
        <title>4.1. Classifiers Accuracy</title>
        <p>
          The transformer-only classifiers had a performance similar to Wang’s previous attempts that
utilise statements alone [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], showing they are at least as efective at classification as previous
deep learning models (Table 1).
        </p>
        <p>All of our Transformer+FcNN models exceeded accuracy results by Kirilin &amp; Strube (2018)
and Liu et al (2019) in spite of these studies using more data. This vindicates our decision to
avoid using textual metadata. Furthermore, our BERT model performs better than Liu et al’s
system, despite it having a far simpler architecture (Figure 1). All transformers produced similar
accuracy scores. A bigger or a better trained transformer only marginally improves fake news
classification.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Reputation Bias</title>
        <p>When classifying truthful statements from liars and lies from honest speakers, FcNN displays a
clear bias caused by utilising reputation. This is clearly visible in the Confusion Matrix found
in Table 2.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Efect of Data Quality on Training</title>
        <p>The fact that the transformers did not manage to properly fine-tune for Shufled-LIAR indicates
that the models are correlating some features to the labels, whilst no such correlating feature
occurs randomly. However, when trained on the less noisy, Cleaned-LIAR the performance of
the transformers, without FcNN was generally poorer (Table 3). RoBERTa is the exception in
this case, since the cleaned set resulted in marginally better performance.</p>
        <p>This unexpected result raised the question of whether the models are really modelling veracity.
A test to this efect was done as described below.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Is Veracity Being Modelled?</title>
        <p>Consider the following true statement that was classified correctly:
“One out of every four homeless people on our streets is a veteran.”
27.7%
27.3%
28.2%
48.0%
47.9%
48.6%</p>
        <p>Classifier
FcNN only
BERT-base Only
BERT+FcNN
RoBERTa Only
RoBERTa+FcNN
ALBERT Only
ALBERT+FcNN</p>
        <p>LIAR</p>
        <p>A change in the fine-grained classification of the statement is expected if any of the following
changes is done:
• Negation of the same statement: “One out of every four homeless people on our streets
is not a veteran.”
• Reducing probability of the statement: “One out of every four homeless people on our
streets is a friendly veteran.”; and
• Contradiction: “One out of every four homeless people on our streets is not homeless.”
Nevertheless, all such modifications are still classified as fully-true, showing that the models
are not modelling deception or veracity, thus making them vulnerable to adversarial attacks.</p>
      </sec>
      <sec id="sec-4-5">
        <title>4.5. The Ill-conditioned Property</title>
        <p>Fake news classification results varied with gradual changes in input data over 4 times that of
Sentiment Analysis on SST-5 (Table 4). Taking the Mean Square Error (MSE) for each run one
would measure the diference in classifications from their target label. Taking an Overall MSE
for the 5 runs, fake news classification shows considerable changes in output (Table 4).</p>
        <p>
          By the definition of ill-conditioned problems [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], all these are a strong indication that fake
news classification of short statements using transformers is an ill-conditioned problem.
        </p>
      </sec>
      <sec id="sec-4-6">
        <title>4.6. Is NLP-based Fake-news Classification Ill-posed?</title>
        <p>
          Factors supporting the case that NLP-based, fake news classification is an ill-posed problem
include:
1. There appears to be no indicator of truthfulness or deception within LIAR’s statements
unless one has knowledge of the real world. Sentiment Analysis by contrast, can be based
on the presence of certain words or expressions.
2. Feature Based detection does not generalise over domains [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
3. Khan et al 2019, observed that “the performance of models is not dataset invariant” [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ].
4. Accurate but non explainable models are not necessarily reliable. Assuming so, is an
‘afirming the consequent’ fallacy 3.
5. The models produced by this study and at least another previous one (Fakebox) are not
modelling veracity [20].
6. Psychology shows that people lie diferently. Even the same person’s indicators of
deception change over time within the same interview and are influenced by numerous
factors [21, 22].
7. The models in this study are at least ill-conditioned, as shown [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
        <p>All these point to the likelihood that there cannot be a model that maps a string of text to
truth levels without knowledge of the world. This likelihood is strong for the models trained
on LIAR and demonstrated for our models despite their relatively higher accuracy.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions &amp; Future Work</title>
      <sec id="sec-5-1">
        <title>5.1. Conclusions</title>
        <p>Our best models achieve a higher accuracy on the LIAR dataset utilising the spoken statements
and the speakers’ reputation alone, outperforming methods that either used more data, more
complex models or both. BERT and BERT variants can be leveraged to classify short statements
more accurately.</p>
        <p>Bigger and better trained transformers yielded only a marginal improvement over the smaller
BERT-base transformer. In our case, although ALBERT-Large did perform better than BERT-base,
fake news classification accuracy did not scale in proportion to the transformer size.</p>
        <p>The most important insights resulted from testing beyond accuracy scores. Flaws were found
and these led to questioning the whole idea of language-based classification of content according
to deception or veracity. Issues were also identified with the LIAR dataset and these flaws were
used to test the efect that data quality has on the models’ ability to learn the task. Specifically,
we show that although the models’ accuracy on LIAR is better than random, the language
transformers’ contribution to the classification was generally poorer when trained and tested
on cleaner data.</p>
        <p>3Good models give a high accuracy. These models give a high accuracy; therefore, they are good. This is a
logical fallacy known as Afirming the Consequent.</p>
        <p>Furthermore, when compared with sentiment classification, fake news classification appears
to be an unstable problem. We put forward arguments that suggest that purely NLP-based,
fake-news classification on short statements, such as those found in LIAR, is not robust since it
presents traits of ill-posed and ill-conditioned problems.</p>
        <p>A simple test indicates that these models are not really modelling deception or veracity and
are thus vulnerable to adversarial attacks.</p>
        <p>The models herein, while improving on previous accuracies were thus proven unreliable for
classifying arbitrary claims. The biggest contributor to the higher score was the reputation
score which was shown to bias the models.</p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Future Work</title>
        <p>We used only the text and the speaker’s reputation in our tests, achieving a better score. An
ablation study can also be done to analyse the impact of each attribute on the result.</p>
        <p>Future studies can attempt similar investigations with the use of constructed features like
part-of-speech tagging or dependency parsing together with those utilised internally by the
transformer.</p>
        <p>It would also be interesting to establish and standardise a variety of tests and metrics to assess
the quality of a fake news classifier, by testing behaviour rather than mere accuracy scores; such
as the ability to truly model veracity, stability (whether it is well conditioned or not), its ability
to generalise over domains, and tests for bias. The ability to truly model veracity or deception
deserves particular attention in future work, since it determines a classifier’s robustness against
adversarial attacks.</p>
      </sec>
      <sec id="sec-5-3">
        <title>5.3. Recommendations</title>
        <sec id="sec-5-3-1">
          <title>Researchers need to be aware of the flaws in the LIAR dataset.</title>
          <p>Future studies are recommended to treat purely NLP-based, fake news detection as ill-posed,
especially those utilising arbitrary or non-explainable features. Using knowledge-graphs to
store knowledge about the real world, is likely one potential way to regularise the ill-posed
problem.</p>
          <p>Lastly, our models stand as examples of why analysis of a model’s behaviour should be a
better judge of how good the model is, rather than mere accuracy. Going forward, we believe
this to be essential for mitigating the fake news problem efectively.
[20] Z. Zhou, H. Guan, M. Bhat, J. Hsu, Fake news detection via NLP is vulnerable to
adversarial attacks, Proceedings of the 11th International Conference on Agents and Artificial
Intelligence (ICAART 2019) (2019).
[21] D. B. Buller, J. K. Burgoon, Interpersonal deception theory, Communication Theory 6
(1996) 203–242.
[22] J. K. Burgoon, D. B. Buller, C. H. White, W. Afi, A. L. S. Buslig, The role of conversational
involvement in deceptive interpersonal interactions, Personality and Social Psychology
Bulletin 25 (1999) 669–686.</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Coleman</surname>
          </string-name>
          , 'Hundreds dead' because of Covid-
          <volume>19</volume>
          misinformation,
          <year>2020</year>
          . URL: https: //www.bbc.com/news/world-53755067.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>W. Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          , “Liar, Liar Pants on Fire”
          <article-title>: A new benchmark dataset for fake news detection, in: Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics</article-title>
          (Volume
          <volume>2</volume>
          :
          <string-name>
            <surname>Short</surname>
            <given-names>Papers)</given-names>
          </string-name>
          , ACL, Vancouver, Canada,
          <year>2017</year>
          , pp.
          <fpage>422</fpage>
          -
          <lpage>426</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , BERT:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <source>in: Proceedings of NAACL-HLT</source>
          <year>2019</year>
          ,
          <article-title>Minneapolis</article-title>
          , USA,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          , V. Stoyanov,
          <article-title>RoBERTa: A robustly optimized BERT pretraining approach</article-title>
          , CoRR abs/
          <year>1907</year>
          .11692 (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Goodman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Gimpel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Sharma</surname>
          </string-name>
          , R. Soricut,
          <string-name>
            <surname>ALBERT:</surname>
          </string-name>
          <article-title>A lite BERT for self-supervised learning of language representations</article-title>
          ,
          <year>2020</year>
          .
          <article-title>a r X i v : 1 9 0 9 . 1 1 9 4 2</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Zafarani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shu</surname>
          </string-name>
          , H. Liu, Fake News Research: Fundamental Theories,
          <string-name>
            <given-names>Detection</given-names>
            <surname>Strategies</surname>
          </string-name>
          &amp; Open Problems,
          <year>2019</year>
          . URL: https://www.fake
          <article-title>-news-tutorial</article-title>
          .com.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kirilin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Strube</surname>
          </string-name>
          ,
          <article-title>Exploiting a speakers credibility to detect fake news</article-title>
          ,
          <source>in: Proceedings of Data Science, Journalism &amp; Media workshop at KDD (DSJM18)</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>C.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <article-title>A two-stage model based on BERT for short fake news detection</article-title>
          , in: C.
          <string-name>
            <surname>Douligeris</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Karagiannis</surname>
          </string-name>
          , D. Apostolou (Eds.),
          <string-name>
            <surname>Knowledge</surname>
            <given-names>Science</given-names>
          </string-name>
          , Engineering and Management,
          <year>2019</year>
          , pp.
          <fpage>172</fpage>
          -
          <lpage>183</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Bojanowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Grave</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joulin</surname>
          </string-name>
          , T. Mikolov,
          <article-title>Enriching word vectors with subword information, Transactions of the Association for Computational Linguistics 5 (</article-title>
          <year>2017</year>
          )
          <fpage>135</fpage>
          -
          <lpage>146</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Hadamard</surname>
          </string-name>
          ,
          <article-title>Sur les problèmes aux derivées partielles et leur signification physique</article-title>
          , Princeton University Bulletin (
          <year>1902</year>
          )
          <fpage>49</fpage>
          -
          <lpage>52</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>P.</given-names>
            <surname>Yee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Haykin</surname>
          </string-name>
          ,
          <article-title>Pattern classification as an ill-posed, inverse problem: a regularization approach</article-title>
          , in: 1993 IEEE International Conference on Acoustics,
          <source>Speech, and Signal Processing</source>
          , volume
          <volume>1</volume>
          ,
          <year>1993</year>
          , pp.
          <fpage>597</fpage>
          -
          <lpage>600</lpage>
          vol.
          <volume>1</volume>
          . doi:
          <article-title>1 0 . 1 1 0 9 / I C A S S P</article-title>
          .
          <volume>1 9 9 3 . 3 1 9 1 8 9 .</volume>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>S. I. Kabanikhin</surname>
          </string-name>
          ,
          <article-title>Definitions and examples of inverse and ill-posed problems</article-title>
          ,
          <source>Journal of Inverse and Ill-posed Problems</source>
          <volume>16</volume>
          (
          <year>2008</year>
          )
          <fpage>317</fpage>
          -
          <lpage>357</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Mifsud</surname>
          </string-name>
          , “
          <article-title>To Trust a LIAR”: Does machine learning really classify fine-grained, fake news statements? (Bachelor's dissertation</article-title>
          ),
          <year>2020</year>
          . URL: https://www.um.edu.mt/library/ oar/handle/123456789/76880.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>R.</given-names>
            <surname>Socher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Perelygin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chuang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Potts</surname>
          </string-name>
          ,
          <article-title>Recursive deep models for semantic compositionality over a sentiment treebank</article-title>
          ,
          <source>in: Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing</source>
          , ACL, Seattle, Washington, USA,
          <year>2013</year>
          , pp.
          <fpage>1631</fpage>
          -
          <lpage>1642</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Long</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.-R.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <article-title>Fake news detection through multi-perspective speaker profiles</article-title>
          ,
          <source>in: Proceedings of the Eighth International Joint Conference on Natural Language Processing</source>
          (Volume
          <volume>2</volume>
          :
          <string-name>
            <surname>Short</surname>
            <given-names>Papers)</given-names>
          </string-name>
          , Taipei, Taiwan,
          <year>2017</year>
          , pp.
          <fpage>252</fpage>
          -
          <lpage>256</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>H.</given-names>
            <surname>Karimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Saba-Sadiya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          <article-title>, Multi-source multi-class fake news detection</article-title>
          ,
          <source>in: Proceedings of the 27th International Conference on Computational Linguistics</source>
          ,
          <string-name>
            <given-names>ACL</given-names>
            ,
            <surname>Santa</surname>
          </string-name>
          <string-name>
            <surname>Fe</surname>
          </string-name>
          , New Mexico, USA,
          <year>2018</year>
          , pp.
          <fpage>1546</fpage>
          -
          <lpage>1557</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>T. T.</given-names>
            <surname>Pham</surname>
          </string-name>
          ,
          <article-title>A study on deep learning for fake news detection</article-title>
          ,
          <year>2018</year>
          . URL: https://core.ac. uk/download/pdf/156904536.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>T.</given-names>
            <surname>Gröndahl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Asokan</surname>
          </string-name>
          ,
          <article-title>Text analysis in adversarial settings: Does deception leave a stylistic trace</article-title>
          ?,
          <year>2019</year>
          .
          <article-title>a r X i v : 1 9 0 2 . 0 8 9 3 9</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>J. Y.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. T. I.</given-names>
            <surname>Khondaker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Iqbal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Afroz</surname>
          </string-name>
          ,
          <article-title>A benchmark study on machine learning methods for fake news detection</article-title>
          , CoRR abs/
          <year>1905</year>
          .04749 (
          <year>2019</year>
          ).
          <article-title>a r X i v : 1 9 0 5 . 0 4 7 4 9</article-title>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>