<!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>KINN: Incorporating Expert Knowledge in Neural Networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Muhammad Ali Chattha</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shoaib Ahmed Siddiqui</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Muhammad Imran Malik</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ludger van Elst</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andreas Dengel</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sheraz Ahmed</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Copyright held by the author(s). In A. Martin, K. Hinkelmann, A. Gerber</institution>
          ,
          <addr-line>D. Lenat, F. van Harmelen, P. Clark (Eds.)</addr-line>
          ,
          <institution>Proceedings of the AAAI 2019 Spring Symposium on Combining Machine Learning with Knowledge Engineering (AAAI-MAKE 2019). Stanford University</institution>
          ,
          <addr-line>Palo Alto, California</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Deep Learning Laboratory, National Center of Artificial Intelligence</institution>
          ,
          <addr-line>Islamabad</addr-line>
          ,
          <country country="PK">Pakistan</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>German Research Center for Artificial Intelligence (DFKI)</institution>
          ,
          <addr-line>Kaiserslautern</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>School of Electrical Engineering and Computer Science (SEECS), National University of Sciences and Technology (NUST)</institution>
          ,
          <addr-line>Islamabad</addr-line>
          ,
          <country country="PK">Pakistan</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>TU Kaiserslautern</institution>
          ,
          <addr-line>Kaiserslautern</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The ability of Artificial Neural Networks (ANNs) to learn accurate patterns from large amount of data has spurred interest of many researchers and industrialists alike. The promise of ANNs to automatically discover and extract useful features/patterns from data without dwelling on domain expertise although seems highly promising but comes at the cost of high reliance on large amount of accurately labeled data, which is often hard to acquire and formulate especially in time-series domains like anomaly detection, natural disaster management, predictive maintenance and healthcare. As these networks completely rely on data and ignore a very important modality i.e. expert, they are unable to harvest any benefit from the expert knowledge, which in many cases is very useful. In this paper, we try to bridge the gap between these data driven and expert knowledge based systems by introducing a novel framework for incorporating expert knowledge into the network (KINN). Integrating expert knowledge into the network has three key advantages: (a) Reduction in the amount of data needed to train the model, (b) provision of a lower bound on the performance of the resulting classifier by obtaining best of both worlds, and (c) improved convergence of model parameters (model converges in lesser number of epochs). Although experts are extremely good in solving different tasks, there are some trends and patterns, which are usually hidden only in the data. Therefore, KINN employs a novel residual knowledge incorporation scheme, which can automatically determine the quality of the predictions made by the expert and rectify it accordingly by learning the trends/patterns from data. Specifically, the method tries to use information contained in one modality to complement information missed by the other. We evaluated KINN on a real world traffic flow prediction problem. KINN significantly superseded performance of both the expert and as well as the base network (LSTM in this case) when evaluated in isolation, highlighting its superiority for the task.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Humans tend to learn from examples specific to the
problem, similar to DNNs, as well as from different sources
of knowledge and experiences
        <xref ref-type="bibr" rid="ref16 ref3">(Lake, Salakhutdinov, and
Tenenbaum 2015)</xref>
        . This makes it possible for humans to
learn just from acquiring knowledge about the problem
without even looking at the data pertaining to it. Domain experts
are quite proficient in tasks belonging to their area of
expertise due to their extensive knowledge and understanding
of the problem, which they have acquired overtime through
relevant education and experiences. Hence, they rely on their
knowledge when dealing with problems. Due to their deep
insights, expert predictions even serve as a baseline for
measuring the performance of DNNs. Nonetheless, it can not
be denied that apart from knowledge, the data also contains
some useful information for solving problems. This is
particularly cemented by astonishing results achieved by the
DNNs that solely rely on data to find and utilize hidden
features contained in the data itself
        <xref ref-type="bibr" rid="ref10 ref14">(Krizhevsky, Sutskever, and
Hinton 2012)</xref>
        .
      </p>
      <p>
        Therefore, a natural step forward is to combine both these
separate streams of knowledge i.e. knowledge extracted
from the data and the expert’s knowledge. As a matter of
fact, supplementing DNNs with expert knowledge and
predictions in order to improve their performance has been
actively researched upon. A way of sharing knowledge among
classes in the data has been considered in zero-shot-learning
        <xref ref-type="bibr" rid="ref19">(Rohrbach, Stark, and Schiele 2011)</xref>
        , where semantic
relatedness among classes is used to find classes related to the
known ones. Although such techniques employ knowledge
transfer, they are restricted solely to the data domain and
the knowledge is extracted and shared from the data itself
without any intervention from the expert. Similarly, expert
knowledge and opinions are incorporated using distillation
technique where expert network produces soft predictions
that the DNN tries to emulate or in the form of posterior
regularization over DNN predictions
        <xref ref-type="bibr" rid="ref3">(Hinton, Vinyals, and
Dean 2015)</xref>
        . All of these techniques try to strengthen DNN
