<!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>Evolutionary optimization techniques to enhance deep learning</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Ph.D. student in Mathematics</institution>
          ,
          <addr-line>Computer Science</addr-line>
          ,
          <institution>Statistics at University of Perugia Tutors: Marco Baioletti</institution>
          ,
          <addr-line>Valentina Poggioni</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>The target of my research program is to nd new approaches to train Neural Networks (NN), in particular using Evolutionary Algorithms (EA). This area of research, called Neuroevolution, studies the optimization of topology and weights of neural networks. The EAs are meta-algorithms, which have many advantages with respect to classical optimization techniques based on gradient descent (GD): (i) the loss function does not need to be di erentiable, (ii) they do less likely get stuck in local minima, (iii) they are easy to parallelize. The rst approach was the application of Di erential Evolution (DE) to NNs for supervised problems, and the results were promising. Moreover, the advantages abovementioned are the reasons why the EAs are largely used in other machine learning task, like Reinforcement Learning. Consequently, the application of EAs as NNs optimizer for Reinforcement Learning will be my future research subject.</p>
      </abstract>
      <kwd-group>
        <kwd>Neuroevolution Machine Learning Evolutionary Algorithms Reinforcement Learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Supervised Learning is a Machine Learning task where a function is inferred
from examples composed of a pair of input and corresponding output. To tackle
this task many models were proposed. Among the most important model is
the Arti cial Neural Network (ANN), which tries to emulate the human brain
behaviour through a weighted graph.</p>
      <p>The usual method used to train the weights of Neural Network is the
Backpropagation (BP) with stochastic gradient descent (SGD), which minimizes the
loss function that evaluates the error between the NN outputs and the expected
outputs. The minimization is achieved through the modi cation of the Neural
Network weights. BD with SGD is an iterative local-convergence method which
needs a loss function di erentiable, and it is hard to parallelize.</p>
      <p>There are other ways to train a Neural Network; one of them is the use
of meta-algorithms coming from the Neuroevolution eld. There are many
advantages in using EAs. First of all, they can optimize functions which are not
di erentiable, since no derivatives are calculated by these algorithms. Then, EAs
are less likely to get stuck in local minima. They use a pool of solutions,
combined with greedy methods, in order to create new solutions which explore most
of the search space. Finally, EAs are easy to parallelize. In fact, they usually
use pointwise operators, which can be concurrently applied to di erent solutions
belonging to the same pool. However, there are some disadvantages, in fact,
EAs su ers from stagnation problem and they are slower to converge in a local
minimum.</p>
      <p>With the aim to exploit the advantages of EAs, my research program has
focused on the studying of the Di erential Evolution (DE). DE is an Evolutionary
Algorithm, which is used to optimize real-valued functions without the
gradient. The DE is a composition of four meta-operations: Initialization, Mutation,
Crossover, Selection. For each operator, there are many variants developed in
order to improve DE performances. Moreover, the DE has two hyperparameters,
the rst one is F used by Mutation operator, and the other one is the used by
Crossover operator. These parameters are essential for reaching the convergence.
For this reason, there exist many self-adaptive methods of the DE
hyperparameters.</p>
      <p>The idea is to use DE as an optimizer of Deep Neural Networks. So, a batching
system was proposed in order to reduce the computation time. Moreover, in order
to nd the best combination of the operators (and their parameters), they have
been tuned through a Quade test analysis on several datasets.</p>
      <p>
        Another application of NNs is Algorithm Learning, i.e the Machine Learning
task where an algorithm is inferred from examples. The rst model proposed by
Alex Graves at. al. is called Neural Turing Machine (NTM) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. That model uses
an NN as transition function of Turing machine. The NTM, in order to be fully
di erentiable, uses a fuzzy representation of the Turing machine states. Then,
given the advantages of DE compared to classical methods, it was proposed in
order to infer the transition function.
      </p>
    </sec>
    <sec id="sec-2">
      <title>State of the Art</title>
      <p>
        The common way for the training a NN in Supervised Learning approach is the
