Original: T EMPORAL P ROBABILISTIC A SYMMETRIC M ULTI - TASK L EARNING
Revised: T EMPORAL P ROBABILISTIC A SYMMETRIC M ULTI - TASK L EARNING

Original: Anonymous authors
Revised: Anonymous authors

Original: Paper under double-blind review
Revised: Paper under double-blind review

Original: A BSTRACT
Revised: A BSTRACT

Original: When performing multi-task predictions with time-series data, knowledge learned for one task at a speciﬁc time step may be useful in learning for another task at a later time step (e.g. prediction of sepsis may be useful for prediction of mortality for risk prediction at intensive care units).
Revised: When performing multi-task predictions with time-series data, knowledge learned for one task at a speciﬁc time step may be useful in learning for another task at a later time step (e.g. prediction of sepsis may be useful for prediction of mortality for risk prediction at intensive care units).

Original: To capture such dynamically changing asymmetric relationships between tasks and long-range temporal dependencies in time-series data, we propose a novel temporal asymmetric multi-task learning model, which learns to combine features from other tasks at diverse timesteps for the prediction of each task.
Revised: To capture such dynamically changing asymmetric relationships between tasks and long-range temporal dependencies in time-series data, we propose a novel temporal asymmetric multi-task learning model, which learns to combine features from other tasks at diverse timesteps for the prediction of each task.

Original: One crucial challenge here is deciding on the direction and the amount of knowledge transfer, since loss-based knowledge transfer Lee et al. (2016; 2017) does not apply in our case where we do not have loss at each timestep.
Revised: One crucial challenge here is deciding on the direction and the amount of knowledge transfer, since loss-based knowledge transfer (Lee et al., 2016; 2017) does not apply in our case where we do not have loss at each timestep.

Original: We propose to tackle this challenge by proposing a novel uncertaintybased probabilistic knowledge transfer mechanism, such that we perform knowledge transfer from more certain tasks with lower variance to uncertain ones with higher variance.
Revised: We propose to tackle this challenge by proposing a novel uncertaintybased probabilistic knowledge transfer mechanism, such that we perform knowledge transfer from more certain tasks with lower variance to uncertain ones with higher variance.

Original: We validate our Temporal Probabilistic Asymmetric Multi-task
Revised: We validate our Temporal Probabilistic Asymmetric Multi-task

Original: Learning (TP-AMTL) model on two clinical risk prediction tasks against recent deep learning models for time-series analysis, which our model signiﬁcantly outperforms by successfully preventing negative transfer.
Revised: Learning (TP-AMTL) model on two clinical risk prediction tasks against recent deep learning models for time-series analysis, which our model signiﬁcantly outperforms by successfully preventing negative transfer.

Original: Further qualitative analysis of our model by clinicians suggests that the learned knowledge transfer graphs are helpful in analyzing the model’s predictions.
Revised: Further qualitative analysis of our model by clinicians suggests that the learned knowledge transfer graphs are helpful in analyzing the model’s predictions.

Original:  I NTRODUCTION
Revised:  I NTRODUCTION

Original: Multi-task learning (MTL) (Caruana, 1997) is a method to train a model, or multiple models jointly for multiple tasks to obtain improved generalization, by sharing knowledge among them.
Revised: Multi-task learning (MTL) (Caruana, 1997) is a method to train a model, or multiple models jointly for multiple tasks to obtain improved generalization, by sharing knowledge among them.

Original: One of the most critical problems in multi-task learning is the problem known as negative transfer , where unreliable knowledge from other tasks adversely affects the target task.
Revised: One of the most critical problems in multi-task learning is the problem known as negative transfer , where unreliable knowledge from other tasks adversely affects the target task.

Original: To prevent negative transfer, researchers have sought ways to allow knowledge transfer only among closely related tasks, by either identifying the task groups or learning optimal sharing structure among tasks (Duong et al., 2015; Misra et al., 2016).
Revised: To prevent negative transfer, researchers have sought ways to allow knowledge transfer only among closely related tasks, by either identifying the task groups or learning optimal sharing structure among task (Duong et al., 2015; Misra et al., 2016).

Original: However, not only the task relatedness but the relative reliability of the task-speciﬁc knowledge also matters, and recent asymmetric multi-task learning models (Lee et al., 2016; 2017) tackle this challenge by allowing tasks with low loss to transfer more.
Revised: However, not only the task relatedness but the relative reliability of the task-speciﬁc knowledge also matters, and recent asymmetric multi-task learning models Lee et al. (2016; 2017) tackle this challenge by allowing tasks with low loss to transfer more.

Original: While the asymmetric knowledge transfer between tasks is useful, it does not fully exploit the asymmetry in the case of time-series analysis, which has an additional dimension of the time axis.
Revised: While the asymmetric knowledge transfer between tasks is useful, it does not fully exploit the asymmetry in the case of time-series analysis, which has an additional dimension of the time axis.

Original: With time-series data, knowledge transfer direction may need to be different depending on the timestep.
Revised: With time-series data, knowledge transfer direction may need to be different depending on the timestep.

Original: For instance, suppose that we predict infection and mortality for patients in intensive care units based on their medical records.
Revised: For instance, suppose that we predict infection and mortality for patients in intensive care units based on their medical records.

Original: At earlier timesteps, prediction of infection may be more reliable than mortality, thus we may want knowledge transfer to happen from task infection to mortality; at later timesteps, we may want the opposite situation to happen.
Revised: At earlier timesteps, prediction of infection may be more reliable than mortality, thus we may want knowledge transfer to happen from task infection to mortality; at later timesteps, we may want the opposite situation to happen.

Original: Moreover, knowledge transfer may happen across timesteps.
Revised: Moreover, knowledge transfer may happen across timesteps.

Original: For example, a high risk of infection in early timestep will alarm high risk of mortality at later timesteps.
Revised: For example, a high risk of infection in early timestep will alarm high risk of mortality at later timesteps.

Original: To exploit such temporal relationships between tasks, we need a model that does not perform static knowledge transfer between two tasks (Figure 1a), but dynamically changes the knowledge transfer amount and direction at each timestep, and also transfers knowledge across timesteps (Figure 1b).
Revised: To exploit such temporal relationships between tasks, we need a model that does not perform static knowledge transfer between two tasks (Figure 1a), but dynamically changes the knowledge transfer amount and direction at each timestep, and also transfers knowledge across timesteps (Figure 1b).

Original: Toward this objective, we propose a multi-task learning framework for time-series data, where each task not only learns its own latent features at each timestep but also aggregates the latent features from the other tasks at the same or different timesteps via attention allocation.
Revised: Toward this objective, we propose a multi-task learning framework for time-series data, where each task not only learns its own latent features at each timestep but also aggregates the latent features from the other tasks at the same or different timesteps via attention allocation.

Original: [Figure]
Revised: [Figure]

Original: Yet this brings in another challenge.
Revised: Yet this brings in another challenge.

Original: On what basis should we promote asymmetric knowledge transfer?
Revised: On what basis should we promote asymmetric knowledge transfer?

Original: For asymmetric knowledge transfer between tasks, we could use task loss as a proxy of knowledge reliability.
Revised: For asymmetric knowledge transfer between tasks, we could use task loss as a proxy of knowledge reliability.

Original: However, loss is not a direct measure of reliability, since a model trained with few instances may have a small loss, while the knowledge from the model could be highly biased and unreliable.
Revised: However, loss is not a direct measure of reliability, since a model trained with few instances may have a small loss, while the knowledge from the model could be highly biased and unreliable.

Original: Further, for prediction with time-series data, loss may not be available at every timestep.
Revised: Further, for prediction with time-series data, loss may not be available at every timestep.

Original: Thus, instead of task loss, we focus on the uncertainty , which can be obtained with probabilistic Bayesian models.
Revised: Thus, instead of task loss, we focus on the uncertainty , which can be obtained with probabilistic Bayesian models.

Original: Basically, if a latent feature learned at a certain timestep has large uncertainty (variance), we can consider its knowledge as unreliable.
Revised: Basically, if a latent feature learned at a certain timestep has large uncertainty (variance), we can consider its knowledge as unreliable.

Original: In such a case, the model may allocate small attention values for the feature; that is, the attention will be attenuated based on the uncertainty.
Revised: In such a case, the model may allocate small attention values for the feature; that is, the attention will be attenuated based on the uncertainty.

Original: To validate the superiority of our model, we experiment with it on three clinical risk prediction datasets against multiple baselines.
Revised: To validate the superiority of our model, we experiment with it on three clinical risk prediction datasets against multiple baselines.

Original: The results show that our model obtains signiﬁcant improvements over strong multi-task learning baselines.
Revised: The results show that our model obtains signiﬁcant improvements over strong multi-task learning baselines.

Original: Further, both the asymmetric knowledge transfer between tasks at two different timesteps as well as the uncertainty-based attenuation of attention weights are found to be useful in improving the generalization performance.
Revised: Further, both the asymmetric knowledge transfer between tasks at two different timesteps as well as the uncertainty-based attenuation of attention weights are found to be useful in improving the generalization performance.

Original: Our contribution in this work is threefold:
Revised: Our contribution in this work is threefold:

Original: • We propose a novel asymmetric multi-task learning framework for time-series analysis, which utilizes feature-level uncertainty to perform knowledge transfer among tasks and across time-steps, thereby exploiting both the task-relatedness and temporal dependencies.
Revised: • We propose a novel asymmetric multi-task learning framework for time-series analysis, which utilizes feature-level uncertainty to perform knowledge transfer among tasks and across time-steps, thereby exploiting both the task-relatedness and temporal dependencies.

Original: • We use a probabilistic Bayesian formulation for asymmetric knowledge transfer, where the amount of knowledge transfer depends on the uncertainty at the feature level.
Revised: • We use a probabilistic Bayesian formulation for asymmetric knowledge transfer, where the amount of knowledge transfer depends on the uncertainty at the feature level.

Original: • We validate our model on clinical risk prediction tasks, on which it achieves signiﬁcant improvements over baselines and provides meaningful interpretations, including temporal relationships between tasks.
Revised: • We validate our model on clinical risk prediction tasks, on which it achieves signiﬁcant improvements over baselines and provides meaningful interpretations, including temporal relationships between tasks.

