<!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>Ital-IA</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Novel continual learning techniques on noisy label datasets</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Monica Millunzi</string-name>
          <email>monica.millunzi@unimore.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lorenzo Bonicelli</string-name>
          <email>lorenzo.bonicelli@unimore.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alberto Zurli</string-name>
          <email>alberto.zurli@axyon.ai</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessio Salman</string-name>
          <email>alessio.salman@axyon.ai</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jacopo Credi</string-name>
          <email>jacopo.credi@axyon.ai</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Simone Calderara</string-name>
          <email>simone.calderara@unimore.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>AImageLab - Università di Modena e Reggio Emilia</institution>
          ,
          <addr-line>Modena</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Axyon AI</institution>
          ,
          <addr-line>Modena</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Workshop Proce dings</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>3</volume>
      <fpage>29</fpage>
      <lpage>31</lpage>
      <abstract>
        <p>Many Machine Learning and Deep Learning algorithms are widely used with remarkable success in scenarios whose benchmark datasets consist of reliable data. However, they often struggle to handle realistic scenarios, particularly those in the financial sector, where available data constantly vary, increase daily, and may contain noise. As a result, we present an overview of the ongoing research at the AImageLab research laboratory of the University of Modena and Reggio Emilia, in collaboration with AxyonAI, focused on exploring Continual Learning methods in the presence of noisy data, with a special focus on noisy labels. To the best of our knowledge, this is a problem that has received limited attention from the scientific community thus far.</p>
      </abstract>
      <kwd-group>
        <kwd>deep learning</kwd>
        <kwd>finance</kwd>
        <kwd>noisy label</kwd>
        <kwd>noise</kwd>
        <kwd>classification</kwd>
        <kwd>continual learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The use of artificial neural networks, enabled by the
availability of large datasets, has yielded remarkable results
sequently, finance. Recently, an increasing trend has
emerged to enhance investment performance via the use
of Deep Learning methods to forecast market price
fluctuations. This provides asset managers with valuable
els, as well as analyzing portfolio performance under
uncertain circumstances. However, these applications
are often afected by the high complexity and volatility
of the financial market, which makes them susceptible
to noisy data. One major reason is the unpredictable and
often irrational behaviour of market participants that
can cause sudden and unexpected changes(see the latest
event at SVB [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]). Furthermore, financial data is often
subject to measurement errors, data gaps, class overlap,
and contexts where labels are ambiguous or subjective.
      </p>
      <sec id="sec-1-1">
        <title>Additionally, other external factors such as geopolitical events and economic policies can significantly contribute to adding noise to the data. Therefore, the prediction problems in this domain involve datasets with several</title>
        <p>nEvelop-O</p>
        <p>
          0000-0001-7090-7159 (M. Millunzi); 0000-0002-9717-5602
(L. Bonicelli); 0000-0003-2656-2696 (A. Salman);
0000-0003-2656-2696 (J. Credi); 0000-0001-9056-1538 (S. Calderara)
challenges: (i) uncertain labels, (ii) imbalanced classes,
and (iii) data that change significantly over time, leading
to the well-known problem of concept drift [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. While
DNNs represent a strong tool for simple classification
appropriately in standard deep learning scenarios for
two main reasons: data comes continually from
nonstationary environments and may change with high
frequency, causing the data drifting phenomenon. This
to learn from the most recent data. Indeed, as new data
arrive as a stream, the network naturally adapts to the
last-seen ones, making it prone to forget the previously
acquired knowledge. This aspect is usually not
considered, assuming that old financial trends do not afect
future ones. Conversely, market trends are often cyclical;
hence, making financial models retain the knowledge
of past data while learning from the most recent ones
may make them more reliable in already-experienced
market conditions. By using Continual Learning
techniques, models can adapt to changing financial data and
improve their predictive power over time. Therefore, the
application of CL to finance has the potential to enhance
investment performance by providing more accurate and
reliable predictions in the face of noisy data.
        </p>
      </sec>
      <sec id="sec-1-2">
        <title>The research under discussion endeavours to explore complex CL scenarios that involve training data with incorrect and noisy labels.</title>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Related</title>
    </sec>
    <sec id="sec-3">
      <title>Works</title>
      <sec id="sec-3-1">
        <title>There is a growing body of work on the application of machine learning techniques to financial problems. The</title>
        <p>
          ifnancial machine learning techniques in [
          <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
          ]. In this
        </p>
        <p>
          © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License interested reader can find a comprehensive overview of
work, however, we are specifically interested in the prob- ing without Forgetting [20] (LwF) employs Knowledge
lem of training supervised models with noisy financial Distillation (KD) to distill the model learned during past
labels in a continual learning scenario. Both problems tasks into the current one. Parameter-isolation
methhave been studied independently, see e.g. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] for the for- ods explicitly define a separate sub-network per task to
mer and [
          <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
          ] for the latter. avoid interference between the parameters during