Backpropagation with Stochastic Gradient [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. This method is widely used both
in the business application and in research elds.
      </p>
      <p>On the other hand, Neuroevolution is not very common for business
application. This is the reason why using EAs as NNs optimizer is a problem which
lacks a properly de ned state-of-the-art.</p>
      <p>
        Anyway, the dominating approach used in Neuroevolution is the genetic one
[
        <xref ref-type="bibr" rid="ref14 ref18 ref5">5, 14, 18</xref>
        ], which is generally used to optimize the connections of a NN. That
approach is also used to optimize weights but, being a discrete approach, it
needs an encoding phase. The encoding phase is crucial and heavily
domaindependent.
      </p>
      <p>
        Another way is the use of Evolutionary Algorithms which work on real values
such as DE. There are many papers on the application of DE as an optimizer
for small NNs. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] the Di erential Evolution is used, with the most known
variants, as the NN optimizer without a batching system (entire dataset is used
during the training phase) for problems with the small domain. Another paper
is [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], where the Limited Evaluation Evolutionary Algorithm (LEEA), quite
similar to the DE, is used with a batching system (but without tness
inheritance) in order to train di erent NNs on small problems. After the publication
of my preliminary results Prellberg and Kramer, in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], approached the MNIST
problem with a small Convolutional Neural Network (CNN). Such network,
optimized rst through Backpropagation and then with their own EA, achieved
the same accuracy, which is 97% and it is not too far from the state of the art.
      </p>
      <p>
        Another Machine learning eld, where Neuroevolution is growing up, is the
Reinforcement Learning [
        <xref ref-type="bibr" rid="ref16 ref17 ref6">16, 17, 6</xref>
        ]. Regarding Reinforcement learning, EA
algorithms are common both in the business application and in the research eld [
        <xref ref-type="bibr" rid="ref16 ref17 ref6">16,
17, 6</xref>
        ]. In particular, there are some cases where the use of the EAs gives better
results than temporal di erence methods (e.g. Q-Learning) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>Contributions</title>
      <p>
        In my master thesis, I proposed the design and the development of a machine
learning method based on DE for neural network optimization: DENN (Di
erential Evolution for Neural Networks). For DENN, I developed a batching system
with an e ective tness inheritance method, which permitted the use of DE as a
Feedforward Neural Networks optimizer for real Supervised classi cation
problems. The algorithm and the related tests are presented in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The results of the
tests are comparable to the ones obtained using BP with SGD.
      </p>
      <p>
        After the thesis, I continued to study and develop variants of DE in order to