with expert knowledge. However, cases where the expert
model is unreliable or even random have not been
considered. Moreover, directly trying to mimic expert network
predictions has an implicit assumption regarding the high
quality of the predictions made by the expert. We argue that
the ideal incorporation of expert network would be the one
where strengths of both networks are promoted and
weaknesses are suppressed. Hence, we introduce a step in this
direction by proposing a novel framework, Knowledge
Integrated Neural Network (KINN), which aims to integrates
knowledge residing in heterogeneous sources, in the form of
predictions, in a residual scheme KINN’s design allows it
to be flexible. KINN can successfully integrate knowledge
in cases where predictions of the expert and DNN align and
as well as in scenarios where they are completely disjoint.
Finding state-of-the-art DNN or expert model is not the aim
here but rather, the aim is to devise a strategy that facilitates
integration of expert knowledge with DNNs in a way that
the final network achieves best of both worlds.
      </p>
      <p>The residual scheme employed in KINN to incorporate
expert knowledge inside the network has three key
advantages: (a) Significant reduction in the amount of data needed
to train the model, since the network has to learn a
residual function instead of learning the complete input to output
space projection, (b) a lower bound on the performance of
KINN based on the performance of the two subsequent
classifiers achieving the best of both worlds, and (c)
improvements in convergence of the model parameters as learning
a residual mapping makes the optimization problem
significantly easier to tackle. Moreover, since the DNN itself is
data driven, this makes KINN robust enough to deal with
situations where the predictions made by the expert model
are not reliable or even useless.</p>
      <p>The rest of the paper is structured as follows: We first
provide a brief overview of the work done in the direction
of expert knowledge incorporation in the past. We then
explain the proposed framework, KINN, in detail. After that,
we present the evaluation results regarding the different
experiments performed in order to prove the efficacy of KINN
for the task of expert knowledge incorporation. Finally, we
conclude the paper with the conclusion.</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Integrating domain knowledge and experts opinion into the
network is an active area of research and even dates back to
the early 90s. Knowledge-based Artificial Neural Networks
(KBANN) was proposed by
        <xref ref-type="bibr" rid="ref24">(Towell and Shavlik 1994)</xref>
        .
KBANN uses knowledge in the form of propositional rule
sets which are hierarchically structured. In addition to
directly mapping inputs to outputs, the rules also state
intermediate conclusions. The network is designed to have a
one-to-one correspondence with the elements of the rule set,
where neurons and the corresponding weights of their
connections are specified by the rules. Apart from these rule
based connections and neurons, additional neurons are also
added to learn features not specified in the rule set. Similar
approach has also been followed by
        <xref ref-type="bibr" rid="ref25">(Tran and Garcez 2018)</xref>
        .
Although such approaches directly incorporates knowledge
into the network, but they also limit the network
architecture by forcing it to have strict correspondence with the rule
base. As a result, this restricts the use of alternate
architectures or employing network that does not directly follow the
structure defined by the rule set.
      </p>
      <p>
        <xref ref-type="bibr" rid="ref12">(Hu et al. 2016)</xref>
        integrated expert knowledge using first
order logic rules which is transferred to the network
parameters through iterative knowledge distillation
        <xref ref-type="bibr" rid="ref3">(Hinton,
Vinyals, and Dean 2015)</xref>
        . The DNN tries to emulate soft
predictions made by the expert network, instilling expert
knowledge into the network parameters. Hence, the expert
network acts as a teacher to the DNN i.e. the student
network. The objective function is taken as a weighted average
between imitating the soft predictions made by the teacher
network and true hard label predictions. The teacher network
is also updated at each iteration step with the goal of
finding the best teacher network that fits the rule set while, at
the same time, also staying close to the student network. In
order to achieve this goal, KL-divergence between the
probability distribution of the predictions made by the teacher
network and softmax output layer of the student network is
used as the objective function to be minimized. This acts
as a constraint over model posterior. The proposed
framework was evaluated for classification tasks and achieved
superior results compared to other state-of-the-art models at
that time. However, the framework strongly relies on the
expert network for parametric optimization and does not cater
for cases where expert knowledge is not comprehensive.
      </p>
      <p>
        Expert knowledge is incorporated for key phrase
extraction by
        <xref ref-type="bibr" rid="ref8">(Gollapalli, Li, and Yang 2017)</xref>
        where they defined
label-distribution rules that dictates the probability of a word
being a key phrase. For example, the rule enunciates that
a noun that appears in the document as well as in the title
is 90% likely to be a key phrase and thus acts as posterior
regularization providing weak supervision for the
classification task. Similarly, KL-divergence between the distribution
given by the rule set and the model estimates is used as the
objective function to be used for the optimization. Again, as
the model utilizes knowledge to strengthen the predictions
of the network, it shifts the dependency of the network from
the training data to accurate expert knowledge which might
just be an educated guess in some cases. Similarly, (Xu et
al. 2017) incorporated symbolic knowledge into the network
by deriving a semantic loss function that acts as a bridge
between the network outputs and the logical constraints. The
semantic loss function is based on constraints in the form
of propositional logic and the probabilities computed by the
network. During training, the semantic loss is added to the
normal loss of the network and thus acts as a regularization
term. This ensures that symbolic knowledge plays a part in
updating the parameters of the network.
      </p>
      <p>
        <xref ref-type="bibr" rid="ref29">(Wu et al. 2016)</xref>
        proposed a Knowledge Enhanced