learn
        </p>
        <p>
          Let us now delve more deeply into the two problems ing. Notably, in Progressive Neural Networks [21] (PNN)
separately to show an overview of the state-of-the-art the learner is expanded at each subsequent task, while in
contribution in both fields, which will then allow us to Context-dependent Gating [22] (XdG) only sparse, mostly
deal with the current existing works that address both non-overlapping patterns of units are active for any task.
continual learning ad noisy labels simultaneously. While these methods usually achieve high performance,
they usually rely on the knowledge of the task identity
2.1. Noisy Labels during inference, thus limiting their applicability to real
scenarios. Finally, Reharsal methods [23, 24] are based
Learning with noisy labels (LNL) is a common and long- on the idea of interleaving data for the current task with
standing challenge in many machine learning applica- a bufer of data from the previous ones, a strategy
comtions, where the labels assigned to the data points may monly referred to as Experience Replay (ER). iCARL [25]
not be entirely accurate. Consequently, the model perfor- combines replay with KD and uses the herding strategy
mances tend to degrade rapidly with respect to classical to select the most representative samples for each class.
scenarios since DNNs can easily overfit noisy labels and DER [26] and X-DER [27] use the past responses of the
show poor generalization performances. In this study, model as a means for knowledge distillation.
we focus mostly on the supervised classification
learning task. In [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] the authors present a comprehensive 2.3. Continual with Noisy Labels
overview of the existing approaches proposed to enhance
the robustness of models against noisy labels. We can Bridging the gap between CL and LNL, a preliminary
distinguish two main types of methods: those that at- work [28] proposes a self-supervised loss term to learn a
tempt to learn the noise transition matrix and those that representation that is independent of label noise, while
prioritize cleaning the data stream before using it to train distilling a small, purified bufer of samples for later use
the model. The former approach focuses on building a ro- in fine-tuning and classification. Although this method
bust architecture that is capable to estimate a noise model achieves good initial performance when compared with
that captures the label distribution pattern [
          <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
          ]. In- common CL baselines, its learning objective features a
stead, the latter approach addresses the issue of keeping low sample eficiency which limits its real-world
applitraining data as clean as possible via various “sample- cability. To address this limitation, [29] exploits the loss
selection” techniques that try to identify clean examples diference between correct and noisy samples to split
based on the small-loss hypothesis [
          <xref ref-type="bibr" rid="ref11 ref12 ref13">11, 12, 13</xref>
          ] and then the incoming data, using the latter as unlabeled data in
apply semi-supervised learning to re-label the leftover a FixMatch [30] objective. Finally, in [31] the authors
and hence train on the whole training set. Notably, some seek a balance between the purity and the efectiveness
methods [
          <xref ref-type="bibr" rid="ref14 ref15 ref16">14, 15, 16</xref>
          ] feature a two-component Gaussian of samples stored in the bufer. To achieve this, they