improve DENN. During my rst Ph.D. year, I focused on trying all the common
variants of DE and its operators in order to determine which of them was the
best for NNs training. Moreover, during this phase, I developed a new Crossover
operator, called interm, which has proven to work well. The operators (and their
parameters) have been tuned through a Quade test analysis performed on several
datasets. The results of the analysis and the interm implementation are shown
in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        Subsequently, I worked on the application of DENN on Machine Learning
tasks where the classic methods do not perform well; I developed a variant of
DENN which uses a model based on Neural Turing Machines (NTM) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] called
Neural Random-Access Machines (NRAM) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The NRAM is a model inspired
by CPUs which features a controller, registers, a memory, and many
operators. The controller is a trainable Feedforward Neural Network called Neural
Controller, which represents the program to infer and which resolves a problem
through explicit manipulation and referencing of pointers. The results are close
to the ones in the original paper where the authors used Backpropagation with
ADAM [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and curriculum learning [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
    </sec>
    <sec id="sec-4">
      <title>Research Methodology and Approach</title>
      <p>Some of the objectives of my proposal were already achieved: rst, I designed
and developed a DE variant which is able to train a Feedforward NN; then,
I tuned the DENN operations and their parameters in order to nd the best
combination to be applied to Supervised Learning problems. Finally, I used
DENN as optimizer of Feedforward Neural Networks for Algorithm learning.
For the future, the long-term objectives of my proposal can be divided into
three steps: the rst one is to use the knowledge I acquired on DE in order to
design Evolutionary Algorithms able to train Recurrent Neural Networks (RNN).
The next step will be to apply Neuroevolution techniques to train a Recurrent
Neural Controller for a NTM-like model. Moreover, I am planning to design and
develop EAs variants to be applied to Reinforcement learning problems. In the
beginning, I would like to use EAs in virtual worlds, such as the Starcraft II
Learning Environment, the environment used by Google DeepMind to improve
Starcraft 2's AI. Such environments are good to train and test models because
of their controlled structure.</p>
    </sec>
    <sec id="sec-5">
      <title>Preliminary Results</title>
      <p>
        I applied evolutionary algorithms to the Feedforward Neural Networks
optimization, with good results presented in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>About the results, on the small dataset DENN reaches better results then
Backpropagation.</p>
      <p>For the known MNIST dataset, the DENN algorithm applied to a network
without the hidden layers, reaches more than 90% of accuracy, the same result
obtained by Backpropagation.</p>
      <p>The Quade test analysis identi ed the best combination of DE operators,
which are current to pbest as Mutation, interm as Crossover, and SHADE as
Self-Adaptive method.</p>
      <p>
        Regarding NRAM and the problem of algorithms learning, the preliminary
results will be presented at AI*IA 2018 [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>During the last years, Machine learning became popular not only for the research
world, but also in the business eld.</p>
      <p>Looking at both preliminary results obtained during rst year and others
recent researches, the study of Evolutionary Algorithms on deep learning problems
appears to be promising in order to solve real world problems.</p>
      <p>In the future, more attention will be given to the research area of
Reinforcement learning, which can guarantee a more general approach with respect to
Supervised learning.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>M.</given-names>
            <surname>Baioletti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. Di</given-names>
            <surname>Bari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Poggioni</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Tracolli</surname>
          </string-name>
          .
          <article-title>Can di erential evolution be an e cient engine to optimize neural networks</article-title>
          ?
          <source>In International Workshop on Machine Learning, Optimization, and Big Data</source>
          , pages
          <volume>401</volume>
          {
          <fpage>413</fpage>
          . Springer,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>M.</given-names>
            <surname>Baioletti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. Di</given-names>
            <surname>Bari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Poggioni</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Tracolli</surname>
          </string-name>
          .
          <article-title>Di erential evolution for learning large neural networks</article-title>
          .
          <source>Tech. Rep</source>
          ., available at https://github.com/Gabriele91/DENN-RESULTS-
          <year>2018</year>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bengio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Louradour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Collobert</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Weston</surname>
          </string-name>
          .
          <article-title>Curriculum learning</article-title>
          .
          <source>In ICML</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>G.</given-names>
            <surname>Di Bari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Poggioni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Baioletti</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.</given-names>
            <surname>Belli</surname>
          </string-name>
          .
          <article-title>Neural random access machines optimized by di erential evolution</article-title>
          .
          <source>AI*IA,The 17th International Conference of the Italian Association for Arti cial Intelligence</source>
          , Available at https://github.com/Gabriele91/DENN-NRAM-RESULTS-
          <year>2018</year>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>D.</given-names>
            <surname>Floreano</surname>
          </string-name>
          , P. Durr, and
          <string-name>
            <given-names>C.</given-names>
            <surname>Mattiussi</surname>
          </string-name>
          .
          <article-title>Neuroevolution: from architectures to learning</article-title>
          .
          <source>Evolutionary Intelligence</source>
          ,
          <volume>1</volume>
          (
          <issue>1</issue>
          ):
          <volume>47</volume>
          {
          <fpage>62</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>P.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Malik</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Sharma</surname>
          </string-name>
          .
          <article-title>Application of evolutionary reinforcement learning (erl) approach in control domain: A review</article-title>
          .
          <source>In Smart Innovations in Communication and Computational Sciences</source>
          , pages
          <volume>273</volume>
          {
          <fpage>288</fpage>
          . Springer,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>A.</given-names>
            <surname>Graves</surname>
          </string-name>
          , Greg Wayne,
          <string-name>
            <given-names>and I.</given-names>
            <surname>Danihelka</surname>
          </string-name>
          .
          <source>Neural turing machines</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>K.</given-names>
            <surname>Karol</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Marcin</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Ilya</surname>
          </string-name>
          .
          <article-title>Neural random-access machines</article-title>
          .
          <source>CoRR, abs/1511.06392</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>D. P.</given-names>
            <surname>Kingma</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Ba</surname>
          </string-name>
          .
          <article-title>Adam: A method for stochastic optimization</article-title>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>D. E. Moriarty</surname>
            ,
            <given-names>A. C.</given-names>
          </string-name>
          <string-name>
            <surname>Schultz</surname>
            , and
            <given-names>J. J.</given-names>
          </string-name>
          <string-name>
            <surname>Grefenstette</surname>
          </string-name>
          .
          <article-title>Evolutionary algorithms for reinforcement learning</article-title>
          .
          <source>Journal of Arti cial Intelligence Research</source>
          ,
          <volume>11</volume>
          :
          <fpage>241</fpage>
          {
          <fpage>276</fpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. G. Morse and
          <string-name>
            <given-names>K. O.</given-names>
            <surname>Stanley</surname>
          </string-name>
          .
          <article-title>Simple evolutionary optimization can rival stochastic gradient descent in neural networks</article-title>
          .
          <source>In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)</source>
          <year>2016</year>
          , pages
          <fpage>477</fpage>
          {
          <fpage>484</fpage>
          , New York, NY, USA,
          <year>2016</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Piotrowski</surname>
          </string-name>
          .
          <article-title>Di erential evolution algorithms applied to neural network training su er from stagnation</article-title>
          .
          <source>Applied Soft Computing</source>
          ,
          <volume>21</volume>
          :
          <fpage>382</fpage>
          {
          <fpage>406</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>J.</given-names>
            <surname>Prellberg</surname>
          </string-name>
          and
          <string-name>
            <given-names>O.</given-names>
            <surname>Kramer</surname>
          </string-name>
          .
          <article-title>Limited evaluation evolutionary optimization of large neural networks</article-title>
          .
          <source>06</source>
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>J. D. Scha er</surname>
            , D. Whitley, and
            <given-names>L. J.</given-names>
          </string-name>
          <string-name>
            <surname>Eshelman</surname>
          </string-name>
          .
          <article-title>Combinations of genetic algorithms and neural networks: a survey of the state of the art</article-title>
          .
          <source>In [Proceedings] COGANN92: International Workshop on Combinations of Genetic Algorithms and Neural Networks</source>
          , pages
          <volume>1</volume>
          {
          <fpage>37</fpage>
          ,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>J.</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          .
          <article-title>Deep learning in neural networks: An overview</article-title>
          .
          <source>Neural Networks</source>
          ,
          <volume>61</volume>
          :
          <fpage>85</fpage>
          {
          <fpage>117</fpage>
          ,
          <year>2015</year>
          .
          <source>Published online 2014; based on TR arXiv:1404.7828 [cs.NE].</source>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>B.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Xue</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          .
          <article-title>A hybrid di erential evolution approach to designing deep convolutional neural networks for image classi cation</article-title>
          .
          <source>arXiv preprint arXiv:1808.06661</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>R.</given-names>
            <surname>Xiong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Cao</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yu</surname>
          </string-name>
          .
          <article-title>Reinforcement learning-based real-time power management for hybrid energy storage system in the plug-in hybrid electric vehicle</article-title>
          .
          <source>Applied Energy</source>
          ,
          <volume>211</volume>
          :
          <fpage>538</fpage>
          {
          <fpage>548</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>X.</given-names>
            <surname>Yao</surname>
          </string-name>
          .
          <article-title>Evolving arti cial neural networks</article-title>
          .
          <source>Proceedings of the IEEE</source>
          ,
          <volume>87</volume>
          (
          <issue>9</issue>
          ):
          <volume>1423</volume>
          {
          <fpage>1447</fpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>