Hybrid Neural Network (KEHNN). KEHNN utilizes
knowledge in conjunction with the network to cater for text
matching in long texts. Here, knowledge is considered to be the
global context such as topics, tags etc. obtained from other
algorithms that extracts information from multiple sources
and datasets. They employed the twitter LDA model
        <xref ref-type="bibr" rid="ref32">(Zhao
et al. 2011)</xref>
        as the prior knowledge which was
considered useful in filtering out noise from long texts. A
special gate known as the knowledge gate is added to the
traditional bi-directional Gated Recurrent Units (GRU) in the
model which controls how much information from the
expert knowledge flows into the network.
      </p>
    </sec>
    <sec id="sec-3">
      <title>KINN: The Proposed Framework</title>
      <sec id="sec-3-1">
        <title>Problem Formalization</title>
        <p>
          Time-series forecasting is of vital significance due to its high
impact, specifically in domains like supply chain
          <xref ref-type="bibr" rid="ref3 ref6">(Fildes,
Goodwin, and Onkal 2015)</xref>
          , demand prediction (Pacchin
et al. 2017), and fault prediction
          <xref ref-type="bibr" rid="ref1">(Baptista et al. 2018)</xref>
          .
In a typical forecasting setting, a sequence of values
fxt 1; xt 2; :::; xt pg from the past are used to predict the
value of the variable at time-step t, where p is the number
of past values leveraged for a particular prediction, which
we refer as the window size. Hence, the model is a
functional mapping from past observations to the future value.
This parametric mapping can be written as:
x^t = ([xt 1; xt 2; :::; xt p]; W)
        </p>
        <p>L
where W = fWl; blgl=1 encapsulates the parameters of the
network and : Rp 7! R defines the map from the
input space to the output space. The optimal parameters of
the network W are computed based on the empirical risk
computed over the training dataset. Using MSE as the loss
function, the optimization problem can be stated as:
([xt 1; :::; xt p]; W))2
(1)
where X denotes the set of training sequences and x 2
Rp+1. Solving this optimization problem comprising of
thousands, if not millions of parameters, requires large
amount of data in order to successfully constrain the
parametric space so that a reliable solution is obtained.</p>
        <p>Humans on the other hand, leverage their real-world
knowledge along with their past-experiences in order to
make predictions about the future. The aim of KINN is to
inject this real-world knowledge in the form of expert into the
system. However, as mentioned, information from the
expert may not be reliable, therefore, KINN proposes a novel
residual learning framework for the incorporation of expert
knowledge into the system. The residual framework
conditions the prediction of the network on the expert’s opinion.
As a result, the network acts as a correcting entity for the
values generated by the expert. This decouples our system
from complete reliance on the expert knowledge.
We evaluated KINN on Caltrans Performance Measurement
System (PeMS) data. The data contains records of sensor
readings that measure the flow of vehicular traffic on
California Highways. Since the complete PeMS dataset is
enormous in terms of its size comprising of records from
multiple highways, we only considered a small fraction of it
for our experiments i.e. the traffic flow on Richards Ave,
from January 2016 till March 20161. The dataset contains
information regarding the number of vehicles passing on the
avenue every 30 seconds. PeMS also contains other details
regarding the vehicles, however, we only consider the
problem of average traffic flow forecasting in this paper. The data
is grouped into 30 minute windows. The goal is to predict
average number of vehicles per 30 seconds for the next 30
minutes. Fig. 1 provides an overview of the grouped dataset.
The data clearly exhibits a seasonal component along with
high variance for the peaks.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Baseline Expert and Deep Models</title>
        <p>
          LSTMs have achieved state-of-the-art performance in a
range of different domains comprising of sequential data
such as language translation (Weiss et al. 2017), and
handwriting and speech recognition
          <xref ref-type="bibr" rid="ref31 ref4">(Zhang et al. 2018; Chiu et
al. 2018)</xref>
          . Since we are dealing with sequential data, hence,
LSTM was a natural choice as our baseline neural
network model. Although the aim of this work is to develop
a technique capable of fusing useful information contained
in two different modalities, irrespective of their details, still
we spent significant compute time to discover the optimal
network hyperparameters. This is done through grid-search
confined to a reasonable hyperparameter search space. The
hyperparameter search space included number of layers in
the network, number of neurons in each layer, activation
function for each layer, along with the window size p.
        </p>
        <p>
          Partial auto-correlation of the series was also analyzed to
identify association of the current value in the time-series
with its lagged version as shown in Fig. 2. As evident from
the figure, the series showed strong correlation with its past
1http://www.stat.ucdavis.edu/~clarkf/
three values. This is also cemented by the result of the
gridsearch that chose the window size of three. The final
network consisted of three hidden LSTM layers followed by
a dense regression layer. Apart from the first layer, which
used sigmoid, Rectified Linear Unit (ReLU)
          <xref ref-type="bibr" rid="ref7">(Glorot,
Bordes, and Bengio 2011)</xref>
          was employed as the activation