Mixture Model to model and split the loss distribution of promote the removal of samples from the bufer based
correctly-labeled and incorrectly-labeled examples. on a combination of the sample loss with a measure of
diversity in the bufer.
        </p>
        <sec id="sec-3-1-1">
          <title>2.2. Continual Learning</title>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>The field of Continual Learning ( CL) seeks to learn from</title>
        <p>a non-stationary non-i.i.d. stream of data without
incurring the forgetting problem. Methods that tackle CL
are commonly categorized into three main groups [17].
Regularization-based methods introduce regularization
terms to prevent significant changes in the performance
of the model on past tasks. Elastic Weight
Consolidation (EWC) [18] and Synaptic Intelligence (SI) [19] seek
to prevent parameters deemed as important for the
current task from changing in the future. In EWC, the
importance of each parameter is estimated as the Fisher
information matrix while SI preserves connections that
strongly afected the past task loss. Diferently,
Learn</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3. Datasets with noisy labels</title>
      <sec id="sec-4-1">
        <title>Researchers have developed several datasets specifically</title>
        <p>designed to address the challenge of LNL. Although these
consist of images and therefore difer from the typical
ifnancial datasets, we are interested in understanding
model response to noise, regardless of the data itself.</p>
        <p>Here, we briefly describe the dataset commonly used in
LNL literature:
• Clothing1M: this large-scale dataset contains
1 million images of clothing items from
diferent online stores. The labels for the images were
be the input and ground-truth label space respectively. the latter, since in this controlled scenario, we know
obtained through a web search and thus may con- identically distributed according to a certain data
gentain incorrect labels.
•</p>
        <p>WebVision: this dataset contains over 2.4 mil- comes from a noisy distribution  =̃ {(  ,  ̃ )}

=1 , with  ̃
lion images from 1000 diferent categories
collected from the web. The dataset has been used
for various tasks such as image classification,
object detection, and fine-grained recognition under
noisy label scenarios.
• CIFAR-10-N and CIFAR-100-N [32]: these are</p>
        <p>Amazon Mechanical Turk1.
variations of the popular CIFAR-10 and
CIFAR100 datasets [33] respectively, with
humanannotated real-world noisy labels collected from</p>
      </sec>
      <sec id="sec-4-2">
        <title>Overall, these datasets provide valuable resources for developing and evaluating machine learning models under noisy label scenarios, which are common in many real-world applications.</title>
        <p>In addition to these, another popular choice consists in
artificially applying noise on the annotations of a clean
dataset by flipping the label with a fixed probability. Such
a synthetic setting is particularly helpful since the
availability of ground-truth labels, coupled with the noisy
ones, facilitates monitoring models’ behaviour with
respect to diferent noise patterns.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. Problem formulation</title>
      <sec id="sec-5-1">
        <title>For this proof preliminary analysis, we focus on a  -class</title>
        <p>image classification</p>
        <p>problem, which we split in   -fold
classification tasks. Let  ∈ ℛ  ×
and  ∈ {1, … , }
{(  ,  
In a standard CL setting, each task receives data   =

)}=1 , where each pair (  ,   ) is independently and
1https://www.mturk.com
erating distribution. Instead, in the LNL scenario, data
being the noisy label space. Here, we assume that the
corruption process that produces  ̃ from  is independent
of the input data; hence, one true label may be flipped
into another label with equal probability (noise rate). We
will refer to this process as “symmetric noise”.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>5. Experiments</title>
      <p>For the sake of simplicity and a fair comparison
with other existing works [28, 29], we will conduct
experiments on CIFAR-10. This consists of 60000 32×32
images, usually split into 50000 images for the training
set and 10000 for the test set. The classification task
involves 10 non-overlapping classes and the number of
examples per class is uniform. We modify the dataset
by adding symmetric noise in each of the classes. To
be compliant with Class-IL scenario [17], we split the
10-fold classification into 5 binary tasks and let the model
learn from each one sequentially. We denote the version
of the dataset obtained by such two modifications as
Split-N-CIFAR-10.</p>
      <p>
        As emerges from [28, 29, 31], keeping the memory