Original:  R ELATED W ORK
Revised:  R ELATED W ORK

Original: Multi-task Learning While the literature on multi-task learning (Caruana, 1997) is vast, we selectively mention the prior works that are closely related to ours.
Revised: Multi-task Learning While the literature on multi-task learning (Caruana, 1997; Argyriou et al., 2008) is vast, we selectively mention the prior works that are closely related to ours.

Original: Historically, multi-task learning models have focused on what to share , as the jointly learned models could share instances, parameters, or features.
Revised: Historically, multi-task learning models have focused on what to share (Yang & Hospedales, 2016a;b; Ruder et al.), as the jointly learned models could share instances, parameters, or features (Kang et al., 2011; Kumar & Daume III, 2012; Maurer et al., 2013).

Original: With deep learning, multi-task learning can be implemented rather straightforwardly by making multiple tasks to share the same deep network.
Revised: With deep learning, multi-task learning can be implemented rather straightforwardly by making multiple tasks to share the same deep network.

Original: However, since solving different tasks will require heterogeneous knowledge, complete sharing of the underlying network may be suboptimal and brings in a problem known as negative transfer , where certain tasks are negatively affected by knowledge sharing.
Revised: However, since solving different tasks will require heterogeneous knowledge, complete sharing of the underlying network may be suboptimal and brings in a problem known as negative transfer , where certain tasks are negatively affected by knowledge sharing.

Original: To prevent this, researchers are exploring more effective knowledge sharing structures.
Revised: To prevent this, researchers are exploring more effective knowledge sharing structures.

Original: Duong et al.
Revised: Duong et al.

Original: (2015) proposed a soft parameter sharing method that uses a regularizer to enforce the network parameters for each task to be similar, while Misra et al.
Revised: (2015) proposed a soft parameter sharing method that uses a regularizer to enforce the network parameters for each task to be similar, while Misra et al.

Original: (2016) proposed to learn the optimal combination of shared and task-speciﬁc representations in computer vision.
Revised: (2016) proposed to learn the optimal combination of shared and taskspeciﬁc representations in computer vision.

Original: Kendall et al.
Revised: Kendall et al.

Original: (2018) proposed a multi-task framework when the losses are weighed based on tasks’ uncertainty, thereby reducing negative transfer from uncertain tasks.
Revised: (2018) proposed a multi-task framework when the losses are weighed based on tasks’ uncertainty, thereby reducing negative transfer from uncertain tasks.

Original: While ﬁnding a good sharing structure can alleviate negative transfer, negative transfer will still persist if we perform symmetric knowledge transfer among tasks.
Revised: While ﬁnding a good sharing structure can alleviate negative transfer, negative transfer will still persist if we perform symmetric knowledge transfer among tasks.

Original: To resolve this symmetry issue, Lee et al.
Revised: To resolve this symmetry issue, Lee et al.

Original: (2016) proposed an asymmetric MTL model with inter-task knowledge transfer that allows task-speciﬁc parameters for tasks with smaller loss to transfer more.
Revised: (2016) proposed an asymmetric MTL model with inter-task knowledge transfer that allows task-speciﬁc parameters for tasks with smaller loss to transfer more.

Original: Lee et al.
Revised: Lee et al.

Original: (2017) proposed a model for asymmetric taskto-feature transfer that allows reconstructing features with task-speciﬁc features while considering their loss, which is more suitable for deep neural networks and scalable.
Revised: (2017) proposed a model for asymmetric task-to-feature transfer that allows reconstructing features with task-speciﬁc features while considering their loss, which is more suitable for deep neural networks and scalable.

Original: Our model is also targetting asymmetric multi-task learning, but is different from these previous works in that it utilizes uncertainty rather than loss as the measure of task reliability, and performs asymmetric knowledge transfer at each timestep, and across timesteps.
Revised: Our model is also targetting asymmetric multi-task learning, but is different from these previous works in that it utilizes uncertainty rather than loss as the measure of task reliability, and performs asymmetric knowledge transfer at each timestep, and across timesteps.

Original: Clinical time-series analysis While our method is generic and applicable to any time-series prediction tasks, we mostly focus on clinical time-series analysis in this paper.
Revised: Clinical time-series analysis While our method is generic and applicable to any time-series prediction tasks, we mostly focus on clinical time-series analysis in this paper.

Original: Recently, there has been some progress on this topic, mostly focusing on interpretability and reliability of the model.
Revised: Recently, there has been some progress on this topic, mostly focusing on interpretability and reliability of the model.

Original: Choi et al.
Revised: Choi et al.

Original: (2016) proposed an attention-based model that generates attention for both the timesteps (hospital visits) and features (medical examination results), to provide interpretations of the predictions.
Revised: (2016) proposed an attention-based model that generates attention for both the timesteps (hospital visits) and features (medical examination results), to provide interpretations of the predictions.

Original: However, attentions are often unreliable since they are learned in a weakly-supervised manner, and
Revised: However, attentions are often unreliable since they are learned in a weakly-supervised manner, and

Original: Heo et al.
Revised: Heo et al.

Original: (2018) proposed to obtain reliable interpretation and prediction by proposing a probabilistic attention mechanism that considers uncertainty as to how to trust the input.
Revised: (2018) proposed to obtain reliable interpretation and prediction by proposing a probabilistic attention mechanism that considers uncertainty as to how to trust the input.

Original: Our work shares the motivation with these prior works as we target interpretability and reliability.
Revised: Our work shares the motivation with these prior works as we target interpretability and reliability.

Original: Recently, Song et al.
Revised: Recently, Song et al.

Original: (2018) proposed a model that uses the Transformer architecture to perform time-series prediction with multi-task learning experiments.
Revised: (2018) proposed a model that uses the Transformer architecture to perform time-series prediction with multi-task learning experiments.

Original: However, their model takes a straightforward approach where all tasks share a single base network, which is susceptible to negative transfer.
Revised: However, their model takes a straightforward approach where all tasks share a single base network, which is susceptible to negative transfer.

Original:  A PPROACH
Revised:  A PPROACH

Original: We now formally describe the problem setting and our probabilistic asymmetric multi-task learning framework for time-series prediction.
Revised: We now formally describe the problem setting and our probabilistic asymmetric multi-task learning framework for time-series prediction.

Original: 3. T IME - SERIES PREDICTION WITH FEATURE - LEVEL UNCERTAINTY
Revised: 3. T IME - SERIES PREDICTION WITH FEATURE - LEVEL UNCERTAINTY

Original: Our goal is to jointly train time-series prediction models for multiple tasks at once.
Revised: Our goal is to jointly train time-series prediction models for multiple tasks at once.

Original: Suppose that we are given training data for D tasks, D = { ( X 1 , Y 1 ) , . . .
Revised: Suppose that we are given training data for D tasks, D = { ( X 1 , Y 1 ) , . . .

Original: , ( X D , Y D ) } .
Revised: , ( X D , Y D ) } .

Original: Further suppose that each data instance x ( x ∈ X d for some d ) consists of T timesteps.
Revised: Further suppose that each data instance x ( x ∈ X d for some d ) consists of T timesteps.

Original: That is, x = ( x (1) , x (2) , . . .
Revised: That is, x = ( x (1) , x (2) , . . .

Original: , x ( T ) ) , where x ( t ) ∈
Revised: , x ( T ) ) , where x ( t ) ∈

Original: R 1 × m denote the data instance for the timestep t .
Revised: R 1 × m denote the data instance for the timestep t .

Original: Additional, y d is the label for task d ; for binary classiﬁcation task, y d ∈ { 0 , 1 } , and for regression case, y d ∈ R .
Revised: Additional, y d is the label for task d ; for binary classiﬁcation task, y d ∈ { 0 , 1 } , and for regression case, y d ∈ R .

Original: Given time-series data and tasks, we want to learn the task-speciﬁc latent features for each task and timestep, and then perform asymmetric knowledge transfer between them.
Revised: Given time-series data and tasks, we want to learn the task-speciﬁc latent features for each task and timestep, and then perform asymmetric knowledge transfer between them.

Original: Our multi-task learning framework is comprised of the following components:
Revised: Our multi-task learning framework is comprised of the following components:

Original: Shared Low-Level Layers (Figure 2 a)
Revised: Shared Low-Level Layers (Figure 2a)

Original: We allow our model to share low-level layers for all the tasks in order to learn a common data representation before learning task-speciﬁc features.
Revised: We allow our model to share low-level layers for all the tasks in order to learn a common data representation before learning task-speciﬁc features.

Original: At the lowest layer, we have a shared linear data embedding layer to embed the data instance for each timestep into a continuous shared feature space.
Revised: At the lowest layer, we have a shared linear data embedding layer to embed the data instance for each timestep into a continuous shared feature space.

Original: Given a time-series data instance x , we ﬁrst linearly transform the data point for each timestep t , x ( t ) ∈ R m , which contains m variables.
Revised: Given a time-series data instance x , we ﬁrst linearly transform the data point for each timestep t , x ( t ) ∈ R m , which contains m variables.

Original: [Equation]
Revised: [Equation]

Original: where W emb ∈ R m × k and k is the number of hidden units.
Revised: where W emb ∈ R m × k and k is the number of hidden units.

Original: After embedding the data instances, we input them into a shared RNN layer for pre-processing:
Revised: After embedding the data instances, we input them into a shared RNN layer for pre-processing:

Original: [Equation]
Revised: [Equation]

Original: Task- and Timestep Embedding Layers After embedding and pre-processing the input into a continuous space, we further encode them into task- and timestep-speciﬁc features.
Revised: Task- and Timestep Embedding Layers After embedding and pre-processing the input into a continuous space, we further encode them into task- and timestep-speciﬁc features.

Original: Since hardsharing layers may result in negative transfer between tasks, we use separate embedding layers for each task to encode task-speciﬁc knowledge.
Revised: Since hardsharing layers may result in negative transfer between tasks, we use separate embedding layers for each task to encode task-speciﬁc knowledge.

Original: For each task d , the separate network consists of L layers (Figure 2b) of feed-forward networks, to learn disentangled knowledge for each timestep.
Revised: For each task d , the separate network consists of L layers (Figure 2b) of feed-forward networks, to learn disentangled knowledge for each timestep.