function. Fig. 3 shows the resulting network architecture. The
data is segregated into train, validation and test set using
70/10/20 ratio. MSE was employed as the corresponding
loss function to be optimized. The network was trained for
600 epochs and the parameters producing the best validation
score were used for generating predictions on the test set.
        </p>
        <p>Auto-Regressive Integrated Moving Average (ARIMA) is
widely used by experts in time-series modelling and
analysis. Therefore, we employed ARIMA as the expert opinion
in our experiments. Since the data demonstrated a
significant seasonal component, the seasonal variant of ARIMA
(SARIMA) was used, whose parameters were estimated
using the Box-Jenkins approach (Box et al. 2015). Fig. 4
demonstrates the predictions obtained by employing the
LSTM model as well as the expert (SARIMA) model on the
test set.</p>
        <p>The overall predictions made by both the LSTM as well
as the expert network seems plausible as shown in Fig. 4(a).
However, it is only through thorough inspection and
investigation on a narrower scale that strengths and weaknesses
of each of the networks are unveiled as shown in Fig. 4(b).
The LSTM tends to capture the overall trend of the data but
suffered when predicting small variations in the time-series.
SARIMA on the other hand was more accurate in
predicting variations in the time-series. In terms of MSE, LSTM
model performed considerably worse when compared to the
expert model. For this dataset, the discovered LSTM model
achieved a MSE of 5.90 compared to 1.24 achieved by
SARIMA on the test set.</p>
      </sec>
      <sec id="sec-3-3">
        <title>KINN: Knowledge Integrated Neural Network</title>
        <p>
          Most of the work in the literature
          <xref ref-type="bibr" rid="ref12 ref8">(Hu et al. 2016; Gollapalli,
Li, and Yang 2017)</xref>
          on incorporating expert knowledge into
the neural network focuses on training the network by
forcing it to mimic the predictions made by the expert network,
ergo updating weights of the network based on the expert’s
information. However, they do not cater for a scenario where
expert network does not contain information about all
possible scenarios. Moreover, these hybrid knowledge based
network approaches are commonly applied to the classification
scenario where output vector of the network corresponds to
a probability distribution. This allows KL-divergence to be
used as the objective function to be minimized in order to
match predictions of the network and the expert network. In
case of time-series forecasting, the output of the network is
a scalar value instead of a distribution which handicaps most
of the prior frameworks proposed in the literature.
        </p>
        <p>The KINN framework promotes both the expert model as
well as the network to complement each other rather than
directly mimicking the expert’s output. This allows KINN to
successfully tackle cases where predictions from the expert
are not reliable. Finding the best expert or neural network
is not the focus here but instead, the focus is to incorporate
expert prediction, may it be flawed, in such a way that the
neural network maintains its strengths while incorporating
strengths of the expert network.</p>
        <p>
          There are many different ways through which knowledge
between an expert and the network can be integrated. Let
x^tp 2 R be the prediction made by the expert. We
incorporate the knowledge from the expert in a residual scheme
inspired by the idea of ResNet curated by
          <xref ref-type="bibr" rid="ref9">(He et al. 2016)</xref>
          .
Let : Rp+1 7! R define the mapping from the input space
to the output space. The learning problem from Eq. 1 after
availability of the expert information can be now be written
as:
x^t = ([xt 1; xt 2; :::; xt p; x^tp]; W) + x^t
p
W
term to the prediction made by the expert model. Since the
model is learning a correction term for the expert’s
prediction, it is essential for the model prediction to be conditioned
on the expert’s prediction as indicated in Eq. 2. There are
two simple ways to achieve this conditioning for the LSTM
network. The first one is to append the prediction at the end
of the sequence as indicated in the equation. Another
possibility is to stack a new channel to the input with repeated
values for the expert’s prediction. The second case makes the
optimization problem easier as the network has direct access
to the expert’s prediction at every time-step. Therefore,
results in minor improvements in terms of MSE. The system
architecture for KINN is shown in Fig. 5.
        </p>
        <p>Incorporating expert knowledge in this residual fashion
serves a very important purpose in our case. In cases where
the expert’s predictions are inaccurate, the network can
generate large offsets in order to compensate for the error, while
the network can essentially output zero in cases where the
expert’s predictions are extremely accurate. With this
flexibility built into the system, the system can itself decide its
reliance on the expert’s predictions.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Evaluation</title>
      <p>We curated a range of different experiments each employing
KINN in a unique scenario in order to evaluate its
performance under varied conditions. We compare KINN results
with the expert as well as the DNN in terms of performance
to highlight the gains achieved by employing the residual
learning scheme. To ensure a fair comparison, all of the
preprocessing and LSTM hyperparameters were kept the same
when the model was tested in isolation and when integrated
as the residual function in KINN.</p>
      <p>In the first setting, we tested and compared KINN’s