bufer as clean as possible during training is a key aspect
of dealing with the label noise issue in a continual
learning scenario. Therefore, we decided to test the GMM
technique used in [
        <xref ref-type="bibr" rid="ref14 ref15">15, 14</xref>
        ] to separate exemplars into
noisy and clean against a strategy we call “oracle”. For
which samples are associated with a noisy label, we can
use this information to prevent all the noisy ones from
being stored inside the replay bufer. Both techniques
are tested using ER-ACE as a base strategy for CL. This
method extends the common Experience Replay baseline
by adding an asymmetrical cross-entropy loss between
stream and bufer examples.
      </p>
      <p>We used the ResNet18 [35] model initialized from scratch
and trained with Stochastic Gradient Descent (SGD) for
50 epochs per task, in a standard ofline fashion.
Additionally, to allow comparison against [28, 29] we evaluate
the online (single epoch) scenario.</p>
      <sec id="sec-6-1">
        <title>5.1. Results</title>
        <sec id="sec-6-1-1">
          <title>In Table 1 we report performances in terms of Final Av</title>
          <p>erage Accuracy (FAA) at the end of all tasks. Results are
averaged across five runs and the bufer size is set to 500.
We provide a lower and an upper bound, respectively
finetuning without any countermeasure to forgetting and
“Multitask”, given by training all tasks jointly. Expectedly,
the model is strongly afected by the presence of noise,
and indeed its performances decrease as the noise rate
increases. When in presence of low noise levels (20%),
the standard ER-ACE model and its variants with bufer
cleaning techniques perform on par, whereas for noise
levels above 40%, the model seems to benefit from
replaying a clean bufer. Surprisingly, in some scenarios the
adoption of the GMM makes the model outperform the
oracle for the same noise conditions, suggesting that
having some noisy examples stored in the bufer may reduce
generalization error by providing some extra
regularization. Finally, while the GMM-based bufer cleaning
provides an initial benefit, by looking at results from
the online scenario it is clear that using semi-supervised
learning on mislabeled examples (as CNLL does) provides
a significant boost in terms of performance.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>6. Conclusion</title>
      <sec id="sec-7-1">
        <title>In this manuscript, we have investigated the challenging</title>
        <p>problem of learning from non-stationary and noisy data,
which is highly relevant to the domain of financial data
analysis. Through a joint efort between the
AImageLab research laboratory at the University of Modena and
Reggio Emilia and AxyonAI, we have conducted a
preliminary analysis to assess the efectiveness of
rehearsalbased continual learning baselines equipped with
common label noise learning strategies. Our findings shed
light on the complex interaction between these
challenging fields and provide a proof of concept for future
research in this area.
Identifying mislabeled data using the area under the lini, E. D. Cubuk, A. Kurakin, H. Zhang, C. Rafel,
margin ranking, Advances in Neural Information Fixmatch: Simplifying semi-supervised learning
Processing Systems 33 (2020) 17044–17056. with consistency and confidence, arXiv preprint
[17] G. M. van de Ven, A. S. Tolias, Three continual learn- arXiv:2001.07685 (2020).</p>
        <p>ing scenarios, in: Neural Information Processing [31] J. Bang, H. Koh, S. Park, H. Song, J.-W. Ha, J. Choi,