Original: The L feed-forward layers for task embedding (Figure 2b) can be formalized as:
Revised: The L feed-forward layers for task embedding (Figure 2b) can be formalized as:

Original: [Equation]
Revised: [Equation]

Original: where W id ∈ R k × k , b id ∈ R k and σ is a non-linear activation function (e.g. leaky relu).
Revised: where W id ∈ R k × k , b id ∈ R k and σ is a non-linear activation function (e.g. leaky relu).

Original: Modeling feature-level uncertainty While the above embedding can capture knowledge for each task and timestep, we want to further model their uncertainties as well, to measure the reliability of the knowledge captured.
Revised: Modeling feature-level uncertainty While the above embedding can capture knowledge for each task and timestep, we want to further model their uncertainties as well, to measure the reliability of the knowledge captured.

Original: Towards this objective, we model the latent variables as probabilistic random variables, with two types of uncertainty (Kendall & Gal, 2017): 1) epistemic uncertainty , which comes from the model’s unreliability from the lack of training data, and 2) aleatoric uncertainty , that comes from the inherent ambiguity in the data.
Revised: Towards this objective, we model the latent variables as probabilistic random variables, with two types of uncertainty (Kendall & Gal, 2017): 1) epistemic uncertainty , which comes from the model’s unreliability from the lack of training data, and 2) aleatoric uncertainty , that comes from the inherent ambiguity in the data.

Original: We capture the former by using dropout variational inference (Gal & Ghahramani, 2016), and the latter by explicitly learning the model variance as a function of the input (Figure 2c).
Revised: We capture the former by using dropout variational inference (Gal & Ghahramani, 2016), and the latter by explicitly learning the model variance as a function of the input (Figure 2c).

Revised: Suppose that our generative model is: z d ∼ p θ ( z d | x , ω ) , y d ∼ p θ ( y d | x , z d , ω ) where ω is the set of all parameters, p θ ( z d | x , ω ) and p θ ( y d | x , z d , ω ) are networks parameterized by θ .

Revised: We denote all joint, marginal and conditional distributions arising from this generative model by p .

Original: [Equation]
Revised: [Equation]

Original: Formally, z d ∼ p ( z d | x , y d , ω ) , ω ∼ p ( ω | D ) and we use variational inference to approximate the joint distribution:
Revised: The posterior distributions p ( z d | x , y d , ω ) and p ( ω | D ) are intractable so we use variational inference to approximate the joint distribution. The variational distribution is deﬁned by:

Original: [Equation]
Revised: [Equation]

Original: We set q M ( ω | D ) by dropout approximation (Gal & Ghahramani, 2016) with parameter M and simply set q ( z d | x , y d , ω ) to  p θ ( z d | x , ω )  for the model consistency at both training and test time.
Revised: We set q M ( ω | D ) by dropout approximation (Gal & Ghahramani, 2016) with parameter M and simply set q ( z d | x , y d , ω ) to the prior network p θ ( z d | x , ω ) (which works well in practice (Sohn et al., 2015; Heo et al., 2018)) for the model consistency at both training and test time.

Original: 3. U NCERTAINTY - AWARE KNOWLEDGE TRANSFER
Revised: 3. U NCERTAINTY - AWARE KNOWLEDGE TRANSFER

Original: We perform asymmetric knowledge transfer in the feature space.
Revised: We perform asymmetric knowledge transfer in the feature space.

Original: Suppose that we have latent feature vectors f and g for two tasks at different timesteps.
Revised: Suppose that we have latent feature vectors f and g for two tasks at different timesteps.

Original: Then the model needs to decide on both 1) the amount of knowledge to transfer, and 2) the form of the transferred knowledge: 1) The amount of knowledge to transfer Existing AMTL models (Lee et al., 2016; 2017) often use task loss to decide on the amount of knowledge transfer, such that task-speciﬁc parameters with low task loss to transfer more, while tasks with high loss only receive knowledge transfer.
Revised: Then the model needs to decide on both 1) the amount of knowledge to transfer, and 2) ‘the transferred knowledge: 1) The amount of knowledge to transfer Existing AMTL models (Lee et al., 2016; 2017) often use task loss to decide on the amount of knowledge transfer, such that task-speciﬁc parameters with low task loss to transfer more, while tasks with high loss only receive knowledge transfer.

Original: Yet, the task loss may be unreliable as a measure of the knowledge from the task and may not be available at each timestep.
Revised: Yet, the task loss may be unreliable as a measure of the knowledge from the task and may not be available at each timestep.

Original: To overcome these limitations, we propose to learn the amount of knowledge transfer based on the feature-level uncertainty.
Revised: To overcome these limitations, we propose to learn the amount of knowledge transfer based on the feature-level uncertainty.

Original: With our probabilistic time-series prediction model described in the previous subsection, the source features f and the target features g follow some distributions.
Revised: With our probabilistic time-series prediction model described in the previous subsection, the source features f and the target features g follow some distributions.

Original: Speciﬁcally, f ∼ p ( f ; µ f , σ f ) and g ∼ p ( g ; µ g , σ g ) .
Revised: Speciﬁcally, f ∼ p ( f ; µ f , σ f ) and g ∼ p ( g ; µ g , σ g ) .

Original: Our model learns the distribution of the transfer weight α from f to g by a small network F θ parameterized by θ , which takes both (instances of) f
Revised: Our model learns the distribution of the transfer weight α from f to g by a small network F θ parameterized by θ , which takes both (instances of) f

Original: and g as its input:
Revised: and g as its input:

Original: [Equation]
Revised: [Equation]

Revised: In general, F θ is a function from R 2 k to R 2 .

Revised: In practice, to avoid the concatenation of f and g (which can be slow), we adopt a simple implementation: µ a = σ ( σ ( fW f + b f ) · σ ( gW g + b g )) and σ a = soft _ plus ( µ a w + b ) , where σ is some activation function (which should not be confused with σ a ) and · is the inner product.

Revised: [Figure]

Original: By using Stochastic Gradient Variational Bayes (SGVB), the network F can learn a meaningful distribution of the transfer weight, such that it sets the value of α high when the f and g are related, with low uncertainty on f and high uncertainty on g .
Revised: By using Stochastic Gradient Variational Bayes (SGVB), the network F can learn a meaningful distribution of the transfer weight, such that it sets the value of α high when the f and g are related, with low uncertainty on f and high uncertainty on g .

Original: The form of transferred knowledge Because f and g may have completely different representations, directly combining the two by adding α f to g is suboptimal.
Revised: The form of transferred knowledge Because f and g may have completely different representations, directly combining the two by adding α f to g is suboptimal.

Original: Instead, we use a network G φ parameterized by φ to non-linearly transform f into a compatible representation for 
Revised: Instead, we use a network G φ parameterized by φ to non-linearly transform f into a compatible representation for g (Figure 3a).

Original: g

Original: Figure 3a).

Original: The combined features C then can be expressed as follows:
Revised: The combined features C then can be expressed as follows:

Original: [Equation]
Revised: [Equation]

Original: [Equation]

Original: [Figure]

Original: where W ∈ R k × k , b ∈ R k and σ is a non-linear activation (e.g. leaky relu).
Revised: where W ∈ R k × k , b ∈ R k and σ is a non-linear activation (e.g. leaky relu).

Original: Furthermore, when transferring knowledge from a source task to a target task, the target task should only borrow knowledge from the source task without affecting its feature map via backpropagation.
Revised: Furthermore, when transferring knowledge from a source task to a target task, the target task should only borrow knowledge from the source task without affecting its feature map via backpropagation.

Original: To this end, we block the gradient of f in the formulation of C in 11.
Revised: To this end, we block the gradient of f in the formulation of C in 11.

Original: We also empirically found that this gradient blocking makes the obtained knowledge transfer graph signiﬁcantly more interpretable.
Revised: We also empirically found that this gradient blocking makes the obtained knowledge transfer graph signiﬁcantly more interpretable.

Original: 3. A SYMMETRIC KNOWLEDGE TRANSFER ACROSS TASKS AND TIME STEPS
Revised: 3. A SYMMETRIC KNOWLEDGE TRANSFER ACROSS TASKS AND TIME STEPS

Original: Now we apply the proposed probabilistic asymmetric knowledge transfer method to perform knowledge transfer across timesteps, both within each task and across tasks, to exploit intra- and inter-task temporal dependencies.
Revised: Now we apply the proposed probabilistic asymmetric knowledge transfer method to perform knowledge transfer across timesteps, both within each task and across tasks, to exploit intra- and inter-task temporal dependencies.

Original: In order to transfer knowledge from task j to task d with temporal dependencies, we allow the latent features of task d at time step t ( f ( t ) d , with z d = ( f (1) d , f (2) d , ..., f ( T ) d ) ) to obtain knowledge from task j
Revised: In order to transfer knowledge from task j to task d with temporal dependencies, we allow the latent features of task d at time step t ( f ( t ) d , with z d = ( f (1) d , f (2) d , ..., f ( T ) d ) ) to obtain knowledge from task j

Original: at all previous time steps (see Figure 3b), and then combine them into a single feature map C (1) d , C (2) d , ..., C ( T ) d :
Revised: at all previous time steps (see Figure 3b), and then combine them into a single feature map C (1) d , C (2) d , ..., C ( T ) d :

Original: [Equation]
Revised: [Equation]

Original: Here, we chose to constrain the knowledge transfer to happen only from past to future timesteps because of the time complexity at inference time.
Revised: Here, we chose to constrain the knowledge transfer to happen only from past to future timesteps because of the time complexity at inference time.

Original: With our proposed model, for each update at the clinical environment in a online manner, we only need to transfer the knowledge from previous time steps to the current one, making the complexity to be O ( T ) .
Revised: With our proposed model, for each update at the clinical environment in a online manner, we only need to transfer the knowledge from previous time steps to the current one, making the complexity to be O ( T ) .

Original: This is on a par with other models like
Revised: This is on a par with other models like

Original: RETAIN (Choi et al., 2016) or UA (Heo et al., 2018), making it highly scalable.
Revised: RETAIN (Choi et al., 2016) or UA (Heo et al., 2018), making it highly scalable.