performance in the normal case where the expert predictions
are accurate and the LSTM is trained on the complete
training set available. We present the results from this normal
case in experiment # 01. In order to evaluate KINN’s
performance in cases where the amount of training data
available is small or the expert is inaccurate, we established two
different sets of experiments starting from the configuration
employed in the first experiment. In the first case, we
reduced the amount of training data provided to the models
for training. We present the findings from this experiment in
experiment # 02. In the second case, we reduced the
reliability of the expert predictions by injecting random noise. The
results from this experiment are summarized in experiment
# 03. A direct extension of the last two experiments is to
evaluate KINN’s performance in cases where both of these
conditions hold i.e. the amount of training data is reduced
as well as the expert is noisy. We summarize the results for
this experiment in experiment # 04. Finally, we evaluated
KINN’s performance in cases where the expert contained no
information. We achieved this using two different ways. We
first evaluated the case where the expert always predicted
the value of zero. In this case, the target was to evaluate the
impact (if any) of introducing the residual learning scheme
since the amount of information presented to the LSTM
network was exactly the same as the isolated LSTM model in
the first experiment. We then tested a more realistic scenario,
where the expert model replicated the values from the last
time-step of the series. We elaborate the findings from this
experiment (for both settings) in experiment # 05.</p>
      <sec id="sec-4-1">
        <title>Experiment # 01: Full training set and accurate expert</title>
        <p>We first tested both the LSTM as well as the expert model
in isolation in order to precisely capture the impact of
introducing the residual learning scheme. KINN demonstrated
significant improvements in training dynamics directly from
the start. KINN converged faster as compared to the isolated
LSTM. As opposed to the isolated LSTM which required
more training time (epochs) to converge, KINN normally
converged in only one fouth of the epochs taken by the
isolated LSTM, which is a significant improvement in terms
of the compute time. Apart from the compute time, KINN
achieved a MSE of 0.74 on the test set. This is a very
significant improvement in comparison to the isolated LSTM
model that had a MSE of 5.90. Even compared to the expert
model, KINN demonstrated a relative improvement of 40%
in terms of MSE. Fig. 6 showcases the predictions made by
KINN along with the isolated LSTM and the expert network
on the test set. It is evident from the figure that KINN caters
for the weaknesses of each of the two models involved using
the information contained in the other. The resulting
predictions are more accurate than the expert network on minimas
and also captures the small variations in the series which
were missed by the LSTM network.</p>
        <p>In order to further evaluate the results, error at each
timestep is compared for the isolated models along with KINN.
To aid the visualization, step-wise error for first 100
timesteps of the test set is shown in Fig. 6. The plot shows that
the step-wise prediction error of KINN is less than both the
expert model as well as the LSTM for major portion of the
time.</p>
        <p>However, there are instances where predictions made by
KINN are slightly worse than those of the baseline models.
In particular, the prediction error of KINN exceeded the
error of the expert network for only 30% of the time-steps and
only 22% of the time-steps in case of the LSTM network.
Nevertheless, even in those instances, the performance of
KINN was still on par with the other models since on 99%
of the time-steps, the difference in error is less than 1.5.</p>
      </sec>
      <sec id="sec-4-2">
        <title>Experiment # 02: Reduced training set and accurate expert</title>
        <p>One of the objectives of KINN was to reduce dependency
of the network on large amount of labelled data. We argue
that the proposed model not only utilizes expert knowledge
to cater for shortcomings of the network, but also helps in
significantly reducing its dependency on the data. To further
evaluate this claim, a series of experiments were performed.
KINN was trained again from scratch using only 50% of
the data in the training set. The test set remained unchanged.
Similarly, the LSTM network was also trained with the same
50% subset of the training set.</p>
        <p>The LSTM network trained on the 50% subset of the
training data attained a MSE of 6.36 which is slightly worse
than the MSE of network trained on the whole training set.
Minor degradation was also observed in the performance of
the expert network which achieved a MSE of 1.52. Despite
of this reduction in the dataset size, KINN achieved
significantly better results compared to both the LSTM as well as
the expert model achieving a MSE of 0.89. Fig 7 visualizes
the corresponding prediction and error plots of the models
trained on 50% subset of the training data.</p>
        <p>We performed the same experiment again with a very
drastic reduction in the training dataset size by using only
10% subset of the training data. Fig. 8 visualizes the results
from this experiment in the same way, by first plotting the
predictions from the models along with the error plot. It is
interesting to note that since the LSTM performed
considerably poor due to extremely small training set size, the
network shifted its focus to the predictions of the expert
network and made only minor corrections to it as evident from
Fig. 8(a). This highlights KINN’s ability to decide its
reliance on the expert predictions based on the quality of the
information. In terms of the MSE, LSTM model performed
the worst. When trained on only the 10% subset of the
training set, the LSTM model attained a MSE of 6.68, whereas
the expert model achieved MSE of 2.67. KINN on the other
hand, still outperformed both of these models and achieved
a MSE of 1.53.</p>
      </sec>
      <sec id="sec-4-3">
        <title>Experiment # 03: Full training set and noisy expert</title>
        <p>In all of the previous experiments, the expert model was
