<!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>One approach to control of a neural network with variable signal conductivity</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>A. Olshansky</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>A. Ignatenkov</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Railway Signalling Institute JSCo</institution>
          ,
          <addr-line>27 bld. 1 Nizhegorodskaya str., 109029, Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Samara State Transport University</institution>
          ,
          <addr-line>2 V Svobody str., 443066, Samara</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <fpage>7</fpage>
      <lpage>13</lpage>
      <abstract>
        <p>The article focuses on a new extent to synthesize a control strategy of learning of a special artificial neural network with variable signal conductivity and on features of neural networks with variable signal conductivity. The purpose of the research is to create a new control strategy based on analysis of the neural network error signal. Also the article contains an approach how to compute the control strategy. The main result is contained in the necessity to realize the control strategy on the basis of preliminary training of the neural network with specific techniques. Authors also suggest a technique of computing the crucial trajectory of the network's error decreasing. The trajectory may be computed using signal processing methods.</p>
      </abstract>
      <kwd-group>
        <kwd>neural networks</kwd>
        <kwd>control</kwd>
        <kwd>signal processing</kwd>
        <kwd>preliminary training</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. The object of the study</title>
      <p>with a larger number).
is equal to 1440.</p>
      <p>, +1 = (
the adjacent layer.</p>
      <p>Each neuron of the ith layer is connected to each neuron of the next layer (total number is 1440 links). In addition, each
neuron is associated with several neurons on the left (i.e., with neurons with a smaller number) and on the right (with neurons</p>
      <p>Each matrix of weights  between two layers with numbers i, i+1 is a square matrix where the number of rows and columns
where   is the weight value on the link connecting the neuron with the ith layer number and the neuron with the jth number of</p>
      <p>Every neuron may be characterized by its state. Possible states of the neuron are: "active", when the input signal can be
received at the input of the corresponding neuron, "sleep", when the value of the potential of the given neuron is zero, "off",
when we cannot receive signals from the previous layer. The state "sleep" exists for even and odd directions.</p>
      <p>Weights of constraints are initially specified randomly by real numbers from 0 to 0.1. Later they change during the process of
the neural network’s learning. The transit of the signal through the connections between the neurons of neighboring layers
displays the process of traversing the train on a distance between the stations. Pay attention to minimum travel time between two
stations (which is integer), all weights of links from neuron with number j from 0 to j+t (where t is minimal running time) are
taken equal to minus infinity. These weights never change.</p>
      <p>Calculation of the ANN output is performed by sequential calculation of the potentials of active neurons in adjacent layers
along the signal path using the sigmoid activation function.</p>
      <p>Link weights define the level of competition between neurons for the right to receive a signal (train) in the next layer
(station). Thus, the transmitted signal from one layer of the neural network to the other can’t violate the rule of minimum travel
The direct calculation of the network is performed as follows.</p>
      <p>1. The vector  = { 0,  1, … ,  1439}, , which is a sequence of zeros and ones, is being fed to the first layer. The ones mean
that the corresponding minute is associated with the passage of the train.   means a vector of neurons’ values from a layer with
2. For all links issuing from the layers with numbers ,  − 1, … 1 the following holds:
∀  ∈ (0,1, … 1439)  ( ) &gt; 0,  ℎ

∃  ∈ (0,1, … 1439):   , = max{ 
} ,    −1 = 0 , then
we establish   −1 ≔

is the weight at the connection between the neurons of the layers k and m,
 is the number of the neuron of the current layer,
 is the number of the layer adjacent to the current.</p>
      <p>The meaning of the condition described above is that: for each neuron with the number k of the current layer with a positive
output value in the next layer, we search for such a neuron that the value of their connection weight is the maximum of all t he
neuron bonds with the number k with the next layer.</p>
      <p>3. The activation function is  ( ,  ) = {
where
0,   = 0,
1
1+ − ∗ ,   &gt; 0
time.
the number  .
 (  ( ),   , ),
where
 
scheduling.
where
b is the number of trains that are required to be plotted in the schedule.
 (  ц) =  (   ) is the number of the train for all trains that have reached the last layer,
 ′ is the index numbers of the elements of the vector   , for which the network signal did not reach the last layer,
 ( ,  ) is the value of the activation function,
 is the weight value of the neuron with the maximum-weighted link, winning in the competition of neurons,
 is the input to the neuron-winner.
4. With the output of the network Y we take the vector of values of the last layer  (0).</p>
      <p>Moreover   is the desired output of the network. It also consists of a sequence of zeros and ones whose meaning is
identical to the sense of the input vector  .</p>
      <p>We introduce the concept of “train number”, which we denote by  . We say that the train passes through the station with
the number  1 per minute  1 and the station with the number  2 per minute  2, if the equality is fulfilled:  (  1</p>
      <p>Calculation of the ANN error.</p>
      <p>A network error is calculated using the formula:
Е = ∑ (  −  )2+∑ ( ∗ ′ )2,

(1)
(2)</p>
      <p>,    are the values of the elements of the target vector   and the actual arrival vector   respectively.
 is the penalty coefficient for the train that has not reached the last station.</p>
      <p>This type of error was introduced in order to emphasize the physical meaning of the network requirements (all trains must</p>
      <p>Within the given number of learning epochs, while  &gt; ∆, where ∆ is the forward accuracy of the laying of
reach the layer with number 0).
trains, perform the following steps:
follows:</p>
      <p>For all the layers with numbers  ∈ (0,1, … ,  − 1), for all neurons of the lth layer with the number  ∈ (0,1, … ,1439) it is
set: if  
( ) &gt; 0, then for the train identifier  ( 
( )) ∃!  :  ( 
( )) =  ( 
( +1)). The meaning of this expression is searching in the
layer (l+1) of the neuron with the number  , from which the train with the identifier  ( 
( )) has come to the neuron j of the layer
We calculate the new weights of the ith row of the matrix of   +1, by recalculating values of the weights according to the
- reducing the weights that are situated “on the left” from the maximum weight position according to the formula:
is the position of the neuron in the layer relative to the value of the neuron with the maximum weight,
∀  ∈ (0,1, …  − 1):   ,
=   ,</p>
      <p>−  ∙   ∙  ′(  +1)
- reducing the maximum weight by the formula:
  , =   , −  ∙   ∙  ′(  +1)
∀  ∈ ( + 1,  + 2, …  +  ):   ,
=   ,</p>
      <p>+  ∙  ∙   ∙  ′(  +1) ∙ |  , −   , |
In the equations the following notations are accepted:
 ′ is the derivative of the activation function (1),
weighted link,


 is a speed of network training,
  is the output of the neuron i of the layer l,
  , is the value of the maximum weight,
  , is the weight value for the neuron at position number m,
  is the output of the neuron i of the layer l.
- increasing the weights that are situated “to the right” from the position of maximum weight by the formula:
 = √ is an indicator characterizing the width of a segment within which there is a positive correction of the balance,
is the coefficient introduced for accelerated growth of weights “on the right” from the position of the
maximum ′(  +1) is the value of the derivative of the activation function in the subsequent layer (l + 1) for the neuron numbered i,
being increased.</p>
      <p>( ) =   −1 +
 

where  is the number of epochs.</p>
      <p>The physical meaning of learning is this: when the weights of connections “to the left” from the connection with the
maximum weight are being decreased, the chance of the signal of the selected neuron to pass through the reduced connection
became smaller at the next attempt (epoch). “On the right” of this connection, on the contrary, the values of the weights are
After each epoch (after a new calculation of the network values), the learning rate η increases by a value equal to  , i.e.</p>
      <p>After selecting all the signal trajectories and printing them on the paper we’ll get a variant of a train schedule created by the
artificial neural network during its training process.</p>
      <p>During its training process every ANN has its own error signal. The error signal is an important indicator of ANN’s behavior.
The further investigations are devoted to using the ANN error signal to improve its training process. Typically the dynamics of
the error function (error signal) looks like in fig.2</p>
    </sec>
    <sec id="sec-3">
      <title>3. Methods</title>
      <p>
        In particular case when the error function could be described as sum of sinusoidal-based harmonics with different frequencies
and amplitudes we may use the results obtained in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In general case we are not sure in this signal error representation.
      </p>
      <p>To analyze the behavior of the error function we plot its autocorrelation function (fig.3).</p>
      <p>It gave us an assumption that it is possible to decompose the signal. The goal of this decomposition is to filter the main
components of the error function. After filtering we should try to implicate the decomposition for a rational control scheme to
train the network.</p>
      <p>
        According to the useful practice in stochastic market signal processing we have successfully implicated LOESS techniques
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] to decompose the signal of the neural network error function. The analyzed signal, as we discovered, consists of three
perceptible components: a trend part, a periodic signal and the irregular components.
      </p>
      <p>The trend curve of the neural network error function provides guides for synthesis of the rational control.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Discussions about ways of control implementation</title>
      <p>During the research authors have planned, realized and analyzed several series of computational experiments with variable
key parameters of the neural network functioning including initial trainspeed, desired mean of the error, number of trains to</p>
      <p>Mathematical Modeling / A. Olshansky, A. Ignatenkov
scheduling etc. It is set that we have stable and iterative character of error function view (fig.2), trend function view (fig.4). So
we conclude that we should find rational control of the neural network based on this curves (fig.4).</p>
      <p>In consideration of the enormous quantity of links between neurons it is impossible to solve the control problem in terms of
dynamics of every neuron link (and the system of differential equations). So it is potentially useful to apply some special
techniques to simplify and generalize control influence like:
- Pre-amplification of the bundle of links in the concrete areas of the neural network;
- Pre-diminution of the bundle of links which are rather useless to desired trajectory of signal distribution (e.g. the
links which may create too earlier or too later arrivals etc.);
- Simultaneously pre-amplification and pre-diminution of the links;
- Mutation of links’ weights in bounded area;</p>
      <p>Mathematical Modeling / A. Olshansky, A. Ignatenkov
- Swap of weights between the links of selected pair of neurons.</p>
      <p>Another way to invent the control strategy is implementation of inverse general neural network control.</p>
      <p>The main idea of the scheme given in fig.5 is as follows. We realize a control strategy for the neural network with variable
signal conductivity (which is a controllable object) using another neural network (which is a controller). We have a target error
curve (fig.4) and we know all statements of every weight per every moment so we may represent every weights change like a
control step act. In epoch (k-1) we know all the picture of weights changes and hence the total of used control acts. Also we
know the target level of the error function in epoch number k and the actual level of the error function in epoch k. So we may
describe this situation as:
 ( − 1) =  (  ,    ) (3)
where:
 − 1 is a number of previous epoch,
 is a number of current epoch,
  is an observable meaning of the error function
   is a target meaning of the error function given by STL-decomposition
 ( − 1) is the set of used control acts,
f() is a reaction of the inverse-based neural network.</p>
      <p>An equation (3) describes the inverse-based neural network training mode.</p>
      <p>In the work circuit given in fig.5 we feed into the inversed neural network’s input the target error in (k+1) epoch and actual
error in current epoch. The output of the inversed neural network should be interpreted as the control signal applicable to the
neural network with variable signal conductivity. The last described scheme will work properly if the inversed-based neural
network is trained relevant to behavior of the control object. Let us consider some issues of the implementation of the scheme
considered in fig.5.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] there was an attempt to synthesize global control strategy for artificial neural network with variable signal conductivity
solving Bellman optimal control feedback task. The main conclusion of investigation [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] is that a multilayer neural network with
variable signal conductivity is an output-controllable system, but not a fully-controllable system. Authors got a principal control
curve, but it is rather difficult to implement the founded control function. E.g., if the neural network has only 1440 neurons in a
layer and every neuron has only 100 active links with non-zero weights values for only 10 layers (is equal to 10 stations), we get
about k×106 active weights. Hence we need to embed k×106 control regulators to realize the founded in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] the only control
curve. It is potentially inconvenient and it is only theoretical result because we need to research the form of functional
dependence between the error level E(t,u*) and all set of k×106 weights and regulators (u* in this case means the founded
optimal control curve).
      </p>
      <p>To avoid this authors offer training a supervising neural network using a special database to store any step of the considered
neural network with its all weights and neural statuses. Authors suggest a supervisor neural network which feeds desired error
level and observed error level and returns one parameter of concrete weight value in the multilayer neural network with variable
signal conductivity. It leads to creation of the ensemble of multilayer perceptrons which will give us every weight parameter of
considerable neural network. The structure of the database is given below.
Description</p>
      <p>All the fields of the database are described in the table 1.</p>
      <p>On fig.7: MANN VSC is a multilayer artificial neural network with variable signal conductivity, MANN VSC Database is a
special database described in table 1, “Ensemble of neural networks controllers” is a supervisor neural network.</p>
      <p>The main idea of fig.7 is the follows. Entrance of the controllable neural network feeds the moments of train departures and
its desired arrival moments. The multilayer neural network with variable signal conductivity is functioning according to its
algorithms and rules and is returning a set of error curves. These curves are being decomposed by STL to create a set of desired
error signals. During this moment all statuses of the controllable neural network are being saved in the database for further
storage. Values of desired error signals and real error signals are entering the entrance of the neural network supervisor
ensemble, statuses of the controllable neural network are entering the output layers of the ensemble. We get inversed training of
the ensemble because the order and the training procedure are implemented as in fig.5.</p>
      <p>In current mode all trained weights for each epoch would be given to the MANN VSC entrance.</p>
      <p>So in the present paper authors describe a new prospective approach to train the neural networks for transport scheduling.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>To improve existing training methods of the neural networks with variable conductivity of signals it is possible to use
some rigor mathematical disciplines. The theoretical basis for it can be synthesized of the settlements from Theory of
Optimal Control and Theory of Signal Processing. It allows us to construct various transport timetables in more effective
way.</p>
      <p>Each neural network despite the kind of solved problems should be detected and registered. Its error signal should be
processed and filtered to distinguish main component from signal series.</p>
      <p>According to the trend component of the signal the system of weights and links of the neural network must be modified
using one of techniques described above.</p>
      <p>It worth sharing a new control scheme working with an inverse-based neural network control. The specific feature of the
considered task is the neural network as a controllable object. This representation is innovative because in classical case
we have a technical or a chemical systems described by its evolutionary equations as the controlled system and a neural
network as a controller.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgements References</title>
      <p>Our gratitude to Professor Ivanov B.G. and Kopeykin S.V. (Samara State Transport University) and Professor Prokhorov
S.A. (Samara State Aerospace University) for constructive critical feedback and very beneficial advice.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Hopfield</surname>
            <given-names>JJ</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tank</surname>
            <given-names>DW</given-names>
          </string-name>
          .
          <article-title>Neural Computation of Decisions in Optimization Problems</article-title>
          . Biological cybernetics
          <year>1985</year>
          ;
          <volume>52</volume>
          ; 3:
          <fpage>141</fpage>
          -
          <lpage>152</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Chen</surname>
            <given-names>RM</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            <given-names>YM</given-names>
          </string-name>
          .
          <article-title>Competitive neural network to solve scheduling problems</article-title>
          .
          <source>Neurocomputing</source>
          <year>2001</year>
          ;
          <volume>37</volume>
          (
          <issue>1</issue>
          ):
          <fpage>177</fpage>
          -
          <lpage>196</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Kostenko</surname>
            <given-names>VA</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vinokurov</surname>
            <given-names>AV</given-names>
          </string-name>
          .
          <article-title>Local-optimal scheduling algorithms based on the use of Hopfield networks</article-title>
          .
          <source>Programmirovanie</source>
          <year>2003</year>
          ;
          <volume>4</volume>
          :
          <fpage>27</fpage>
          -
          <lpage>40</lpage>
          . (in Russian)
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Martinelli</surname>
            <given-names>DR</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Teng</surname>
            <given-names>H</given-names>
          </string-name>
          .
          <article-title>Optimization of railway operations using neural networks</article-title>
          .
          <source>Transportation Research Part C: Emerging Technologies</source>
          <year>1996</year>
          ;
          <volume>4</volume>
          (
          <issue>1</issue>
          ):
          <fpage>33</fpage>
          -
          <lpage>49</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Fahotimi</surname>
            <given-names>O</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dembo</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kailath</surname>
            <given-names>T.</given-names>
          </string-name>
          <article-title>Neural network weight matrix synthesis using optimal control techniques</article-title>
          . USA, Stanford University. URL: http://papers.nips.cc/paper/191-neural
          <article-title>-network-weight-matrix-synthesis-using-optimal-control-techniques</article-title>
          .
          <source>pdf.</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Becerikli</surname>
            <given-names>Y</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Konar</surname>
            <given-names>AF</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Samad</surname>
            <given-names>T.</given-names>
          </string-name>
          <article-title>Intelligent optimal control with dynamic neural networks</article-title>
          .
          <source>Neural networks</source>
          <year>2003</year>
          ;
          <volume>16</volume>
          (
          <issue>2</issue>
          ):
          <fpage>251</fpage>
          -
          <lpage>259</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Ignatenkov</given-names>
            <surname>AV</surname>
          </string-name>
          .
          <article-title>Model of an artificial neural network for plotting the traffic schedule of trains on a two-track section</article-title>
          .
          <source>International Scientific Conference Proceedings “Advanced Information Technologies and Scientific Computing”. Samara Scientific Center of RAS Publishing</source>
          ,
          <year>2016</year>
          ;
          <fpage>619</fpage>
          -
          <lpage>623</lpage>
          . (in Russian)
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Ignatenkov</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olshansky</surname>
            <given-names>A</given-names>
          </string-name>
          .
          <article-title>Extent of error control in neural networks</article-title>
          . Cornwell University Library. URL: https://arxiv.org/abs/1608.04682 (
          <issue>03</issue>
          .
          <fpage>01</fpage>
          .
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Cleveland</surname>
            <given-names>RB</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cleveland</surname>
            <given-names>WS</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McRae</surname>
            <given-names>JE</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Terpenning</surname>
            <given-names>I. STL</given-names>
          </string-name>
          :
          <article-title>A seasonal-trend decomposition procedure based on Loess</article-title>
          .
          <source>Journal of Official Statistics</source>
          <year>1990</year>
          ;
          <volume>1</volume>
          (
          <issue>6</issue>
          ):
          <fpage>3</fpage>
          -
          <lpage>73</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>