Original: However, if we allow the knowledge to transfer from future timestep to past timestep, we also need to update the knowledge at previous timesteps for a single update.
Revised: However, if we allow the knowledge to transfer from future timestep to past timestep, we also need to update the knowledge at previous timesteps for a single update.

Original: The time complexity of the model in this case is O
Revised: The time complexity of the model in this case is O

Original: ( T 2 ) , which is undesirable.
Revised: ( T 2 ) , which is undesirable.

Original: In the ablation study in Section 4.5, we show that this constraint also brings in small performance gain.
Revised: In the ablation study in Section 4.5, we show that this constraint also brings in small performance gain.

Revised: The total complexity of the whole training or inference is still O

Revised: ( T 2 ) .

Revised: However, it is expected due to the inter-timestep transfer, and is on a par with state-ofthe-art models such as Transformer(Vaswani et al., 2017) or RETAIN(Choi

Original:  Finally, we use the combined features C (1) d , C (2) d , ..., C ( T ) d , which contain temporal dependencies among tasks, for prediction for each task d .
Revised: et al., 2016). Finally, we use the combined features C (1) d , C (2) d , ..., C ( T ) d , which contain temporal dependencies among tasks, for prediction for each task d .

Original: We use an attention mechanism:
Revised: We use an attention mechanism:

Original: [Equation]
Revised: [Equation]

Original:  where W βd ∈ R k × k and b βd ∈ R k , and α ( i,t ) j,d ( i ≤ t ) is the knowledge transfer weight from task j at timestep i to task d at timestep t .
Revised: b β d (cid:17) ∀ t ∈ { [Equation] T } where W βd ∈ R k × k and b βd ∈ R k , and α ( i,t ) j,d ( i ≤ t ) is the knowledge transfer weight from task j at timestep i to task d at timestep t .

Original: Then the model can perform prediction as follows,
Revised: Then the model can perform prediction as follows,

Original: [Equation]
Revised: [Equation]

Original: for classiﬁcation tasks, where (cid:12) denotes the element-wise multiplication, W od ∈ R k × 1 and b od ∈ R. Predictions for other tasks are done similarly.
Revised: for classiﬁcation tasks, where (cid:12) denotes the element-wise multiplication between attention β d ( t ) and shared input embedding v ( t ) (from Eq. 1), W od ∈ R k × 1 and b od ∈ R 1 . Predictions for other tasks are done similarly.

Revised: It should be noted that our model does not require each instance to have the labels for every tasks.

Revised: We can just maximize the likelihood p ( y d | x ) whenever the label y d is available for input x for task d .

Revised: Furthermore, it is not required that all the instances to have the same number of time-steps T .

Revised: But in practice, we can use zero-padding to make the training easier.

Original:  E XPERIMENTS
Revised:  E XPERIMENTS

Original: We validate our model on multiple clinical risk prediction tasks against relevant baselines.
Revised: We validate our model on multiple clinical risk prediction tasks against relevant baselines.

Original: 4. T ASKS AND D ATASETS
Revised: 4. T ASKS AND D ATASETS

Original: We experiment on two clinical time-series datasets.
Revised: We experiment on two clinical time-series datasets.

Original: For all datasets, we randomly split the data into training, validation, and test set.
Revised: For all datasets, we randomly split the data into training, validation, and test set.

Original: For more details on the datasets and tasks, including explanations for dataset MIMIC III - Infection , the base network conﬁgurations and hyperparameters, and more experimental results on an additional dataset (MIMIC III - Heart Failure), please see the appendix .
Revised: For more details on the datasets and tasks, including explanations for dataset MIMIC III - Infection , the base network conﬁgurations and hyperparameters, and more experimental results on an additional dataset (MIMIC III - Heart Failure), please see the appendix .

Original: 1) MIMIC III - Infection (Figure 6).
Revised: 1) MIMIC III - Infection (Figure 6).

Original: We compiled a dataset out of the MIMIC III dataset (Johnson et al., 2016), which contains electronic health records (EHR) of 53,423 distinct hospital admissions between 2001 and 2012 to the intensive care unit (ICU) of a hospital.
Revised: We compiled a dataset out of the MIMIC III dataset (Johnson et al., 2016), which contains electronic health records (EHR) of 53,423 distinct hospital admissions between 2001 and 2012 to the intensive care unit (ICU) of a hospital.

Original: We use records of patients over age 15, from the ﬁrst 48 hours after the admission, in 48 timesteps.
Revised: We use records of patients over age 15, from the ﬁrst 48 hours after the admission, in 48 timesteps.

Original: Following clinician’s guidelines, we select 12 infection-related variables for the features at each timestep, including heart rate , arterial blood pressure , and Glasgow Coma Scale(GCS) .
Revised: Following clinician’s guidelines, we select 12 infection-related variables for the features at each timestep, including heart rate , arterial blood pressure , and Glasgow Coma Scale(GCS) .

Original: Tasks we consider for this dataset are the ones that are necessary for the diagnostic process of patient’s infectious status; The ﬁrst task, body temperature elevation (Task 1) provides the signs of infection, and Infection (Task 2) as the conﬁrmation of infection by the result of microbiology tests.
Revised: Tasks we consider for this dataset are the ones that are necessary for the diagnostic process of patient’s infectious status; The ﬁrst task, body temperature elevation (Task 1) provides the signs of infection, and Infection (Task 2) as the conﬁrmation of infection by the result of microbiology tests.

Original: We also added Mortality (Task 3) as a possible outcome of infection.
Revised: We also added Mortality (Task 3) as a possible outcome of infection.

Original: After pre-processing the data, we were able to select approximately 2000 data points.
Revised: After pre-processing the data, we were able to select approximately 2000 data points (that have sufﬁcient amount of features).

Original: We use a random split of approximately 1000 / 500 / 500 for training/validation/test.
Revised: We use a random split of approximately 1000 / 500 / 500 for training/validation/test.

Original: 2) PhysioNet.
Revised: 2) PhysioNet.

Original: This dataset (Citi & Barbieri, 2012) contains 4,000 medical records from ICU.
Revised: This dataset (Citi & Barbieri, 2012) contains 4,000 medical records from ICU.

Original: Each record contains 48 hours of records, each of which contains 31 physiological signs including heart rate , respiratory rate , temperature , etc.
Revised: Each record contains 48 hours of records, each of which contains 31 physiological signs including heart rate , respiratory rate , temperature , etc.

Original: Task used in the experiment includes four binary classiﬁcation tasks, namely, 1) Mortality prediction , 2) Length-of-stay less than 3 days : whether the patient would stay in ICU for less than three days, 3) Cardiac Surgery ICU(Cardiac): whether the patient is recoveing from cardiac surgery, and 4) Recovery in Surgical ICU(Recovery): whether the patient is staying in Surgical ICU to recover from surgery.
Revised: Task used in the experiment includes four binary classiﬁcation tasks, namely, 1) Mortality prediction , 2) Length-of-stay less than 3 days : whether the patient would stay in ICU for less than three days, 3) Cardiac Surgery ICU(Cardiac): whether the patient is recoveing from cardiac surgery, and 4) Recovery in Surgical ICU(Recovery): whether the patient is staying in Surgical ICU to recover from surgery.

Original: We use a random split of 2800 / 400 / 800 for training/validation/test.
Revised: We use a random split of 2800 / 400 / 800 for training/validation/test.

Original: 4. B ASELINES
Revised: 4. B ASELINES

Original: Now we describe the baseline single-task and multi-task models for time-series prediction, along with our models.
Revised: Now we describe the baseline single-task and multi-task models for time-series prediction, along with our models.

Original: 1) STL-LSTM.
Revised: 1) STL-LSTM.

Original: The base single-task Long Short-Term Memory Network for time-series prediction.
Revised: The base single-task Long Short-Term Memory Network for time-series prediction.

Original: 2) RETAIN.
Revised: 2) RETAIN.

Original: The attentional RNN proposed in (Choi et al., 2016) which focuses on interpretability, for clinical prediction with electronic health records.
Revised: The attentional RNN proposed in (Choi et al., 2016) which focuses on interpretability, for clinical prediction with electronic health records.

Original: 3) UA.
Revised: 3) UA.

Original: The uncertainty-aware probabilistic attention model proposed in (Heo et al., 2018) for interpretable time-series prediction.
Revised: The uncertainty-aware probabilistic attention model proposed in (Heo et al., 2018) for interpretable time-series prediction.

Original: 4) MTL-LSTM.
Revised: 4) MTL-LSTM.

Original: The naive hard-sharing multi-task learning method where all tasks share the same network except for the separate output layers for prediction, with LSTM as the base network.
Revised: The naive hard-sharing multi-task learning method where all tasks share the same network except for the separate output layers for prediction, with LSTM as the base network.

Original: 5) MTL-Transformer.
Revised: 5) MTL-Transformer.

Original: The same as MTL-LSTM, but with Transformer (Vaswani et al., 2017) as  the base network.
Revised: The same as MTL-LSTM, but with Transformer (Vaswani et al., 2017) as [Table] [Table] the base network.

Original: 6) MTL-RETAIN.
Revised: 6) MTL-RETAIN.

Original: The same as MTL-LSTM, but with RETAIN as the base network.
Revised: The same as MTL-LSTM, but with RETAIN as the base network.

Original: 7) MTL-UA.
Revised: 7) MTL-UA.

Original: The same as MTL-LSTM, but with UA (Heo et al., 2018) as the base network.
Revised: The same as MTL-LSTM, but with UA (Heo et al., 2018) as the base network.

Original: 8) AMTL-LSTM.
Revised: 8) AMTL-LSTM.

Original: Asymmetric multi-task learning (Lee et al., 2016) adopted for our time-series prediction framework, where we learn the knowledge transfer graph between task-speciﬁc parameters, for asymmetric knowledge transfer based on the task loss.
Revised: Asymmetric multi-task learning (Lee et al., 2016) adopted for our time-series prediction framework, where we learn the knowledge transfer graph between task-speciﬁc parameters, for asymmetric knowledge transfer based on the task loss.