relatively better compared to the LSTM model employed in our
experiments. The obtained results highlights KINN’s ability
to capitalize over the information obtained from the expert
model to achieve significant improvements in its prediction.
KINN also demonstrated amazing generalization despite of
drastic reduction in the amount of training data, highlighting
KINN’s ability to achieve accurate predictions in low data
regimes. However, in conjunction to reducing dependency
of the network on data, it is also imperative that the
network does not become too dependent on the expert
knowledge making it essential to be accurate/perfect. This is
usually not catered for in most of the prior work. We believe that
the proposed residual scheme enabled the network to handle
erroneous expert knowledge efficiently by allowing it to be
smart enough to realize weaknesses in the expert network
and adjust accordingly. In order to verify KINN’s ability to
adjust with poor predictions from the expert, we performed
another experiment where random noise was injected into
the predictions from the expert network. This random noise
degraded the reliability of the expert predictions. To achieve
this, random noise within one standard deviation of the
average traffic flow was added to the expert predictions. As a
result, the resulting expert predictions attained a MSE of 7.81
which is considerably poor compared to that of the LSTM
(5.90). We then trained KINN using these noisy expert
predictions. Fig. 9 visualizes the corresponding prediction and
error plots.</p>
        <p>As evident from Fig. 9(a), KINN still outperformed both
the expert as well as the LSTM with a MSE of 3.09.
Despite the fact that neither the LSTM, nor the expert model
was accurate, KINN still managed to squeeze out useful
information from both modalities to construct an accurate
predictor. This demonstrates true strength of KITNN as it not
only reduces dependency of the network on the data but also
adapts itself in case of poorly made expert opinions. KINN
achieved a significant reduction of 48% in the MSE of the
LSTM network by incorporating the noisy expert prediction
in the residual learning framework.</p>
      </sec>
      <sec id="sec-4-4">
        <title>Experiment # 04: Reduced training set and noisy expert</title>
        <p>As a natural followup to the last two experiments, we
introduced both conditions at the same time i.e. reduced training
set size and noisy predictions from the expert. The
training set was again reduced to 10% subset of the training data
for training the model while keeping the testing set intact.
Fig. 10 demonstrates that despite this worst condition, KINN
still managed to outperform both the LSTM as well as the
noisy expert predictions.</p>
      </sec>
      <sec id="sec-4-5">
        <title>Experiment # 05: Full training set and poor expert</title>
        <p>As the final experiment, we evaluated KINN’s performance
in cases where the expert predictions are not useful at all. We
achieved this via two different settings. In the first setting,
we considered that the expert network predicts zero every
time. In the second setting the expert network was made to
lag by a step of one resulting in mismatch of the time step
with the predictions. Putting zero in place of x^tp in Eq. 2
yields:
x^t =
([xt 1; xt 2; :::; xt p; 0]; W ) + 0</p>
        <p>This is almost equivalent to the normal unconditioned full
input to output space projection learning case (Eq. 1) except
a zero in the conditioning vector. However, in case of lagged
predictions by the expert network, since we stack the
expert prediction x^tp in a separate channel, the network assigns
a negligible weight to this channel, resulting in exactly the
same performance as the normal case.</p>
        <p>Table 1 provides the details regarding the results obtained
for this experiment. It is clear from the table that in cases
where the expert network either gave zero as its predictions
or gave lagged predictions, which is useless, the network
performance was identical to the normal case since the
network learned to ignore the output from the expert. These
results highlight that KINN provides a lower bound on the
performance based on the performance of the two involved
entities: expert model and the network.</p>
      </sec>
      <sec id="sec-4-6">
        <title>Discussion</title>
        <p>These thorough experiments advocate that the underlying
residual mapping function learned by KINN is successful in
combining the network with the prediction made by the
expert. Specifically, KINN demonstrated the ability to
recognize the quality of the prediction made by both of the base
networks and shifted its reliance according to it. In all of
the experiments that we have conducted, MSE of the
predictions made by KINN never exceeded (disregarding
insignificant changes) the MSE of the predictions achieved by
the best among the LSTM and the expert model except in
case of completely useless expert predictions, where it
performed on par with the LSTM network. Table 1 provides a
summary of the results obtained from all the different
experiments performed. It is interesting to note that even with a
huge reduction in the size of the training set, the MSE does
not drastically increase as one would expect. This is due to
the strong seasonal component present in the dataset. As a
result, even with only 10% subset of the training data, the
algorithms were able to learn the general pattern exhibited
by the sequence. It is only in estimating small variations that
these networks faced difficulty when trained on less data.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>We propose a new architecture for incorporating expert
knowledge into the deep network. It incorporates this expert
knowledge in a residual scheme where the network learns a
correction term for the predictions made by the expert. The
knowledge incorporation scheme introduced by KINN has
three key advantages. The first advantage is regarding the
relaxation of the requirement for a huge dataset to train the
model. The second advantage is regarding the provision of
a lower bound on the performance of the resulting classifier
since KINN achieves the best of both worlds by
combining the two different modalities. The third advantage is its
robustness in catering for poor/noisy predictions made by
the expert. Through extensive evaluation, we demonstrated
that the underlying residual function learned by the network
makes the system robust enough to deal with imprecise
expert information even in cases where there is a dearth of
labelled data. This is because the network does not try to
imitate predictions made by the expert network, but instead
extracts and combines useful information contained in both
of the domains.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgements</title>
      <p>This work is partially supported by Higher Education