Systems Workshops, 2018. Online continual learning on a contaminated data
[18] J. Kirkpatrick, R. Pascanu, N. Rabinowitz, J. Veness, stream with blurry task boundaries, in: Proceedings
G. Desjardins, A. A. Rusu, K. Milan, J. Quan, T. Ra- of the IEEE/CVF Conference on Computer Vision
malho, A. Grabska-Barwinska, et al., Overcoming and Pattern Recognition, 2022, pp. 9275–9284.
catastrophic forgetting in neural networks, Pro- [32] J. Wei, Z. Zhu, H. Cheng, T. Liu, G. Niu, Y. Liu,
ceedings of the national academy of sciences 114 Learning with noisy labels revisited: A study
us(2017) 3521–3526. ing real-world human annotations, arXiv preprint
[19] F. Zenke, B. Poole, S. Ganguli, Continual learning arXiv:2110.12088 (2021).</p>
        <p>through synaptic intelligence, in: International [33] A. Krizhevsky, et al., Learning multiple layers of
feaConference on Machine Learning, 2017. tures from tiny images, Technical Report, Citeseer,
[20] Z. Li, D. Hoiem, Learning without forgetting, IEEE 2009.</p>
        <p>Transactions on Pattern Analysis and Machine In- [34] L. Caccia, R. Aljundi, N. Asadi, T. Tuytelaars,
telligence (2017). J. Pineau, E. Belilovsky, New insights on reducing
[21] A. A. Rusu, N. C. Rabinowitz, G. Desjardins, abrupt representation change in online continual
H. Soyer, J. Kirkpatrick, K. Kavukcuoglu, R. Pascanu, learning, arXiv preprint arXiv:2203.03798 (2022).
R. Hadsell, Progressive neural networks, arXiv [35] K. He, X. Zhang, S. Ren, J. Sun, Deep residual
preprint arXiv:1606.04671 (2016). learning for image recognition. arxiv 2015, arXiv
[22] N. Y. Masse, G. D. Grant, D. J. Freedman, Alleviating preprint arXiv:1512.03385 14 (2015).
catastrophic forgetting using context-dependent
gating and synaptic stabilization, Proceedings
of the National Academy of Sciences 115 (2018)</p>
        <p>E10467–E10475.
[23] R. Ratclif, Connectionist models of recognition
memory: constraints imposed by learning and
forgetting functions., Psychological Review (1990).
[24] A. Robins, Catastrophic forgetting, rehearsal and</p>
        <p>pseudorehearsal, Connection Science (1995).
[25] S.-A. Rebufi, A. Kolesnikov, G. Sperl, C. H. Lampert,
iCaRL: Incremental classifier and representation
learning, in: Proceedings of the IEEE conference
on Computer Vision and Pattern Recognition, 2017.
[26] P. Buzzega, M. Boschini, A. Porrello, D. Abati,</p>
        <p>S. Calderara, Dark Experience for General
Continual Learning: a Strong, Simple Baseline, in:
Advances in Neural Information Processing Systems,
2020.
[27] M. Boschini, L. Bonicelli, P. Buzzega, A. Porrello,</p>
        <p>S. Calderara, Class-incremental continual learning
into the extended der-verse, IEEE Transactions on</p>
        <p>Pattern Analysis and Machine Intelligence (2022).
[28] C. D. Kim, J. Jeong, S. Moon, G. Kim, Continual
learning on noisy data streams via self-purified
replay, in: Proceedings of the IEEE/CVF international
conference on computer vision, 2021, pp. 537–547.
[29] N. Karim, U. Khalid, A. Esmaeili, N. Rahnavard, Cnll:</p>
        <p>A semi-supervised approach for continual noisy