Original: Since the parameters for each task are shared across all timesteps, this will result in static asymmetric transfer between tasks.
Revised: Since the parameters for each task are shared across all timesteps, this will result in static asymmetric transfer between tasks.

Original: 9) MTL-RETAIN-Kendall.
Revised: 9) MTL-RETAIN-Kendall.

Original: This is the uncertainty-based loss-weighing scheme proposed in Kendall et al.
Revised: This is the uncertainty-based loss-weighing scheme proposed in Kendall et al.

Original: (2018) with MTL-RETAIN as the base MTL model.
Revised: (2018) with MTL-RETAIN as the base MTL model.

Original: 10) TP-AMTL.
Revised: 10) TP-AMTL.

Original: Our probabilistic temporal asymmetric multi-task learning model that performs both intra-task and inter-task knowledge transfer.
Revised: Our probabilistic temporal asymmetric multi-task learning model that performs both intra-task and inter-task knowledge transfer.

Original: For more details about the baselines, please refer to the appendix .
Revised: For more details about the baselines, please refer to the appendix .

Original: 4. Q UANTITATIVE EVALUATION ON CLINICAL TIME - SERIES PREDICTION TASKS
Revised: 4. Q UANTITATIVE EVALUATION ON CLINICAL TIME - SERIES PREDICTION TASKS

Original: We ﬁrst evaluate the prediction accuracies of the baseline STL and MTL models and ours on the two clinical time-series datasets, by measuring Area Under the ROC curve (AUROC).
Revised: We ﬁrst evaluate the prediction accuracies of the baseline STL and MTL models and ours on the two clinical time-series datasets, by measuring Area Under the ROC curve (AUROC).

Original: Table 1,2 show the[Table] [Table] result for the MIMIC-III Infection dataset and Physionet dataset respectively.
Revised: Table 1,2 show the result for the MIMIC-III Infection dataset and Physionet dataset respectively.

Original: We observe that hardsharing MTL models outperform STL on some tasks, but suffers from performance degeneration on other tasks, which could be the effect of negative transfer.
Revised: We observe that hardsharing MTL models outperform STL on some tasks, but suffers from performance degeneration on other tasks, which could be the effect of negative transfer.

Original: MTL models especially work poorly on
Revised: MTL models especially work poorly on

Original: MIMIC-III Infection, which has clear temporal relationships between tasks.
Revised: MIMIC-III Infection, which has clear temporal relationships between tasks.

Original: Probabilistic models (e.g. UA) generally outperform their deterministic counterparts (e.g. RETAIN).
Revised: Probabilistic models (e.g. UA) generally outperform their deterministic counterparts (e.g. RETAIN).

Original: However, AMTLRETAIN-Kendall, which learns the weight for each task loss based on uncertainty, signiﬁcantly underperforms even the STL-LSTM, which may be due to the fact that losses in our settings are at almost similar scale unlike with the task losses in Kendall et al.
Revised: However, AMTLRETAIN-Kendall, which learns the weight for each task loss based on uncertainty, signiﬁcantly underperforms even the STL-LSTM, which may be due to the fact that losses in our settings are at almost similar scale unlike with the task losses in Kendall et al.

Original: (2018) that have largely different scales.
Revised: (2018) that have largely different scales.

Original: AMTL-LSTM improves on some tasks, but degenerates the performance on the others, which we attribute to the fact that it does not consider inter-timestep transfer.
Revised: AMTL-LSTM improves on some tasks, but degenerates the performance on the others, which we attribute to the fact that it does not consider inter-timestep transfer.

Original: On the other hand, our model,
Revised: On the other hand, our model,

Original: TP-AMTL, obtains signiﬁcant improvements over all STL and MTL baselines on both datasets.
Revised: TP-AMTL, obtains signiﬁcant improvements over all STL and MTL baselines on both datasets.

Original: It also does not show performance degeneration on any of the tasks, suggesting that it has successfully dealt away with negative transfer in multi-task learning with time-series prediction models.
Revised: It also does not show performance degeneration on any of the tasks, suggesting that it has successfully dealt away with negative transfer in multi-task learning with time-series prediction models.

Original: [Figure] For further analysis of the relationships between uncertainty and knowledge transfer, we visualize knowledge transfer from multiple sources (Figure 4a) normalized over the number of tagets, and to multiple targets (Figure 4b) normalized over the number of sources, along with their uncertainties. 
Revised: For further analysis of the relationships between uncertainty and knowledge transfer, we visualize knowledge transfer from multiple sources (Figure 4a) normalized over the number of tagets, and to multiple targets (Figure 4b) normalized over the number of sources, along with their uncertainties. [Figure]

Original: Speciﬁcally, the uncertainty of a task at a certain timestep is represented by the average of the variance of all feature distributions.
Revised: Speciﬁcally, the uncertainty of a task at a certain timestep is represented by the average of the variance of all feature distributions.

Original: The normalized amount of knowledge transfer from task j at time step t to task d is computed as ( α ( t,t ) j,d + α ( t,t +1)
Revised: The normalized amount of knowledge transfer from task j at time step t to task d is computed as ( α ( t,t ) j,d + α ( t,t +1)

Original: j,d
Revised: j,d

Original: + ...
Revised: + ...

Original: + α ( t,T ) j,d ) /
Revised: + α ( t,T ) j,d ) /

Original: ( T − t +1) .
Revised: ( T − t +1) .

Original: Similarly, the normalized amount of knowledge transfer to task d at time step t from task j is( α (1 ,t ) j,d + α (2 ,t ) j,d + ...
Revised: Similarly, the normalized amount of knowledge transfer to task d at time step t from task j is

Original: + α ( t,t ) j,d ) /t
Revised: [Figure]

Original: We observe that source features with low uncertainties transfer knowledge more, while at the target, features with high uncertainties receive more knowledge transfer.
Revised: We observe that source features with low uncertainties transfer knowledge more, while at the target, features with high uncertainties receive more knowledge transfer.

Original: However, note that they are not perfectly correlated, since the amount of knowledge transfer is also affected by the pairwise similarities between the source and the target features as well.
Revised: However, note that they are not perfectly correlated, since the amount of knowledge transfer is also affected by the pairwise similarities between the source and the target features as well.

Original: 4. I NTERPRETATION OF THE L EARNED K NOWLEDGE G RAPHS
Revised: 4. I NTERPRETATION OF THE L EARNED K NOWLEDGE G RAPHS

Original: With the help of a physician, we further analyze how generated transfer weights and uncertainties are related with the patient’s actual medical conditions and how we can interpret temporal relationships between tasks with our model (see Table 3 and Figure 5).
Revised: With the help of a physician, we further analyze how generated transfer weights and uncertainties are related with the patient’s actual medical conditions and how we can interpret temporal relationships between tasks with our model (see Table 6 and Figure 5).

Original: We ﬁrst consider an example record of a patient from the MIMIC-III Infection dataset who was suspected of infection on admission having fever as an initial symptom, which was diagnosed to be caused by bacterial infection later.
Revised: We ﬁrst consider an example record of a patient from the MIMIC-III Infection dataset who was suspected of infection on admission having fever as an initial symptom, which was diagnosed to be caused by bacterial infection later.

Original: Figure 5a shows the amount of knowledge transfer from task fever at 3 : 00 to all later timesteps of task infection .
Revised: Figure 5a shows the amount of knowledge transfer from task fever at 3 : 00 to all later timesteps of task infection .

Original: At this timestep, the patient’s condition changes signiﬁcantly.
Revised: At this timestep, the patient’s condition changes signiﬁcantly.

Original: In Table 3, we see that the patient had a fever and the white blood cell count increased to the state of leukocytosis, and both the systolic and diastolic blood pressure decrease over time.
Revised: In Table 6, we see that the patient had a fever and the white blood cell count increased to the state of leukocytosis, and both the systolic and diastolic blood pressure decrease over time.

Original: Most importantly, the patient is diagnosed to have an infection, as the bacterial culture test result turns out to be positive at 2:57.
Revised: Most importantly, the patient is diagnosed to have an infection, as the bacterial culture test result turns out to be positive at 2:57.

Original: With the drop of uncertainty of the task infection around the time window where the event happens, the amount of knowledge transfer from fever to infection drops as well, as the knowledge from the source task becomes less useful.pressure Rate Temperature,
Revised: With the drop of uncertainty of the task infection around the time window where the event happens, the amount of knowledge transfer from fever to infection drops as well, as the knowledge from the source task becomes less useful.

Original: Glasgow

Original: WBC [Figure] [Figure] N/A
Revised: [Table]

Original: N/A 23’ 31” N/ [Figure] [Figure]
Revised: [Figure]

Original: 12500 N/A 29’ 31”0. 106 74 N/A 6 2: N/A N
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: A ( [Figure] )Klebsiella Pneumoniae 30’ 31”0.
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: For another case study, we considered a record of a patient from PhyisoNet dataset who recovered from surgery and passed away during admission (See Figure 5b) for mortaility prediction at 30 (cid:48) 31 (cid:48)(cid:48) .
Revised: For another case study, we considered a record of a patient from PhyisoNet dataset who recovered from surgery and passed away during admission (See Figure 5b) for mortaility prediction at 30 (cid:48) 31 (cid:48)(cid:48) .

Original: We observe that at this timestep, as the uncertainty of the source task drops, the amount of knowledge transfer increases, since the knowledge from the source task becomes more reliable.
Revised: We observe that at this timestep, as the uncertainty of the source task drops, the amount of knowledge transfer increases, since the knowledge from the source task becomes more reliable.

Original: From Table 3, we observe that at this time step, the patient is applied mechanical mechanical ventilation and the
Revised: From Table 6, we observe that at this time step, the patient is applied mechanical mechanical ventilation and the

Original: GCS score declined from 15 to 7 , and the body temperature increased from 37 .
Revised: GCS score declined from 15 to 7 , and the body temperature increased from 37 .

Original: 7 to 39 .
Revised: 7 to 39 .

Original: This patient is recovering from surgery, and the changes in features that are vital to survival means that general condition of this patient has altered, needing physician’s attention.
Revised: This patient is recovering from surgery, and the changes in features that are vital to survival means that general condition of this patient has altered, needing physician’s attention.