Commission (Pakistan), ”Continental Automotive GmbH” and
BMBF project DeFuseNN (Grant 01IW17002).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Baptista</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Sankararaman</surname>
            , S.; de Medeiros,
            <given-names>I. P.</given-names>
          </string-name>
          ; Nascimento Jr,
          <string-name>
            <given-names>C.</given-names>
            ;
            <surname>Prendinger</surname>
          </string-name>
          , H.; and
          <string-name>
            <surname>Henriques</surname>
            ,
            <given-names>E. M.</given-names>
          </string-name>
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>Forecasting fault events for predictive maintenance using data-driven techniques and arma modeling</article-title>
          .
          <source>Computers &amp; Industrial Engineering</source>
          <volume>115</volume>
          :
          <fpage>41</fpage>
          -
          <lpage>53</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          2015.
          <article-title>Time series analysis: forecasting and control</article-title>
          . John Wiley &amp; Sons.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Chiu</surname>
          </string-name>
          , C.-C.;
          <string-name>
            <surname>Sainath</surname>
            ,
            <given-names>T. N.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Prabhavalkar</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ; Nguyen,
          <string-name>
            <given-names>P.</given-names>
            ;
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            ;
            <surname>Kannan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ;
            <surname>Weiss</surname>
          </string-name>
          , R. J.;
          <string-name>
            <surname>Rao</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Gonina</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ; et al.
          <year>2018</year>
          .
          <article-title>State-of-the-art speech recognition with sequence-to-sequence models</article-title>
          .
          <source>In 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source>
          ,
          <fpage>4774</fpage>
          -
          <lpage>4778</lpage>
          . IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Conneau</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Kiela</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ; Schwenk,
          <string-name>
            <given-names>H.</given-names>
            ;
            <surname>Barrault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ; and
            <surname>Bordes</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <year>2017</year>
          .
          <article-title>Supervised learning of universal sentence representations from natural language inference data</article-title>
          .
          <source>arXiv preprint arXiv:1705</source>
          .
          <fpage>02364</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Fildes</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ; Goodwin,
          <string-name>
            <given-names>P.</given-names>
            ; and
            <surname>Onkal</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          <year>2015</year>
          .
          <article-title>Information use in supply chain forecasting</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Glorot</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Bordes</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ; and Bengio,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          <year>2011</year>
          .
          <article-title>Deep sparse rectifier neural networks</article-title>
          .
          <source>In Proceedings of the fourteenth international conference on artificial intelligence and statistics</source>
          ,
          <volume>315</volume>
          -
          <fpage>323</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Gollapalli</surname>
            ,
            <given-names>S. D.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>X.-L.</given-names>
          </string-name>
          ; and
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <year>2017</year>
          .
          <article-title>Incorporating expert knowledge into keyphrase extraction</article-title>
          .
          <source>In AAAI</source>
          ,
          <fpage>3180</fpage>
          -
          <lpage>3187</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>He</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ; and
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <year>2016</year>
          .
          <article-title>Deep residual learning for image recognition</article-title>
          .
          <source>In Proceedings of the IEEE conference on computer vision and pattern recognition</source>
          ,
          <fpage>770</fpage>
          -
          <lpage>778</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          , G.;
          <string-name>
            <surname>Deng</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ; Dahl,
          <string-name>
            <given-names>G. E.</given-names>
            ;
            <surname>Mohamed</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          -r.; Jaitly,
          <string-name>
            <given-names>N.</given-names>
            ;
            <surname>Senior</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ;
            <surname>Vanhoucke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            ;
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          ; Sainath,
          <string-name>
            <surname>T. N.</surname>
          </string-name>
          ; et al.
          <year>2012</year>
          .
          <article-title>Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups</article-title>
          .
          <source>IEEE Signal processing magazine 29</source>
          <volume>(6)</volume>
          :
          <fpage>82</fpage>
          -
          <lpage>97</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <source>arXiv:1503</source>
          .
          <fpage>02531</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          2015.
          <article-title>DistillarXiv preprint Hu</article-title>
          ,
          <string-name>
            <surname>Z.</surname>
          </string-name>
          ; Ma,
          <string-name>
            <given-names>X.</given-names>
            ;
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            ;
            <surname>Hovy</surname>
          </string-name>
          , E.; and
          <string-name>
            <surname>Xing</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <article-title>Harnessing deep neural networks with logic rules</article-title>
          .
          <source>arXiv preprint arXiv:1603</source>
          .
          <fpage>06318</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Krizhevsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.;</given-names>
          </string-name>
          and Hinton,
          <string-name>
            <surname>G. E.</surname>
          </string-name>
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <article-title>Imagenet classification with deep convolutional neural networks</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          ,
          <volume>1097</volume>
          -
          <fpage>1105</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>Lake</surname>
            ,
            <given-names>B. M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Salakhutdinov</surname>
          </string-name>
          , R.; and
          <string-name>
            <surname>Tenenbaum</surname>
            ,
            <given-names>J. B.</given-names>
          </string-name>
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <article-title>Human-level concept learning through probabilistic program induction</article-title>
          .
          <source>Science</source>
          <volume>350</volume>
          (
          <issue>6266</issue>
          ):
          <fpage>1332</fpage>
          -
          <lpage>1338</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          2017.
          <article-title>A comparison of short-term water demand forecasting models</article-title>
          .
          <source>In CCWI2017</source>
          ,
          <fpage>24</fpage>
          -
          <lpage>24</lpage>
          . The University of Sheffield.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <surname>Rohrbach</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Stark</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ; and
          <string-name>
            <surname>Schiele</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <year>2011</year>
          .
          <article-title>Evaluating knowledge transfer and zero-shot learning in a largescale setting</article-title>
          .
          <source>In Computer Vision and Pattern Recognition (CVPR)</source>
          ,
          <source>2011 IEEE Conference on</source>
          ,
          <fpage>1641</fpage>
          -
          <lpage>1648</lpage>
          . IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <surname>Silver</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Maddison</surname>
            ,
            <given-names>C. J.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Guez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Sifre</surname>
          </string-name>
          , L.; Van Den Driessche, G.;
          <string-name>
            <surname>Schrittwieser</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Antonoglou</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Panneershelvam</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Lanctot</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ; et al.
          <year>2016</year>
          .
          <article-title>Mastering the game of go with deep neural networks and tree search</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <source>nature</source>
          <volume>529</volume>
          (
          <issue>7587</issue>
          ):
          <fpage>484</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Shrivastava</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ; and
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <year>2017</year>
          .
          <article-title>Revisiting unreasonable effectiveness of data in deep learning era</article-title>
          .
          <source>In Computer Vision</source>
          (ICCV),
          <year>2017</year>
          IEEE International Conference on,
          <fpage>843</fpage>
          -
          <lpage>852</lpage>
          . IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <string-name>
            <surname>Szegedy</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Zaremba</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ; Sutskever,
          <string-name>
            <surname>I.</surname>
          </string-name>
          ; Bruna,
          <string-name>
            <given-names>J.</given-names>
            ;
            <surname>Erhan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ;
            <surname>Goodfellow</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.;</surname>
          </string-name>
          and Fergus,
          <string-name>
            <surname>R.</surname>
          </string-name>
          <year>2013</year>
          .
          <article-title>Intriguing properties of neural networks</article-title>
          .
          <source>arXiv preprint arXiv:1312</source>
          .
          <fpage>6199</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <string-name>
            <surname>Towell</surname>
            ,
            <given-names>G. G.</given-names>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>Shavlik</surname>
            ,
            <given-names>J. W.</given-names>
          </string-name>
          <year>1994</year>
          .
          <article-title>Knowledgebased artificial neural networks</article-title>
          .
          <source>Artificial intelligence</source>
          <volume>70</volume>
          (1
          <issue>- 2</issue>
          ):
          <fpage>119</fpage>
          -
          <lpage>165</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <string-name>
            <surname>Tran</surname>
            ,
            <given-names>S. N.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Garcez</surname>
          </string-name>
          , A. S. d.
          <year>2018</year>
          .
          <article-title>Deep logic networks: Inserting and extracting knowledge from deep belief networks</article-title>
          .
          <source>IEEE transactions on neural networks and learning systems 29(2)</source>
          :
          <fpage>246</fpage>
          -
          <lpage>258</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          <string-name>
            <surname>Wang</surname>
            , F.-Y.; Zhang,
            <given-names>J. J.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Yuan</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Dai</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ; Zhang, J.; and
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <year>2016</year>
          .
          <article-title>Where does alphago go: From church-turing thesis to alphago thesis and beyond</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          <source>IEEE/CAA Journal of Automatica Sinica</source>
          <volume>3</volume>
          (
          <issue>2</issue>
          ):
          <fpage>113</fpage>
          -
          <lpage>120</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          2017.
          <article-title>Sequence-to-sequence models can directly translate foreign speech</article-title>
          .
          <source>arXiv preprint arXiv:1703</source>
          .
          <fpage>08581</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ; and
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <year>2016</year>
          .
          <article-title>Knowledge enhanced hybrid neural network for text matching</article-title>
          .
          <source>arXiv preprint arXiv:1611</source>
          .
          <fpage>04684</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          <string-name>
            <surname>V.</surname>
          </string-name>
          <year>d</year>
          .
          <year>2017</year>
          .
          <article-title>A semantic loss function for deep learning with symbolic knowledge</article-title>
          .
          <source>arXiv preprint arXiv:1711</source>
          .
          <fpage>11157</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , X.-Y.;
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ; Zhang, Y.-M.; Liu,
          <string-name>
            <surname>C.</surname>
          </string-name>
          -L.; and Bengio,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          <year>2018</year>
          .
          <article-title>Drawing and recognizing chinese characters with recurrent neural network</article-title>
          .
          <source>IEEE transactions on pattern analysis and machine intelligence</source>
          <volume>40</volume>
          (4):
          <fpage>849</fpage>
          -
          <lpage>862</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>W. X.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Jiang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Weng</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>He</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Lim</surname>
            ,
            <given-names>E.-P.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Yan</surname>
          </string-name>
          , H.; and
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <year>2011</year>
          .
          <article-title>Comparing twitter and traditional media using topic models</article-title>
          .
          <source>In European conference on information retrieval</source>
          ,
          <fpage>338</fpage>
          -
          <lpage>349</lpage>
          . Springer.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>