label learning, in: Proceedings of the IEEE/CVF
Conference on Computer Vision and Pattern
Recognition, 2022, pp. 3878–3888.
[30] K. Sohn, D. Berthelot, C.-L. Li, Z. Zhang, N.
Car</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Fennell</surname>
          </string-name>
          , Svb financial group: Santa clara, california,
          <source>Fed. Res. Bull</source>
          .
          <volume>107</volume>
          (
          <year>2021</year>
          )
          <fpage>49</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Tsymbal</surname>
          </string-name>
          ,
          <article-title>The problem of concept drift: definitions and related work</article-title>
          , Computer Science Department, Trinity College Dublin 106 (
          <year>2004</year>
          )
          <fpage>58</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>M. L. De Prado</surname>
          </string-name>
          ,
          <article-title>Advances in financial machine learning</article-title>
          , John Wiley &amp; Sons,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M. F.</given-names>
            <surname>Dixon</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Halperin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bilokon</surname>
          </string-name>
          , Machine learning in Finance, volume
          <volume>1170</volume>
          , Springer,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.-H.</given-names>
            <surname>Lien</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-S.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-S.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Uncertainty awareness for predicting noisy stock price movements</article-title>
          ,
          <source>in: Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD</source>
          <year>2022</year>
          , Grenoble, France,
          <source>September 19-23</source>
          ,
          <year>2022</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>VI</given-names>
          </string-name>
          , Springer,
          <year>2023</year>
          , pp.
          <fpage>154</fpage>
          -
          <lpage>169</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Philps</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Weyde</surname>
          </string-name>
          , A. d. Garcez,
          <string-name>
            <given-names>R.</given-names>
            <surname>Batchelor</surname>
          </string-name>
          ,
          <article-title>Continual learning augmented investment decisions</article-title>
          , arXiv preprint arXiv:
          <year>1812</year>
          .
          <volume>02340</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Zurli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bertugli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Credi</surname>
          </string-name>
          ,
          <article-title>Does catastrophic forgetting negatively afect financial predictions?</article-title>
          ,
          <source>in: Machine Learning, Optimization, and Data Science: 8th International Workshop</source>
          , LOD 2022,
          <article-title>Certosa di Pontignano</article-title>
          , Italy,
          <source>September 19-22</source>
          ,
          <year>2022</year>
          ,
          <string-name>
            <given-names>Revised</given-names>
            <surname>Selected</surname>
          </string-name>
          <string-name>
            <given-names>Papers</given-names>
            ,
            <surname>Part</surname>
          </string-name>
          <string-name>
            <surname>I</surname>
          </string-name>
          , Springer,
          <year>2023</year>
          , pp.
          <fpage>501</fpage>
          -
          <lpage>515</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>H.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-G.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Learning from noisy labels with deep neural networks: A survey</article-title>
          ,
          <source>IEEE Transactions on Neural Networks and Learning Systems</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <article-title>Webly supervised learning of convolutional networks</article-title>
          ,
          <year>2015</year>
          .
          <article-title>a r X i v : 1 5 0 5 . 0 1 5 5 4</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>T.</given-names>
            <surname>Xiao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Learning from massive noisy labeled data for image classification</article-title>
          ,
          <source>in: Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>2691</fpage>
          -
          <lpage>2699</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Leung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.-J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fei-Fei</surname>
          </string-name>
          ,
          <article-title>Mentornet: Learning data-driven curriculum for very deep neural networks on corrupted labels</article-title>
          ,
          <source>in: International Conference on Machine Learning</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>B.</given-names>
            <surname>Han</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Niu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Tsang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sugiyama</surname>
          </string-name>
          , Co-teaching:
          <article-title>Robust training of deep neural networks with extremely noisy labels</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>31</volume>
          (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>H.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-G.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <article-title>Selfie: Refurbishing unclean samples for robust deep learning</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>5907</fpage>
          -
          <lpage>5915</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>E.</given-names>
            <surname>Arazo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ortego</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Albert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. O</given-names>
            <surname>'Connor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>McGuinness</surname>
          </string-name>
          ,
          <article-title>Unsupervised label noise modeling and loss correction</article-title>
          ,
          <source>in: International conference on machine learning, PMLR</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>312</fpage>
          -
          <lpage>321</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Socher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. C.</given-names>
            <surname>Hoi</surname>
          </string-name>
          ,
          <article-title>Dividemix Learning with noisy labels as semi-supervised learning</article-title>
          ,
          <source>in: International Conference on Learning Representations</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>G.</given-names>
            <surname>Pleiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , E. Elenberg,
          <string-name>
            <given-names>K. Q.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          ,
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>