Original: Based on this change in the patient’s condition, the model may have predicted that the patient is recovering from surgery, which explains why the uncertainty on recovery decreased, and knowledge transfer to mortality increases to transfer this reliable knowledge.
Revised: Based on this change in the patient’s condition, the model may have predicted that the patient is recovering from surgery, which explains why the uncertainty on recovery decreased, and knowledge transfer to mortality increases to transfer this reliable knowledge.

Original: For more example cases, please see the appendix .
Revised: For more example cases, please see the appendix .

Original: These interpretations suggest that by analyzing the learned knowledge graph using our model, we could identify timesteps where interesting interactions occur between tasks.
Revised: These interpretations suggest that by analyzing the learned knowledge graph using our model, we could identify timesteps where interesting interactions occur between tasks.

Original: This interpretability may become even more useful in large-scale settings where both the number of time-series data instances and the number of timestep is extremely large, on which manual analysis becomes impractical.
Revised: This interpretability may become even more useful in large-scale settings where both the number of time-series data instances and the number of timestep is extremely large, on which manual analysis becomes impractical.

Original: 4. A BLATION S TUDY
Revised: 4. A BLATION S TUDY

Original: Effectiveness of the inter-task and inter-timestep knowledge transfer.
Revised: Effectiveness of the inter-task and inter-timestep knowledge transfer.

Original: To show the effectiveness of the inter-task and inter-timestep knowledge transfer, we further compare our model on the
Revised: To show the effectiveness of the inter-task and inter-timestep knowledge transfer, we further compare our model on the

Original: PhysioNet dataset against several variations of our model which we describe below:
Revised: PhysioNet dataset against several variations of our model which we describe below:

Original: 1) AMTL-intratask:
Revised: 1) AMTL-intratask:

Original: The probabilistic AMTL model with uncertainty-aware knowledge transfer, but performs knowledge transfer only within the same task at the transfer layer.
Revised: The probabilistic AMTL model with uncertainty-aware knowledge transfer, but performs knowledge transfer only within the same task at the transfer layer.

Original: Note that, however, this model can still share inter-task knowledge in a symmetrical manner since it stilll has shared lower layers (the embedding and the LSTM layers).
Revised: Note that, however, this model can still share inter-task knowledge in a symmetrical manner since it stilll has shared lower layers (the embedding and the LSTM layers).

Original: 2) AMTL-samestep:
Revised: 2) AMTL-samestep:

Original: The probabilistic model with uncertainty-aware knowledge transfer, which performs knowledge transfer only betweenthe features at the same timestep, at the transfer layer. Again, note that this model
Revised: The probabilistic model with uncertainty-aware knowledge transfer, which performs knowledge transfer only between

Original: can still capture the temporal dependencies among the timesteps
Revised: the features at the same timestep, at the transfer layer.

Original:  to cer - tain degree, as it has shared lower layers.
Revised: Again, note that this model can still capture the temporal dependencies among the timesteps to certain degree, as it has shared lower layers.

Original: 3) TD-AMTL:
Revised: 3) TD-AMTL:

Original: The deterministic version of the temporal asymmetric multi-task learning model that does not make use of feature-level uncertainty when performing knowledge transfer.
Revised: The deterministic version of the temporal asymmetric multi-task learning model that does not make use of feature-level uncertainty when performing knowledge transfer.

Original: [Table]
Revised: [Table]

Original: Table 4 shows that our model outperforms the "intratask" and "samestep" variants, which demonstrates the effectiveness of inter-task and inter-step knowledge transfer.
Revised: Table 4 shows that our model outperforms the "intratask" and "samestep" variants, which demonstrates the effectiveness of inter-task and inter-step knowledge transfer.

Original: Moreover, the deterministic counterpart largely underperforms any variants, which may be due to overﬁtting of the knowledge transfer graph, that can be effectively prevented by our Bayesian framework.
Revised: Moreover, the deterministic counterpart largely underperforms any variants, which may be due to overﬁtting of the knowledge transfer graph, that can be effectively prevented by our Bayesian framework.

Original: Future-to-past transfer.
Revised: Future-to-past transfer.

Original: We also compare our model against a variation of our method with no temporal constraint on the inter-step knowledge transfer (TP-AMTL (unconstrained)), such that the knowledge transfer can happen from the later timestep to earlier ones.
Revised: We also compare our model against a variation of our method with no temporal constraint on the inter-step knowledge transfer (TP-AMTL (unconstrained)), such that the knowledge transfer can happen from the later timestep to earlier ones.

Original: Table 4 shows that the constrained model outperforms the unconstrained model, while having lower time complexity for each update ( O ( T ) ) than the unconstrained model
Revised: Table 4 shows that the constrained model outperforms the unconstrained model, while having lower time complexity for each update ( O ( T ) ) than the unconstrained model

Original: O ( T 2 ) .
Revised: O ( T 2 ) .

Revised: Two kinds of uncertainty.

Revised: Furthermore, we examine the effect of two kinds of uncertainty with two variants of the model: TP-AMTL (epistemic) uses only MC-dropout to model epistemic uncertainty and p θ ( z d | x , ω ) is simpliﬁed into N ( z d ; µ d , 0 ) (i.e. its pdf becomes the dirac delta function at µ d and z d is always µ d ); TP-AMTL (aleatoric) uses only p θ ( z d | x , ω ) to model the aleatoric uncertainty, withouth MC-dropout.

Revised: Table 4 shows that, for this dataset, epistemic uncertainty attributes more to the performance gain.

Revised: However, it should be noted that the impacts of two kinds of uncertainty vary from dataset to dataset.

Revised: By modelling both kinds of uncertainty, the model is guaranteed to get the best performance.

Original:  C ONCLUSION
Revised:  C ONCLUSION

Original: We proposed a novel probabilistic asymmetric multi-task learning framework that allows asymmetric knowledge transfer between tasks at different timesteps, based on the uncertainty.
Revised: We proposed a novel probabilistic asymmetric multi-task learning framework that allows asymmetric knowledge transfer between tasks at different timesteps, based on the uncertainty.

Original: While existing asymmetric multi-task learning methods consider asymmetric relationships between tasks as ﬁxed, with time-series data, the task relationship may change at different timesteps.
Revised: While existing asymmetric multi-task learning methods consider asymmetric relationships between tasks as ﬁxed, with time-series data, the task relationship may change at different timesteps.

Original: Moreover, knowledge obtained for a task at a speciﬁc timestep could be useful for other tasks in later timesteps.
Revised: Moreover, knowledge obtained for a task at a speciﬁc timestep could be useful for other tasks in later timesteps.

Original: Thus, to model varying direction of knowledge transfer and across-timestep knowledge transfer, we proposed a novel probabilistic multi-task learning framework that performs knowledge transfer based on the uncertainty of the latent representations for each task and timestep.
Revised: Thus, to model varying direction of knowledge transfer and across-timestep knowledge transfer, we proposed a novel probabilistic multi-task learning framework that performs knowledge transfer based on the uncertainty of the latent representations for each task and timestep.

Original: We validated our model on clinical time-series prediction tasks on two datasets, on which our model signiﬁcantly outperforms the baseline symmetric and asymmetric multi-task learning models.
Revised: We validated our model on clinical time-series prediction tasks on two datasets, on which our model signiﬁcantly outperforms the baseline symmetric and asymmetric multi-task learning models.

Original: We further studied the learned knowledge graphs to show that our model can be used to provide useful interpretations on how the model made certain predictions, which is crucial in building a safe AI system.
Revised: We further studied the learned knowledge graphs to show that our model can be used to provide useful interpretations on how the model made certain predictions, which is crucial in building a safe AI system.

Original: A D ETAILED D ESCRIPTION OF D ATASETS AND E XPERIMENTAL S ETUP A. F EATURES AND T ASKS
Revised: A D ETAILED D ESCRIPTION OF D ATASETS AND E XPERIMENTAL S ETUP A. F EATURES AND T ASKS

Original: 1) MIMIC III-Infection Dataset used in this experiment was custom-constucted from whole
Revised: 1) MIMIC III-Infection Dataset used in this experiment was custom-constucted from whole

Original: MIMIC III dataset to represent temporal dependencies between tasks.
Revised: MIMIC III dataset to represent temporal dependencies between tasks.

Original: We use the ﬁrst 48 hours after admission for each patients to only consider the patient condition on admission, as infection occurring after 48 hour is more likely to be acquired at the ICUs.
Revised: We use the ﬁrst 48 hours after admission for each patients to only consider the patient condition on admission, as infection occurring after 48 hour is more likely to be acquired at the ICUs.

Original: However, our method can be further applied to time-series prediction tasks with longer time steps.
Revised: However, our method can be further applied to time-series prediction tasks with longer time steps.

Original: Following clinician’s guidelines, we select 15 infection-related variables including Heart rate , Systolic Blood Pressure , Diastolic Blood
Revised: Following clinician’s guidelines, we select 15 infection-related variables including Heart rate , Systolic Blood Pressure , Diastolic Blood

Original: Pressure , Glasgow Coma scale(GCS) , invasive procedures: this includes endoscopic procedure, intubation, dialysis, chest tube placement, Lumbar drainage, and biopsy etc., serum albumin and total protein which represents nutritional status of patients, and intravenous steroids , for the features at each timestep (see Table 7).
Revised: Pressure , Glasgow Coma scale(GCS) , invasive procedures: this includes endoscopic procedure, intubation, dialysis, chest tube placement, Lumbar drainage, and biopsy etc., serum albumin and total protein which represents nutritional status of patients, and intravenous steroids , for the features at each timestep (see Table 7).

Original: PhysioNet We select 29 physiological signs as listed in this section : age, gender, height, weight,
Revised: PhysioNet We select 29 physiological signs as listed in this section : age, gender, height, weight,

Original: Systolic Blood Pressure, Diastolic Blood Pressure, mean arterial pressure, heart rate, respiratory rate, body temperature, glucose, bilirubin, serum electrolytes (sodium, potassium, magnesium, bicarbonate), lactate, pH, Hematocrit, platelets, Partial Pressure of Oxygen(PaO 2 ), Partial Pressure of carbon dioxide(PaCO 2 ), Oxygen Saturation(SaO 2 ), Fraction of inspired Oxygen(FiO 2 ), Glasgow
Revised: Systolic Blood Pressure, Diastolic Blood Pressure, mean arterial pressure, heart rate, respiratory rate, body temperature, glucose, bilirubin, serum electrolytes (sodium, potassium, magnesium, bicarbonate), lactate, pH, Hematocrit, platelets, Partial Pressure of Oxygen(PaO 2 ), Partial Pressure of carbon dioxide(PaCO 2 ), Oxygen Saturation(SaO 2 ), Fraction of inspired Oxygen(FiO 2 ), Glasgow

Original: Coma scale(GCS), blood urea nitrogen(BUN), Creatinine, Urine, mechanical ventilation status 3) MIMIC III - Heart Failure To test the generalizability of our model, we compiled this additional task set out of the MIMIC III dataset (Johnson et al., 2016).
Revised: Coma scale(GCS), blood urea nitrogen(BUN), Creatinine, Urine, mechanical ventilation status 3) MIMIC III - Heart Failure To test the generalizability of our model, we compiled this additional task set out of the MIMIC III dataset (Johnson et al., 2016).

Original: We were able to collect 3 , 577 of distinct data instances where adult(age between 18 to 100) patients have admitted to the intensive care unit (ICU) of a hospital.
Revised: We were able to collect 3 , 577 of distinct data instances where adult(age between 18 to 100) patients have admitted to the intensive care unit (ICU) of a hospital.

Original: This dataset contains 15 features which are associated to the risk of heart failure occurrence, including Heart rate(HR) , Systolic Blood Pressure(SBP) , Diastolic Blood
Revised: This dataset contains 15 features which are associated to the risk of heart failure occurrence, including Heart rate(HR) , Systolic Blood Pressure(SBP) , Diastolic Blood

Original: Pressure(DBP) , Body Temperature(BT) , Fraction of inspired oxygen (FiO 2 ) , Mixed venous oxygen saturation (M v O 2 ) , Oxygen Saturation of arterial blood (S a O 2 ) , Brain natriuretic peptide(BNP) ,
Revised: Pressure(DBP) , Body Temperature(BT) , Fraction of inspired oxygen (FiO 2 ) , Mixed venous oxygen saturation (M v O 2 ) , Oxygen Saturation of arterial blood (S a O 2 ) , Brain natriuretic peptide(BNP) ,

Original: Ejection Fraction (EF) , Glasgow Coma scale(GCS) - Verbal, Motor, Eye .
Revised: Ejection Fraction (EF) , Glasgow Coma scale(GCS) - Verbal, Motor, Eye .

Original: Tasks we consider for this dataset are the ones that might lead to the development of heart failure.
Revised: Tasks we consider for this dataset are the ones that might lead to the development of heart failure.

Original: Total 4 tasks selected, and the ﬁrst task, Ischemic (Task 1) is the patient condition where a patient is diagnosed with ischemic heart disease.
Revised: Total 4 tasks selected, and the ﬁrst task, Ischemic (Task 1) is the patient condition where a patient is diagnosed with ischemic heart disease.

Original: The second task Valvular (Task 2) is related to the diagnosis of valvular heart disease, and the third task Heart Failure contains the condition where a patient is diagnosed with various types of heart failure.
Revised: The second task Valvular (Task 2) is related to the diagnosis of valvular heart disease, and the third task Heart Failure contains the condition where a patient is diagnosed with various types of heart failure.

Original: Lastly, Mortality (Task 4) can be a possible outcome of heart failure.
Revised: Lastly, Mortality (Task 4) can be a possible outcome of heart failure.

Original: We use a random split of approximately 1850/925/925 for training/validation/test.
Revised: We use a random split of approximately 1850/925/925 for training/validation/test.

Original: A. B ASELINES
Revised: A. B ASELINES

Original: Here we describe the baselines with more details.
Revised: Here we describe the baselines with more details.

Original: 1) STL-LSTM.
Revised: 1) STL-LSTM.

Original: The single-task learning method which uses RNNs to capture the temporal dependencies
Revised: The single-task learning method which uses RNNs to capture the temporal dependencies.

Original: [Equation]
Revised: [Equation]

Original: 4) MTL-LSTM.
Revised: 4) MTL-LSTM.

Original: The naive hard-sharing multi-task learning method where all tasks share the same network except for the separate output layers for prediction, whose base network is Long Short-Term [Equation] Network ( LSTM
Revised: The naive hard-sharing multi-task learning method where all tasks share the same network except for the separate output layers for prediction, whose base network is Long Short-Term Memory Network (LSTM).

Original: [Equation]
Revised: [Equation]

Original: MTL- [Equation]
Revised: 5) MTL-Transformer.

Original: The same as MTL-LSTM, but with Transformer (Vaswani et al., 2017) as the base network.
Revised: The same as MTL-LSTM, but with Transformer (Vaswani et al., 2017) as the base network.

Original: [Equation]
Revised: [Equation]

Original:  where POS _ ENC is the positional encoding used in Transformer, TRANS _ BLOCK is also the architechture used in the paper, which consists of 2 sublayers: MULTI _ HEAD (with 4 heads) and FFW .
Revised: [Equation] where POS _ ENC is the positional encoding used in Transformer, TRANS _ BLOCK is also the architechture used in the paper, which consists of 2 sublayers: MULTI _ HEAD (with 4 heads) and FFW .

Original: We also used residual connection and layer norm after each sublayer as the original paper.
Revised: We also used residual connection and layer norm after each sublayer as the original paper.

Original: 6) MTL-RETAIN.
Revised: 6) MTL-RETAIN.

Original: The same

Original:  as MTL-LSTM , but with RETAIN (Choi et al., 
Revised: The same as MTL-LSTM, but with RETAIN (Choi et al., 2016) as the base network.

Original: as

Original: the

Original: base

Original: network

Original: Speciﬁcally

Original: , after getting the shared context vector c i , separated output layers will be applied to form the prediction for each task
Revised: Speciﬁcally, after getting the shared context vector c i , separated output layers will be applied to form the prediction for each task.

Original: [Equation]
Revised: [Equation]

Original: 7) MTL- UA.
Revised: 7) MTL-UA.

Original: The same as MTL LSTM, but with UA (Heo et al.
Revised: The same as MTL-LSTM, but with UA (Heo et al., 2018) as the base network.

Original: [Equation]
Revised: Specif-

Original: as the base
Revised: ically, after

Original: network. Specifically, after getting the shared context vector c i , separated output layers will be applied to form the prediction for each task.
Revised: getting the shared context vector c i , separated output layers will be applied to form the prediction for each task.

Original: This can be seen as the probabilistic version of MTL-RETAIN.
Revised: This can be seen as the probabilistic version of MTL-RETAIN.

Original: [Equation]
Revised: [Equation]

Revised: i : context

Original: [Equation]
Revised: [Equation]

Revised: from

Revised: UA

Revised: [Equation]

Revised: [Equation]

Revised: [Equation]

Original: 8) AMTL-LSTM.
Revised: AMTL-LSTM.

Revised: This is asymmetric multi-task learning

Original: This is asymmetric multi-task learning (Lee et al., 2016) adopted for our timeseries prediction framework, where we learn the knowledge transfer graph between task-speciﬁc parameters, which is learned to perform asymmetric knowledge transfer based on the task loss.
Revised: Lee et al., 2016) adopted for our timeseries prediction framework, where we learn the knowledge transfer graph between task-speciﬁc parameters, which is learned to perform asymmetric knowledge transfer based on the task loss.

Original: Since the parameters for each task is shared across all timesteps, this will result in static asymmetric transfer between tasks.
Revised: Since the parameters for each task is shared across all timesteps, this will result in static asymmetric transfer between tasks.

Original: ) MTL-RETAIN- Kendall This is the work proposed by (Kendall et al., 2018).
Revised: 9) MTL-RETAIN-Kendall This is the work proposed by (Kendall et al., 2018).

Original: The base model we use is MTL-RETAIN.
Revised: The base model we use is MTL-RETAIN.

Original: However, when combining the losses, we followed the work by (Kendall et al., 2018):
Revised: However, when combining the losses, we followed the work by (Kendall et al., 2018):

Original: [Equation]
Revised: [Equation]

Original: 10) TP-AMTL.
Revised: 10) TP-AMTL.

Original: Our probabilistic temporal asymmetric multi-task learning model that performs both intra-task and inter-task knowledge transfer
Revised: Our probabilistic temporal asymmetric multi-task learning model that performs both intra-task and inter-task knowledge transfer.

Original: A. D ETAILS OF MODELS IN A BLATION STUDY
Revised: A. D ETAILS OF MODELS IN A BLATION STUDY

Revised: AMTL-intratask.

Revised: C ( t ) d

Original: [Equation]
Revised: [Equation]

Revised: f ( t

Original: [Equation]
Revised: [Equation]

Revised: d

Original: [Equation]
Revised: [Equation]

Original: TD
Revised: t

Original: TAMTL
Revised: [Equation] [Equation] ( i

Original: The deterministic version of our model that does not make use of feature-level uncertainty when performing
Revised: [Equation] d [Equation] [Equation]

Original: knowledge transfer
Revised: T

Original: [Equation]
Revised: [Equation]

Revised: AMTL-samestep.

Original: f ( i ) j (cid:17) ∀ t 
Revised: C ( t ) d = f ( t ) d

Original: [Equation]
Revised: [Equation]

Original: { 1 , 2 , ..., T } β ( t ) d = tanh (cid:16) C ( t ) d W βd + b βd (cid:17) ∀ t ∈ { 1 , 2 , ..., T } p ( (cid:98) y
Revised: D

Original: d | x ) =
Revised: [Equation] j =

Original: Sigmoid (cid:18)
Revised: [Equation]

Original: T ( β (1) d (cid:12) v (1) +
Revised: j

Original: [Equation]
Revised: [Equation]

Original: (2) d (cid:12) v (2) + ... +
Revised: d (cid:16) f ( t [Equation] j

Original: [Equation]
Revised: [Equation]

Revised: [Table]

Original: [Equation]
Revised: [Equation]

Original:  d (cid:12) v ( T ) )
Revised: ) d (cid:12) v ( T ) )

Original: W od + b od (cid:19) where α ( i,t ) j,d = F θ ( f ( i ) f , f ( t ) d )
Revised: W od + b od (cid:19) where α ( i,t ) j,d = F θ ( f ( i ) f , f ( t ) d )

Original: TP-TAMTL - no constraints.
Revised: TP-TAMTL - no constraints.

Original: C ( t ) d = f ( t ) d +
Revised: C ( t ) d = f ( t ) d +

Original: D (cid:88)
Revised: D (cid:88)

Original: j =
Revised: j =

Original: T (cid:88) i
Revised: T (cid:88) i

Original: =α ( i,t ) j,d [Equation]
Revised: =

Original:  G j,d (cid:16) f( i ) [Equation]
Revised: α ( i,t ) j,d ∗ G j,d (cid:16) f

Original:  (cid:17) ∀ t [Equation] { 1 , 2 , ..., T }
Revised: ( i ) j (cid:17) ∀ t ∈ { 1 , 2 , ..., T }

Original: A. C ONFIGURATION AND PARAMETERS
Revised: A. C ONFIGURATION AND PARAMETERS

Original: We trained all the models using Adam optimizer with dropout regularization.
Revised: We trained all the models using Adam optimizer with dropout regularization.

Original: We set the maximum iteration for Adam optimizer as 100,000, and for other hyperparameters, we searched for the optimal values by cross-validation, within predeﬁned ranges as follows: Hidden units: {8, 16, 32, 64}, number of layers: {2,3,6}, mini batch size: {32, 64, 128, 256}, learning rate: {0.01, 0.001, 0.0001}, L regularization: {0.02, 0.002, 0.0002,0.00}, and dropout rate {0.1, 0.15, 0.2, 0.25, 0.3, 0.4, 0.5}.
Revised: We set the maximum iteration for Adam optimizer as 100,000, and for other hyperparameters, we searched for the optimal values by cross-validation, within predeﬁned ranges as follows: Hidden units: {8, 16, 32, 64}, number of layers: {2,3,6}, mini batch size: {32, 64, 128, 256}, learning rate: {0.01, 0.001, 0.0001}, L regularization: {0.02, 0.002, 0.0002,0.00}, and dropout rate {0.1, 0.15, 0.2, 0.25, 0.3, 0.4, 0.5}.

Original: B Q UANTITATIVE EVALUATION ON CLINICAL TIME - SERIES PREDICTION TASK : MIMIC III-H EART F AILURE
Revised: B Q UANTITATIVE EVALUATION ON CLINICAL TIME - SERIES PREDICTION TASK : MIMIC III-H EART F AILURE

Original: Here, we provide the experimental results of our model and other baselines on the additional dataset:
Revised: Here, we provide the experimental results of our model and other baselines on the additional dataset:

Original: MIMIC III-Heart Failre.
Revised: MIMIC III-Heart Failre.

Original: Table 5 shows that our model still outperforms other baselines, which indicates that our method can generalize well on a variaty of time-series datasets.[Table]
Revised: Table 5 shows that our model still outperforms other baselines, which indicates that our method can generalize well on a variaty of time-series datasets.

Original: C C LINICAL I NTERPRETATION OF GENERATED UNCERTAINTY AND KNOWLEDGE TRANSFER BETWEEN TASKS
Revised: C C LINICAL I NTERPRETATION OF GENERATED UNCERTAINTY AND KNOWLEDGE TRANSFER BETWEEN TASKS

Original: In this section, we further describe the interpretation of several example patients using generated uncertainty and knowledge transfer across timesteps.
Revised: In this section, we further describe the interpretation of several example patients using generated uncertainty and knowledge transfer across timesteps.

Original: The example patient in Figure 5 had a fever on admission and was conﬁrmed to be positive with bacterial infection on culture study in this speciﬁc timestep 2:57.
Revised: The example patient in Figure 5 had a fever on admission and was conﬁrmed to be positive with bacterial infection on culture study in this speciﬁc timestep 2:57.

Original: The patient continued to have  fever, and white blood cell count increased to the state of leukocytosis.
Revised: The patient continued to have [Table] fever, and white blood cell count increased to the state of leukocytosis.

Original: Also, both systolic and diastolic blood pressure declined over time.
Revised: Also, both systolic and diastolic blood pressure declined over time.

Original: We can see that uncertainty of target task drops when the model can conﬁdently infer to the patient status from feature values, and aids from source target can decrease in that case.
Revised: We can see that uncertainty of target task drops when the model can conﬁdently infer to the patient status from feature values, and aids from source target can decrease in that case.

Original: Figure 5a represent knowledge transfer from one timestep of a source task to multiple time steps in the target task.
Revised: Figure 5a represent knowledge transfer from one timestep of a source task to multiple time steps in the target task.

Original: We examine how multiple time steps of the source task transfers knowledge to certain time steps in the target task from the same example patient of MIMICIII Infection dataset used in Figure 5a.
Revised: We examine how multiple time steps of the source task transfers knowledge to certain time steps in the target task from the same example patient of MIMICIII Infection dataset used in Figure 5a.

Original: On the vicinity of the same timepoint where this patient was conﬁrmed to have bacterial infection, we can see that the uncertainty of source target starts to increase, and knowledge reversely ﬂows to source task fever .
Revised: On the vicinity of the same timepoint where this patient was conﬁrmed to have bacterial infection, we can see that the uncertainty of source target starts to increase, and knowledge reversely ﬂows to source task fever .

Original: This happens in accordance with the drop of knowledge transfer from fever to infection in Figure 5a.
Revised: This happens in accordance with the drop of knowledge transfer from fever to infection in Figure 5a.

Original: We can infer that the knowledge from task infection becomes more useful to predict source fever in this timestep as patient condition related to this task is happening around this time step.
Revised: We can infer that the knowledge from task infection becomes more useful to predict source fever in this timestep as patient condition related to this task is happening around this time step.

Original: [Figure]
Revised: [Figure]

Original: Additionally, we select other example patient from MIMIC-III Infection dataset (Figure 7a 7b).
Revised: Additionally, we select other example patient from MIMIC-III Infection dataset (Figure 7a 7b).

Original: This patient had fever and leukocytosis (elevation of white blood cell as a result of bacterial intrusion, implies infectious status of a patient) at the earlier timepoint of admission but was not conﬁrmed to have infection afterwards.
Revised: This patient had fever and leukocytosis (elevation of white blood cell as a result of bacterial intrusion, implies infectious status of a patient) at the earlier timepoint of admission but was not conﬁrmed to have infection afterwards.

Original: The ﬁrst timepoint highlighted with the blue box is when this patient had fever and started to recover from fever.
Revised: The ﬁrst timepoint highlighted with the blue box is when this patient had fever and started to recover from fever.

Original: At 19:00 when this patient had fever, the uncertainty of source task fever decreases and this task transfers more to target task mortality .
Revised: At 19:00 when this patient had fever, the uncertainty of source task fever decreases and this task transfers more to target task mortality .

Original: As the patient recovers from fever, the uncertainty of task feverincreases and knowledge transfer from fever to mortality drops accordingly. The second blue box on the right denotes the time step when the complete blood count lab result showed this patient has leukocytosis, which implies the high propensity of infection. Knowledge transfer starts to drop as the knowledge from source task fever is less important as the uncertainty of target task mortality drops. [Table]
Revised: As the patient recovers from fever, the uncertainty of task fever

Original: [Figure] Interpretation on another example patient from MIMIC III-heart failure dataset is plotted on Figure 8.
Revised: Interpretation on another example patient from MIMIC III-heart failure dataset is plotted on Figure 8.

Original: This example patient is ﬁnally diagnosed with congestive heart failure on Chest X-ray.
Revised: This example patient is ﬁnally diagnosed with congestive heart failure on Chest X-ray.

Original: During admission period, troponin level of this patient was elevated, which is not diagnostic (Reichlin et al., 2009), but implying that this patient had cardiac event.
Revised: During admission period, troponin level of this patient was elevated, which is not diagnostic (Reichlin et al., 2009), but implying that this patient had cardiac event.

Original: Given cardiac events, hypotension occured in 1:21 (Table 6, Figure 8) can be explained to be related to ﬁnal diagnosis heart failure. 
Revised: Given cardiac events, hypotension occured in 1:21 (Table ?? , Figure 8) can be explained to be related to ﬁnal diagnosis heart failure. As

Original: As the patient’s SBP decreases to 90 and DBP to 30 around 1:21 (Table 6), the uncertainty of target task Heart Failure decreases in Figure 8a.
Revised: [Table] [Figure] the patient’s SBP decreases to 90 and DBP to 30 around 1:21 (Table ?? ) , the uncertainty of target task Heart Failure decreases in Figure 8a.

Original: Knowledge transfer starts to drop as the knowledge from target task becomes more important than that of source task.
Revised: Knowledge transfer starts to drop as the knowledge from target task becomes more important than that of source task.

Original: We can also see that the trend of knowledge transfer follows the trend of target uncertainty.
Revised: We can also see that the trend of knowledge transfer follows the trend of target uncertainty.

Original: Furthermore, troponin increased in 16:21 implies ongoing myocardial stress, which can be expressed as constantly lowered uncertainty of source task ischemic heart disease among the window period we plotted on Figure 8b.
Revised: Furthermore, troponin increased in 16:21 implies ongoing myocardial stress, which can be expressed as constantly lowered uncertainty of source task ischemic heart disease among the window period we plotted on Figure 8b.

Original: As uncertainty of source task decreases, knowledge transfer to target task heart failure kept increasing till 23:21.
Revised: As uncertainty of source task decreases, knowledge transfer to target task heart failure kept increasing till 23:21.

Original: However, as patient condition related to heart function, especially blood pressure starts to decrease and knowledge from target task gets important, knowledge transfer starts to decrease after 23:21.
Revised: However, as patient condition related to heart function, especially blood pressure starts to decrease and knowledge from target task gets important, knowledge transfer starts to decrease after 23:

Original: [Table]
Revised: [Table]

Original: [Table] [Table]
Revised: [Table] [Table]