Original: A DDITIVE P OISSON P ROCESS : L EARNING I NTENSITY OF H IGHER -O RDER I NTERACTION IN P OISSON P ROCESSES
Revised: A DDITIVE P OISSON P ROCESS : L EARNING I NTENSITY OF H IGHER -O RDER I NTERACTION IN P OISSON P ROCESSES

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: We present the Additive Poisson Process (APP), a novel framework that can model the higher-order interaction effects of the intensity functions in Poisson processes using projections into lower-dimensional space.
Revised: We present the Additive Poisson Process (APP), a novel framework that can model the higher-order interaction effects of the intensity functions in Poisson processes using projections into lower-dimensional space.

Original: Our model combines the techniques from information geometry to model higher-order interactions on a statistical manifold and in generalized additive models to use lower-dimensional projections to overcome the effects from the curse of dimensionality.
Revised: Our model combines the techniques from information geometry to model higher-order interactions on a statistical manifold and in generalized additive models to use lower-dimensional projections to overcome the effects from the curse of dimensionality.

Original: Our approach solves a convex optimization problem by minimizing the KL divergence from a sample distribution in lower-dimensional projections to the distribution modeled by an intensity function in the Poisson process.
Revised: Our approach solves a convex optimization problem by minimizing the KL divergence from a sample distribution in lower-dimensional projections to the distribution modeled by an intensity function in the Poisson process.

Original: Our empirical results show that our model effectively uses samples observed in lower dimensional space to estimate a higher-order intensity function with sparse observations.
Revised: Our empirical results show that our model effectively uses samples observed in lower dimensional space to estimate a higher-order intensity function with sparse observations.

Original:  I NTRODUCTION
Revised:  I NTRODUCTION

Original: The Poisson process is a counting process used in a wide range of disciplines such as spatialtemporal sequential data in transportation (Zhou et al., 2021), finance (Ilalan, 2016) and ecology (Thompson, 1955) to model the arrival rate by learning an intensity function.
Revised: The Poisson process is a counting process used in a wide range of disciplines such as spatialtemporal sequential data in transportation (Zhou et al., 2021), finance (Ilalan, 2016) and ecology (Thompson, 1955) to model the arrival rate by learning an intensity function.

Original: For a given time interval, the integral of the intensity function represents the average number of events occurring in that interval.
Revised: For a given time interval, the integral of the intensity function represents the average number of events occurring in that interval.

Original: The intensity function can be generalized to multiple dimensions.
Revised: The intensity function can be generalized to multiple dimensions.

Original: However, for most practical applications, learning the multi-dimensional intensity function becomes a challenge because of the sparse observations.
Revised: However, for most practical applications, learning the multi-dimensional intensity function is a challenge due to the sparsity of observations.

Original: Despite the recent advances of Poisson processes, current Poisson process models are unable to learn the intensity function of a multi-dimensional Poisson process.
Revised: Despite the recent advances of Poisson processes, current Poisson process models are unable to learn the intensity function of a multi-dimensional Poisson process.

Original: Our research question is, “Are there any good ways of approximating the high dimensional intensity function?”
Revised: Our research question is, “Are there any good ways of approximating the high dimensional intensity function?”

Original: Our proposal, the Additive Poisson Process (APP), provides a novel solution to this problem.
Revised: Our proposal, the Additive Poisson Process (APP), provides a novel solution to this problem.

Original: Throughout this paper, we use a running example in a spatial-temporal setting.
Revised: Throughout this paper, we use a running example in a spatial-temporal setting.

Original: Say we want to learn the intensity function for a taxi to pick up customers at a given time and location.
Revised: Say we want to learn the intensity function for a taxi to pick up customers at a given time and location.

Original: For this setting, each event is multi-dimensional; that is, ( x, y, W ) , where a pair of x and y represents two spatial coordinates and W represents the day of the week.
Revised: For this setting, each event is multi-dimensional; that is, ( x, y, W ) , where a pair of x and y represents two spatial coordinates and W represents the day of the week.

Original: In addition, observation time t is associated with this event.
Revised: In addition, observation time t is associated with this event.

Original: For any given location or time, we can expect at most a few pick-up events, which makes it difficult for any model to learn the low-valued intensity function.
Revised: For any given location or time, we can expect at most a few pick-up events, which makes it difficult for any model to learn the low-valued intensity function.

Original: Figure 1b visualizes this problem.
Revised: Figure 1b visualizes this problem.

Original: In this problem setup, if we would like to learn the intensity function at a given location ( x, y ) and day of the week W , the na¨ıve approach would be to learn the intensity at ( x, y, W ) directly from observations.
Revised: In this problem setup, if we would like to learn the intensity function at a given location ( x, y ) and day of the week W , the na¨ıve approach would be to learn the intensity at ( x, y, W ) directly from observations.

Original: This is extremely difficult because there could be only few events for a given location and day.
Revised: This is extremely difficult because there could be only few events for a given location and day.

Original: However, there is useful information in lower-dimensional space; for example, the marginalized observations at the location ( x, y ) across all days of the week, or on the day W at all locations.
Revised: However, there is useful information in lower-dimensional space; for example, the marginalized observations at the location ( x, y ) across all days of the week, or on the day W at all locations.

Original: This information can be included into the model to improve the estimation of the joint intensity function.
Revised: This information can be included into the model to improve the estimation of the joint intensity function.

Original: Using the information in lower-dimensional space provides a structured approach to include prior information based on the location or day of the week to improve the estimation of the joint intensity function.
Revised: Using the information in lower-dimensional space provides a structured approach to include prior information based on the location or day of the week to improve the estimation of the joint intensity function.

Original: For example, a given location could be a shopping center or a hotel, where it is common for taxis to pick up passengers, and therefore we expect more passengers at this location.
Revised: For example, a given location could be a shopping center or a hotel, where it is common for taxis to pick up passengers, and therefore we expect more passengers at this location.

Original: There could also be additional patterns that could be uncovered based on the day of the week.
Revised: There could also be additional patterns that could be uncovered based on the day of the week.

Original: We can then use the observations of events to update our knowledge of the intensity function.
Revised: We can then use the observations of events to update our knowledge of the intensity function.

Original: Previous approaches, such as kernel density estimation (KDE) (Rosenblatt, 1956), learn the joint intensity function using information in lower dimensions.
Revised: Previous approaches, such as kernel density estimation (KDE) (Rosenblatt, 1956), learn the joint intensity function using information in lower dimensions.

Original: However, KDE suffers from the curse of dimensionality, which means that it requires a large size of samples to build an accurate model.
Revised: However, KDE suffers from the curse of dimensionality, which means that it requires a large size of samples to build an accurate model.

Original: In addition, the complexity of the model expands exponentially with respect to the number of dimensions, which makes it infeasible to compute.
Revised: In addition, the complexity of the model expands exponentially with respect to the number of dimensions, which makes it infeasible to compute.

Original: Bayesian approaches, such as using a mixture of beta distributions with a Dirichlet prior (Kottas, 2006; Kottas & Sans´o, 2007) and Reproducing Kernel
Revised: Bayesian approaches, such as using a mixture of beta distributions with a Dirichlet prior (Kottas, 2006; Kottas & Sans´o, 2007) and Reproducing Kernel

Original: Hilbert Space (RKHS) (Flaxman et al., 2017), have been proposed to quantify the uncertainty for the intensity function.
Revised: Hilbert Space (RKHS) (Flaxman et al., 2017), have been proposed to quantify the uncertainty for the intensity function.

Original: However, these approaches are often non-convex, making it difficult to obtain the globally optimal solution.
Revised: However, these approaches are often non-convex, making it difficult to obtain the globally optimal solution.

Original: Besides, if observations are sparse, it is hard for these approaches to learn a reasonable intensity function.
Revised: Besides, if observations are sparse, it is hard for these approaches to learn a reasonable intensity function.

Original: Additional related work about Bayesian inference for Poisson processes and Poisson factorization can be found in Appendix A.
Revised: Additional related work about Bayesian inference for Poisson processes and Poisson factorization can be found in Appendix A.

Original: In this paper, we propose a novel framework to learn the higher-order interaction effects of intensity functions in Poisson processes.
Revised: In this paper, we propose a novel framework to learn the higher-order interaction effects of intensity functions in Poisson processes.

Original: Our model combines the techniques introduced by Luo & Sugiyama (2019) to model higher-order interactions between Poisson processes and by Friedman & Stuetzle (1981) in generalized additive model s to learn the joint intensity function using samples in a lower dimensional space.
Revised: Our model combines the techniques introduced by Luo & Sugiyama (2019) to model higher-order interactions between Poisson processes and by Friedman & Stuetzle (1981) in generalized additive model s to learn the joint intensity function using samples in a lower dimensional space.

Original: Our proposed approach is to decompose a multi-dimensional Poisson process into lower-dimensional representations.
Revised: Our proposed approach is to decompose a multi-dimensional Poisson process into lower-dimensional representations.

Original: For example, we have points ( x i )
Revised: For example, we have points ( x i )

Original: Ni
Revised: Ni

Original: =1 in the x -dimension and ( y i )
Revised: =1 in the x -dimension and ( y i )

Original: Ni =1 in the y -dimension.
Revised: Ni =1 in the y -dimension.

Original: Such data in the lower-dimensional space can be used to improve the estimation of the joint intensity function.
Revised: Such data in the lower-dimensional space can be used to improve the estimation of the joint intensity function.

Original: This is different from the traditional approaches where only the joint occurrence of events is used to learn the joint intensity.
Revised: This is different from the traditional approaches where only the joint occurrence of events is used to learn the joint intensity.

Original: We first show the connection between generalized additive models and Poisson processes, and then provide the connection between generalized additive models and the log-linear model (Agresti, 2012), which has a well-established theoretical background in information geometry (Amari, 2016).
Revised: We first show the connection between generalized additive models and Poisson processes, and then provide the connection between generalized additive models and the log-linear model (Agresti, 2012), which has a well-established theoretical background in information geometry (Amari, 2016).

Original: We draw parallels between the formulation of the generalized additive models and the binary loglinear model on a partially ordered set (poset) (Sugiyama et al., 2017).
Revised: We draw parallels between the formulation of the generalized additive models and the binary loglinear model on a partially ordered set (poset) (Sugiyama et al., 2017).

Original: The learning process in our model is formulated as a convex optimization problem to arrive at a unique optimal solution using natural gradient, which minimizes the Kullback-Leibler (KL) divergence from the sample distribution in a lower-dimensional space to the distribution modeled by the learned intensity function.
Revised: The learning process in our model is formulated as a convex optimization problem to arrive at a unique optimal solution using natural gradient, which minimizes the Kullback-Leibler (KL) divergence from the sample distribution in a lower-dimensional space to the distribution modeled by the learned intensity function.

Original: This connection provides remarkable properties to our model: the ability to learn higher-order intensity functions using lower-dimensional projections, thanks to the Kolmogorov-Arnold representation theorem .
Revised: This connection provides remarkable properties to our model: the ability to learn higher-order intensity functions using lower-dimensional projections, thanks to the Kolmogorov-Arnold representation theorem .

Original: This property makes it advantageous to use our proposed approach for cases where there are no observations, missing samples, or low event rates.
Revised: This property makes it advantageous to use our proposed approach for cases where there are no observations, missing samples, or low event rates.

Original: Our model is flexible because it can capture the interaction effects between events in a Poisson process as a partial order structure in the log-linear model and the parameters of the model are fully customizable to meet the requirements of the application.
Revised: Our model is flexible because it can capture the interaction effects between events in a Poisson process as a partial order structure in the log-linear model and the parameters of the model are fully customizable to meet the requirements of the application.

Original: Our empirical results show that our model effectively uses samples projected onto a lower dimensional space to estimate the higher-order intensity function.
Revised: Our empirical results show that our model effectively uses samples projected onto a lower dimensional space to estimate the higher-order intensity function.

Original: More importantly, our model is also robust to various sample sizes.
Revised: More importantly, our model is also robust to various sample sizes.

Original:  F ORMULATION
Revised:  F ORMULATION

Original: We start this section by introducing the technical background in the Poisson process and its extension to a multi-dimensional Poisson process.
Revised: We start this section by introducing the technical background in the Poisson process and its extension to a multi-dimensional Poisson process.

Original: We then introduce the Generalized Additive Model (GAM) and its connection to the Poisson process.
Revised: We then introduce the Generalized Additive Model (GAM) and its connection to the Poisson process.

Original: This is followed by presenting our novel framework, called Additive Poisson Process (APP), which is our main technical contribution and has a tight link to the Poisson process modeled by GAMs.
Revised: This is followed by presenting our novel framework, called Additive Poisson Process (APP), which is our main technical contribution and has a tight link to the Poisson process modeled by GAMs.

Original: We show that the learning of APP can be achieved via convex optimization using natural gradient.
Revised: We show that the learning of APP can be achieved via convex optimization using natural gradient.

Original: The Poisson process is characterized by an intensity function λ : R → R .
Revised: The Poisson process is characterized by an intensity function λ : R → R .

Original: An inhomogeneous
Revised: An inhomogeneous

Original: Poisson process is an extension of a homogeneous Poisson process, where the arrival rate changes with time.
Revised: Poisson process is an extension of a homogeneous Poisson process, where the arrival rate changes with time.

Original: The process with time-changing intensity λ ( t ) is defined as a counting process N ( t ) , which has an independent increment property.
Revised: The process with time-changing intensity λ ( t ) is defined as a counting process N ( t ) , which has an independent increment property.

Original: For any t ≥ 0 and infinitesimal interval δ ≥ 0 , probability of events count is p ( N ( t + δ ) − N ( t ) = 0)
Revised: For any t ≥ 0 and infinitesimal interval δ ≥ 0 , probability of events count is p ( N ( t + δ ) − N ( t ) = 0)

Original: = 1 − δλ ( t ) + o ( δ ) , p ( N ( t + δ ) − N ( t ) = 1) =
Revised: = 1 − δλ ( t )+ o ( δ ) , p ( N ( t + δ ) − N ( t ) = 1) =

Original: δλ ( t ) + o ( δ ) , and p ( N ( t + δ ) − N ( t ) ≥ 2) =
Revised: δλ ( t ) + o ( δ ) , and p ( N ( t + δ ) − N ( t ) ≥ 2) =

Original: o ( δ ) , where o ( · ) denotes little-o notation (Daley & Vere-Jones, 2007).
Revised: o ( δ ) , where o ( · ) denotes little-o notation (Daley & Vere-Jones, 2007).

Original: This formulation can be generalized by taking the (inhomogeneous) multidimensional attributes into account. The intensity function λ J : R → Ris now associated with 
Revised: To take (inhomogeneous) multi-dimensional attributes into account, we consider multiple intensity functions, each of which is given as λ J : R → R associated with a subset J of the domain of possible states [ D ] = { 1 , . . .

Original: J ⊆ [ D ] = { 1 ,  . . .
Revised: , D } . Each J ⊆

Original: , D } , which determines the condition of the occurrence of the event.
Revised: [ D ] determines the condition of the occurrence of the event.

Revised: To flexibly consider any combination of possible states, [ D ] is composed of possible states across all dimensions.

Original: For example in the taxi pick up example in Introduction, J ⊆
Revised: For example, in the taxi pick up example in Introduction, domains of x , y , W are discretized to disjoint sets as { 1 , . . .

Original: [ D ] corresponds to ( x, y, W ) .
Revised: , D x } , { D x + 1 , . . . D x + D y } , { D x + D y + 1 , . .

Original: More precisely, domains of x ,  y , W are discretized to disjoint sets and gathered as a single set, which corresponds to [ D ]  . 
Revised: , D x + D y + D W } , respectively, without loss of generality and gathered as a single set [ D ] with D = D x + D y + D W . For each J ⊆

Original: The likelihood for this model is given by
Revised: [ D ] , the likelihood of this model is given by

Original: [Equation]
Revised: [Equation]

Original: We define the functional prior on λ J ( t ) as
Revised: We define the functional prior on λ J ( t ) as

Original: [Equation]
Revised: [Equation]

Original: The function g ( · ) is a positive function to guarantee the non-negativity of the intensity which we choose to be the exponential function, and our objective is to learn the function f J ( · ) .
Revised: The function g ( · ) is a positive function to guarantee the non-negativity of the intensity which we choose to be the exponential function, and our objective is to learn the function f J ( · ) .

Original: The loglikelihood of the multi-dimensional Poisson process with the functional prior is described as
Revised: The loglikelihood of the multi-dimensional Poisson process with the functional prior is described as

Original: [Equation]
Revised: [Equation]

Original: In the following sections, we introduce the generalized additive models and propose to model it by the log-linear model to learn f J ( t ) and the normalizing term (cid:82) exp ( f J ( t )) dt .
Revised: In the following sections, we introduce the generalized additive models and propose to model it by the log-linear model to learn f J ( t ) and the normalizing term (cid:82) exp ( f J ( t )) dt .

Original: 2. G ENERALIZED A DDITIVE M ODEL
Revised: 2. G ENERALIZED A DDITIVE M ODEL

Original: We present the connection between Poisson processes and the Generalized Additive Model (GAM) proposed by Friedman & Stuetzle (1981).
Revised: We present the connection between Poisson processes and the Generalized Additive Model (GAM) proposed by Friedman & Stuetzle (1981).

Original: The GAM projects higher-dimensional features into lower-dimensional space to apply smoothing functions to build a restricted class of non-parametric regression models.
Revised: The GAM projects higher-dimensional features into lower-dimensional space to apply smoothing functions to build a restricted class of non-parametric regression models.

Original: GAM is less affected by the curse of dimensionality compared to directly using smoothing in a higher-dimensional space.
Revised: GAM is less affected by the curse of dimensionality compared to directly using smoothing in a higher-dimensional space.

Original: For a given set of processes J ⊆
Revised: For a given set of processes J ⊆

Original: [ D ] = { 1 , . . .
Revised: [ D ] = { 1 , . . .

Original: , D } , the traditional GAM using one-dimensional projections is defined as log λ J ( t ) =
Revised: , D } , the traditional GAM using one-dimensional projections is defined as log λ J ( t ) =

Original: (cid:80) j ∈ J f j ( t ) − β J with some smoothing function f j .
Revised: (cid:80) j ∈ J f j ( t ) − β J with some smoothing function f j .

Original: In this paper, we extend it to include higher-order interactions between features in GAM by introducing terms that represent the multiplicative product between events.
Revised: In this paper, we extend it to include higher-order interactions between features in GAM by introducing terms that represent the multiplicative product between events.

Original: The k -th order GAM is defined as
Revised: The k -th order GAM is defined as

Original: [Equation]
Revised: [Equation]

Original: The function f
Revised: The function f

Original: I : R → R is a smoothing function to fit the data, and the normalization constant β J for the intensity function is obtained as β J = (cid:82) λ J ( t )
Revised: I : R → R is a smoothing function to fit the data, and the normalization constant β J for the intensity function is obtained as β J = (cid:82) λ J ( t )

Original: dt = (cid:82) exp( (cid:80)
Revised: dt = (cid:82) [Equation]

Original: I ⊆ J, | I |≤ k f I ( t ) )
Revised: I ⊆ J, | I |≤ k f I ( t ) )

Original: dt .
Revised: dt .

Original: The definition of the additive model is in the same form as Equation 3.
Revised: The definition of the additive model is in the same form as Equation 3.

Original: In particular, if we compare
Revised: In particular, if we compare

Original: Equation 3 and Equation 4, we can see that the smoothing function f in Equation 3 is realized as the summation over lower-dimensional projections in Equation 4.
Revised: Equation 3 and Equation 4, we can see that the smoothing function f in Equation 3 is realized as the summation over lower-dimensional projections in Equation 4.

Original: Learning of a continuous function using lower-dimensional projections is well known because of the Kolmogorov-Arnold representation theorem , which states that:
Revised: Learning of a continuous function using lower-dimensional projections is well known because of the Kolmogorov-Arnold representation theorem , which states that:

Original: Theorem 2.1 (Kolmogorov–Arnold Representation Theorem (Braun & Griebel, 2009; Kolmogorov, 1957)) .
Revised: Theorem 2.1 (Kolmogorov–Arnold Representation Theorem (Braun & Griebel, 2009; Kolmogorov, 1957)) .

Original: Any multivariate continuous function can be represented as a superposition of one–dimensional functions; that is, f ( t 1 , . . ., t n )
Revised: Any multivariate continuous function can be represented as a superposition of one–dimensional functions; that is, f ( t 1 , . . .

Original: = (cid:80) 2 n + [Equation] q = [Equation]
Revised: , t

Original: f q (cid:16)(cid:80) np

Original: [Equation]
Revised: [Equation]

Original: ) (cid:17) .

Original: Braun (2009) showed that the GAM is an approximation to the general form presented in
Revised: Braun (2009) showed that the GAM is an approximation to the general form presented in

Original: Kolmogorov-Arnold representation theorem by replacing the range q ∈ { 1 , . .
Revised: Kolmogorov-Arnold representation theorem by replacing the range q ∈ { 1 , . .

Original: , 2 n + 1 } with
Revised: , 2 n + 1 } with

Original: I ⊆ J and the inner function g q,p by the identity if q = p and zero otherwise, yielding f J ( t ) =
Revised: I ⊆ J and the inner function g q,p by the identity if q = p and zero otherwise, yielding f J ( t ) =

Original: (cid:80) I ⊆
Revised: (cid:80) I ⊆

Original: J f I ( t ) .
Revised: J f I ( t ) .

Original: Interestingly, the canonical form for additive models in Equation 4 can be rearranged to be in the same form as Kolmogorov-Arnold representation theorem.
Revised: Interestingly, the canonical form for additive models in Equation 4 can be rearranged to be in the same form as Kolmogorov-Arnold representation theorem.

Original: By letting f ( t ) = (cid:80) I ⊆
Revised: By letting f ( t ) = (cid:80) I ⊆

Original: J f I ( t ) =
Revised: J f I ( t ) =

Original: g − 1 ( λ J ( t )) and g ( · ) = exp( · ) ,
Revised: g − 1 ( λ J ( t )) and g ( · ) = exp( · ) ,

Original: [Equation]
Revised: [Equation]

Original: τ =τ =
Revised: τ =τ =

Original: O r d e r o f i n t e r a c t i o n b e t w ee n p r
Revised: O r d e r o f i n t e r a c t i o n b e t w ee n p r

Original: o c e ss e s
Revised: o c e ss e s

Original: T i m e (Ω, ≺ ) τ
Revised: T i m e (Ω, ≺ ) τ

Original: =τ =
Revised: =τ =

Original: M {1} {2} {3} {1,2} {1,3}{2,3} {1,2,3} {1} {2} {3} {1,2} {1,3}{2,3} {1,2,3}
Revised: M {1} {2} {3} {1,2} {1,3}{2,3} {1,2,3} {1} {2} {3} {1,2} {1,3}{2,3} {1,2,3}

Original: [Figure]
Revised: [Figure]

Original: [Figure]
Revised: [Figure]

Original: where we assume f I ( t )
Revised: where we assume f I ( t )

Original: = 

Revised: =

Original: if | I | > k for the k -th order model and 1 / exp( β J ) is the normalization term for the intensity function.
Revised: if | I | > k for the k -th order model and 1 / exp( β J ) is the normalization term for the intensity function.

Original: Based on the Kolmogorov-Arnold representation theorem, generalized additive models are able to learn the intensity of the higher-order interaction between
Revised: Based on the Kolmogorov-Arnold representation theorem, generalized additive models are able to learn the intensity of the higher-order interaction between

Original: Poisson processes by using projections into lower dimensional spaces.
Revised: Poisson processes by using projections into lower dimensional spaces.

Original: The log-likelihood function for a k th-order model is obtained by
Revised: The log-likelihood function for a k th-order model is obtained by

Original: [Equation]
Revised: [Equation]

Original: where β ′ is a constant given by β ′
Revised: where β ′ is a constant given by β ′

Original: = (cid:82) λ J ( t ) dt
Revised: = (cid:82) λ J ( t ) dt

Original: + (cid:80) I ⊆
Revised: + (cid:80) I ⊆

Original: J β I .
Revised: J β I .

Original: In the following subsection we introduce a log-linear formulation equipped with partially ordered sample space, which aligns with the GAM formulation in Equation 5.
Revised: In the following subsection we introduce a log-linear formulation equipped with partially ordered sample space, which aligns with the GAM formulation in Equation 5.

Original: 2. A DDITIVE P OISSON P ROCESS
Revised: 2. A DDITIVE P OISSON P ROCESS

Original: We introduce our key technical contribution in this section, a log-linear formulation called the additive Poisson process to estimate the parameters for the higher-order interactions in Equation 6.
Revised: We introduce our key technical contribution in this section, a log-linear formulation called the additive Poisson process to estimate the parameters for the higher-order interactions in Equation 6.

Original: We begin by discretizing the time window [0 , T ] into M bins and treat each bin as a natural number τ ∈ [ M ] = { 1 , 2 , . . .
Revised: We begin by discretizing the time window [0 , T ] into M bins and treat each bin as a natural number τ ∈ [ M ] = { 1 , 2 , . . .

Original: , M } for each process.
Revised: , M } for each process.

Original: The discretization avoids the need to compute the intractable integral in the likelihood function in Equation 6.
Revised: The discretization avoids the need to compute the intractable integral in the likelihood function in Equation 6.

Original: The discretization approach tends to perform better in high-dimension compare to the alternative approaches such as variational inference.
Revised: The discretization approach tends to perform better in high-dimension compare to the alternative approaches such as variational inference.

Original: We assume that M is predetermined by the user.
Revised: We assume that M is predetermined by the user.

Original: First we introduce a structured space for the Poisson process to incorporate interactions between processes.
Revised: First we introduce a structured space for the Poisson process to incorporate interactions between processes.

Original: Let Ω = { ( J, τ ) | J ∈ 2 [ D ] \ ∅ , τ ∈ [ M ] } ∪ { ( ⊥ , 0) } , where the symbol ⊥ denotes the least element in our partial order structure, which is required to normalize probabilities in the resulting log-linear model.
Revised: Let Ω = { ( J, τ ) | J ∈ 2 [ D ] \ ∅ , τ ∈ [ M ] } ∪ { ( ⊥ , 0) } , where the symbol ⊥ denotes the least element in our partial order structure, which is required to normalize probabilities in the resulting log-linear model.

Original: We define the partial order ⪯ (Davey & Priestley, 2002) on Ω as
Revised: We define the partial order ⪯ (Davey & Priestley, 2002) on Ω as

Original: [Equation]
Revised: [Equation]

Original: and τ ≤ τ ′ , for each ω, ω ′ ∈ Ω , (7) and ( ⊥ , 0) ⪯ ω for all ω ∈ Ω , which is illustrated in Figure 1.
Revised: and τ ≤ τ ′ , for each ω, ω ′ ∈ Ω , [Equation] 7) and ( ⊥ , 0) ⪯ ω for all ω ∈ Ω , which is illustrated in Figure 1.

Original: The relation J ⊆
Revised: The relation J ⊆

Original: J ′ is used to model any-order interactionsbetween Poisson processes (Luo & Sugiyama, 2019) (Amari, 2016, Section 6.8.4)  and each τ in ( J, τ ) represents the auto-regressive component (“time”) in our model.
Revised: J ′ is used to model any-order interactions (Amari, 2016, Section 6.8.4) between Poisson processes and each τ in ( J, τ ) represents the auto-regressive component (“time”) in our model.

Original: Each node ω in the partially ordered set (poset) 1 represents the state of the sample space and the arrows in Figure 1 represent the partial order relationship between two nodes 2 ; that is, if ω → ω ′ , then ω ⪯ ω ′ .
Revised: Each node ω in the partially ordered set (poset) 1 represents the state of the sample space and the arrows in Figure 1 represent the partial order relationship between two nodes 2 ; that is, if ω → ω ′ , then ω ⪯ ω ′ .

Original: Intuitively, the greatest node for each τ ∈ [ M ] , which is ( { 1 , 2 , 3 } , τ ) in Figure 1, represents the multi-dimensional Poisson process.
Revised: Intuitively, the greatest node for each τ ∈ [ M ] , which is ( { 1 , 2 , 3 } , τ ) in Figure 1, represents the multi-dimensional Poisson process.

Original: Other nodes represent projections onto lowerdimensional space that correspond to the marginalized observations; for example, {{ 1 } , { 2 } , { 3 }}This graph structure should not be confused with the graph structure studied in graphical models, where the nodes typically represent a random variable and the arrows represent the relationship between the two random variables. and {{ 1 , 2 } , { 1 , 3 } , { 2 , 3 }} represent the first- and second-order processes.
Revised: Other nodes represent projections onto lowerdimensional space that correspond to the marginalized observations; for example, {{ 1 } , { 2 } , { 3 }} and {{ 1 , 2 } , { 1 , 3 } , { 2 , 3 }} represent the first- and second-order processes.

Original: Using our example in
Revised: Using our example in

Revised: This graph structure should not be confused with the graph structure studied in graphical models, where the nodes typically represent a random variable and the arrows represent the relationship between the two random variables.

Original: Introduction, where we wanted to estimate the intensity function of a pick-up event of a taxi, { 1 } and { 2 } correspond to spacial coordinates x and y , respectively, and { 3 } to the day of the week
Revised: Introduction, where we wanted to estimate the intensity function of a pick-up event of a taxi, { 1 } and { 2 } correspond to spacial coordinates x and y , respectively, and { 3 } to the day of the week

Original: W , and τ represents the (discretized) observation time.
Revised: W , and τ represents the (discretized) observation time.

Original: We can then update our belief to model the second-order intensity function using observations of the second order events.
Revised: We can then update our belief to model the second-order intensity function using observations of the second order events.

Original: For example, { 1 , 2 } , { 1 , 3 } , { 2 , 3 } represents an event occurring at { x, y } , { x, W } , and { y, W } .
Revised: For example, { 1 , 2 } , { 1 , 3 } , { 2 , 3 } represents an event occurring at { x, y } , { x, W } , and { y, W } .

Original: We can then continue this process to an arbitrary order of interactions.
Revised: We can then continue this process to an arbitrary order of interactions.

Original: Later on in this section we introduce the mathematics to estimate the higher-order function using a restricted number of lower-dimensional projections.
Revised: Later on in this section we introduce the mathematics to estimate the higher-order function using a restricted number of lower-dimensional projections.

Original: 1: Function APP( { t i } Ni =1 , S , M , h ): 2: Initialize Ω with the number M of bins 3: Apply Gaussian Kernel with bandwidth h on { t i } Ni =1 to compute ˆ p 4: Compute ˆ η = (ˆ η s ) s ∈S from ˆ p 5: Initialize θ =
Revised: 1: Function APP( { t i } Ni =1 , S , M , h ): 2: Initialize Ω with the number M of bins 3: Apply Gaussian Kernel with bandwidth h on { t i } Ni =1 to compute ˆ p 4: Compute ˆ η = (ˆ η s ) s ∈S from ˆ p 5: Initialize θ =

Original: ( θ s ) s ∈S (randomly or θ s = 0) 6: repeat 7:
Revised: ( θ s ) s ∈S (randomly or θ s = 0) 6: repeat 7:

Original: Compute p using the current θ =
Revised: Compute p using the current θ =

Original: ( θ s ) s ∈S 8:
Revised: ( θ s ) s ∈S 8:

Original: Compute η = ( η s ) s ∈S from p 9: ∆ η ← η − ˆ η 10:
Revised: Compute η = ( η s ) s ∈S from p 9: ∆ η ← η − ˆ η 10:

Original: Compute the Fisher information matrix G using Equation11: θ ← θ − G − 1 ∆ η 12: until convergence of θ =
Revised: Compute the Fisher information matrix G using Equation11: θ ← θ − G − 1 ∆ η 12: until convergence of θ =

Original: ( θ s ) s ∈S 13:
Revised: ( θ s ) s ∈S 13:

Original: End Function
Revised: End Function

Original: On any set equipped with a partial order, we can introduce a log-linear model (Sugiyama et al., 2017).
Revised: On any set equipped with a partial order, we can introduce a log-linear model (Sugiyama et al., 2017).

Original: Let us assume that a parameter domain
Revised: Let us assume that a parameter domain

Original: S ⊆ Ω is given.
Revised: S ⊆ Ω is given.

Original: For a partially ordered set (Ω , ⪯ ) , the log-linear model with parameters ( θ s ) s ∈S is introduced as
Revised: For a partially ordered set (Ω , ⪯ ) , the log-linear model with parameters ( θ s ) s ∈S is introduced as

Original: [Equation]
Revised: [Equation]

Original: for each ω ∈ Ω , where 1 [ · ] = 1 if the statement in [ · ] is true and 0 otherwise, and ψ ( θ ) ∈ R is the partition function uniquely obtained as ψ 
Revised: for each ω ∈ Ω , where 1 [ · ] = 1 if the statement in [ · ] is true and 0 otherwise, and ψ ( θ ) ∈ R is the partition function uniquely obtained as ψ ( θ ) = log (cid:80) ω ∈ Ω exp( (cid:80) s

Original: [Equation]
Revised: [Equation]

Original: −
Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original:  ( ⊥ , 0) .
Revised: = − θ ( ⊥ , 0) .

Original: A special case of this formulation coincides with the density function of the Boltzmann machines (Sugiyama et al., 2018; Luo &
Revised: A special case of this formulation coincides with the density function of the Boltzmann machines (Sugiyama et al., 2018; Luo &

Original: Sugiyama, 2019).
Revised: Sugiyama, 2019).

Original: Here there is a clear correspondence between the log-linear formulation and that in the form of
Revised: Here there is a clear correspondence between the log-linear formulation and that in the form of

Original: Kolmogorov-Arnold representation theorem in Equation 5 if we rewrite Equation 8 as
Revised: Kolmogorov-Arnold representation theorem in Equation 5 if we rewrite Equation 8 as

Original: [Equation]
Revised: [Equation]

Original: We call this model with (Ω , ⪯ ) defined in Equation 7 the additive Poisson process, which represents the intensity λ as the joint distribution across all possible states.
Revised: We call this model with (Ω , ⪯ ) defined in Equation 7 the additive Poisson process, which represents the intensity λ as the joint distribution across all possible states.

Original: The intensity λ of the multidimensional Poisson process given via the GAM in Equation 5 is fully modeled (parameterized) by Equation 8 and each intensity f
Revised: The intensity λ of the multidimensional Poisson process given via the GAM in Equation 5 is fully modeled (parameterized) by Equation 8 and each intensity f

Original: I ( · ) is obtained as θ ( I, · ) .
Revised: I ( · ) is obtained as θ ( I, · ) .

Original: To consider the k -th order model, we consistently use the parameter domain S , given as S
Revised: To consider the k -th order model, we consistently use the parameter domain S , given as S

Original: = { ( J, τ ) ∈ Ω | | J | ≤ k } , where k is an input parameter to the model that specifies the upper bound of the order of interactions.
Revised: = { ( J, τ ) ∈ Ω | | J | ≤ k } , where k is an input parameter to the model that specifies the upper bound of the order of interactions.

Original: This means that θ s = 0 for all s / ∈ S .
Revised: This means that θ s = 0 for all s / ∈ S .

Original: Note that our model is well-defined for any subset S ⊆ Ω and the user can use an arbitrary domain in applications.
Revised: Note that our model is well-defined for any subset S ⊆ Ω and the user can use an arbitrary domain in applications.

Original: A visualization of the truncated parameter space is shown in Figure 1a.
Revised: A visualization of the truncated parameter space is shown in Figure 1a.

Original: For a given J ⊆
Revised: For a given J ⊆

Original: [ D ] and each bin τ with ω =
Revised: [ D ] and each bin τ with ω =

Original: ( J, τ ) , the empirical probability ˆ p ( ω ) of input observations is given as 
Revised: ( J, τ ) , the empirical probability ˆ p ( ω ) of input observations is given as [Equation] K

Original: [Equation]
Revised: [Equation]

Original:  for each discretized state ω =
Revised: (10) for each discretized state ω =

Original: ( J, τ ) .
Revised: ( J, τ ) .

Original: The function σ I performs smoothing on time stamps t 1 , . . .
Revised: The function σ I performs smoothing on time stamps t 1 , . . .

Original: , t N , which is the kernel smoother proposed by Buja et al.
Revised: , t N , which is the kernel smoother proposed by Buja et al.

Original: The function K is a kernel and h
Revised: The function K is a kernel and h

Original: I is the bandwidth for each projection I ⊆
Revised: I is the bandwidth for each projection I ⊆

Original: [ D ] .
Revised: [ D ] .

Original: We use the Gaussian kernel as K to ensure that probability is always nonzero, meaning that the definition of the kernel smoother coincides with the kernel estimator of the intensity function proposed by Sch¨abe (1993).
Revised: We use the Gaussian kernel as K to ensure that probability is always nonzero, meaning that the definition of the kernel smoother coincides with the kernel estimator of the intensity function proposed by Sch¨abe (1993).

Original: The normalization constant for the intensity function can be computed by β J = (cid:80)
Revised: The normalization constant for the intensity function can be computed by β J = (cid:80)

Original: I ⊆
Revised: I ⊆

Original: J K ( τ − t i h I ) .
Revised: J K ( τ − t i h I ) .

Original: 2. O PTIMIZATION
Revised: 2. O PTIMIZATION

Original: Given an empirical distribution ˆ p defined in Equation 10, the task is to learn the parameter ( θ s ) s ∈S such that the distribution via the log-linear model in Equation 8 is as close to ˆ p as much as possible.
Revised: Given an empirical distribution ˆ p defined in Equation 10, the task is to learn the parameter ( θ s ) s ∈S such that the distribution via the log-linear model in Equation 8 is as close to ˆ p as much as possible.

Original: Let us define S S
Revised: Let us define S S

Original: = { p | θ s = 

Revised: = { p | θ s =

Original: if s ̸∈ S} , which is the set of distributions that can be represented by the log-linear model using the parameter domain S .
Revised: if s ̸∈ S} , which is the set of distributions that can be represented by the log-linear model using the parameter domain S .

Original: Then the objective function is given as min p ∈ S S D KL (ˆ p, p ) , where D KL (ˆ p, p ) =
Revised: Then the objective function is given as min p ∈ S S D KL (ˆ p, p ) , where D KL (ˆ p, p ) =

Original: (cid:80) ω
Revised: (cid:80) ω

Original: ∈ Ω ˆ p log(ˆ p/p ) is the KL divergence from ˆ p to p .
Revised: ∈ Ω ˆ p log(ˆ p/p ) is the KL divergence from ˆ p to p .

Original: In this optimization, let p ∗ be the learned distribution from the sample with infinitely large sample size and let p be the learned distribution for each sample.
Revised: In this optimization, let p ∗ be the learned distribution from the sample with infinitely large sample size and let p be the learned distribution for each sample.

Original: Then we can lower bound the uncertainty (variance) E
Revised: Then we can lower bound the uncertainty (variance) E

Original: [ D KL ( p ∗ , p )] by |S| / 2 N (Barron & Hengartner, 1998).
Revised: [ D KL ( p ∗ , p )] by |S| / 2 N (Barron & Hengartner, 1998).

Original: Thanks to the well-developed theory of information geometry (Amari, 2016) for the log-linear model (Amari, 2001), it is known that this problem can be solved by e -projection , which coincides with the maximum likelihood estimation and is always convex optimization (Amari, 2016, Chapter 2.8.3).
Revised: Thanks to the well-developed theory of information geometry (Amari, 2016) for the log-linear model (Amari, 2001), it is known that this problem can be solved by e -projection , which coincides with the maximum likelihood estimation and is always convex optimization (Amari, 2016, Chapter 2.8.3).

Original: The gradient with respect to each parameter θ s is obtained by ( ∂/∂θ s ) D KL (ˆ p, p ) =
Revised: The gradient with respect to each parameter θ s is obtained by ( ∂/∂θ s ) D KL (ˆ p, p ) =

Original: η s − ˆ η s , where η s = (cid:80) ω
Revised: η s − ˆ η s , where η s = (cid:80) ω

Original: ∈ Ω 1 [ ω ⪰ s ] p ( ω ) .
Revised: ∈ Ω 1 [ ω ⪰ s ] p ( ω ) .

Original: The value η s is known as the expectation parameter (Sugiyama et al., 2017) and ˆ η s is obtained by replacing p with ˆ p in the above equation.
Revised: The value η s is known as the expectation parameter (Sugiyama et al., 2017) and ˆ η s is obtained by replacing p with ˆ p in the above equation.

Original: If ˆ η s = 0 for some s ∈ S , we remove s from S to ensure that the model is well-defined.
Revised: If ˆ η s = 0 for some s ∈ S , we remove s from S to ensure that the model is well-defined.

Original: Let S = { s 1 , . . .
Revised: Let S = { s 1 , . . .

Original: , s |S| } and θ =
Revised: , s |S| } and θ =

Original: [ θ s 1 , . .
Revised: [ θ s 1 , . .

Original: θ s |S| ] T , η =
Revised: θ s |S| ] T , η =

Original: [ η s 1 , . .
Revised: [ η s 1 , . .

Original: , η s |S| ] T .
Revised: , η s |S| ] T .

Original: We can always use the natural gradient (Amari, 1998) as the closed form solution of the Fisher information matrix is always available (Sugiyama et al., 2017).
Revised: We can always use the natural gradient (Amari, 1998) as the closed form solution of the Fisher information matrix is always available (Sugiyama et al., 2017).

Original: The update step is θ next = θ − G − 1 ( η − ˆ η ) , where the
Revised: The update step is θ next = θ − G − 1 ( η − ˆ η ) , where the

Original: Fisher information matrix G is obtained as
Revised: Fisher information matrix G is obtained as

Original: [Equation]
Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: Theoretically the Fisher information matrix is numerically stable to perform a matrix inversion.
Revised: Theoretically the Fisher information matrix is numerically stable to perform a matrix inversion.

Original: However, computationally, floating point errors may cause the matrix to become indefinite.
Revised: However, computationally, floating point errors may cause the matrix to become indefinite.

Original: To overcome this issue, a small positive value is added along the main diagonal of the matrix.
Revised: To overcome this issue, a small positive value is added along the main diagonal of the matrix.

Original: This technique is known as jitter and it is used in areas like Gaussian processes to ensure that the covariance matrix is computationally positive semi-definite (Neal, 1999).
Revised: This technique is known as jitter and it is used in areas like Gaussian processes to ensure that the covariance matrix is computationally positive semi-definite (Neal, 1999).

Original: The pseudocode for APP is shown in Algorithm 1.
Revised: The pseudocode for APP is shown in Algorithm 1.

Original: The time complexity of computing line 7 is
Revised: The time complexity of computing line 7 is

Original: O ( | Ω ||S| ) .
Revised: O ( | Ω ||S| ) .

Original: This means when implementing the model using gradient descent, the time complexity of the model is O ( | Ω ||S| 2 ) to update the parameters in S for each iteration.
Revised: This means when implementing the model using gradient descent, the time complexity of the model is O ( | Ω ||S| 2 ) to update the parameters in S for each iteration.

Original: For natural gradient, the cost of inverting the Fisher information matrix G is O ( |S| 3 ) ; therefore, the time complexity to update the parameters in S is O ( |S| 3 + | Ω ||S| ) for each iteration.
Revised: For natural gradient, the cost of inverting the Fisher information matrix G is O ( |S| 3 ) ; therefore, the time complexity to update the parameters in S is O ( |S| 3 + | Ω ||S| ) for each iteration.

Original: The time complexity for natural gradient is significantly higher higher because of the requirement to invert the fisher information matrix; if the number of parameters is small, it is more efficient to use natural gradient because it requires significantly fewer iterations.
Revised: The time complexity for natural gradient is significantly higher higher because of the requirement to invert the fisher information matrix; if the number of parameters is small, it is more efficient to use natural gradient because it requires significantly fewer iterations.

Original: However, if the number of parameters is large, it is more efficient to use gradient descent.
Revised: However, if the number of parameters is large, it is more efficient to use gradient descent.

Original:  E XPERIMENTS
Revised:  E XPERIMENTS

Original: We perform experiments using two-dimensional synthetic data, higher-dimensional synthetic data, and real-world data to evaluate the performance of our proposed approach.
Revised: We perform experiments using two-dimensional synthetic data, higher-dimensional synthetic data, and real-world data to evaluate the performance of our proposed approach.

Original: Our code is implemented in Python 3.7.5 with NumPy version 1.8.2 and the experiments are run on Ubuntu 18.
Revised: Our code is implemented in Python 3.7.5 with NumPy version 1.8.2 and the experiments are run on Ubuntu 18.

Original: LTS with an Intel i7-8700 6c/12t with 16GB of memory 3 .
Revised: LTS with an Intel i7-8700 6c/12t with 16GB of memory 3 .

Original: In experiments with synthetic data, we simulate random events using Equation 1.
Revised: In experiments with synthetic data, we simulate random events using Equation 1.

Original: We generate an intensity function using a mixture of
Revised: We generate an intensity function using a mixture of

Original: Gaussians, where the mean is drawn from a uniform distribution and the covariance is drawn from an inverted Wishart distribution.
Revised: Gaussians, where the mean is drawn from a uniform distribution and the covariance is drawn from an inverted Wishart distribution.

Original: The intensity function is then the density function multiplied by the sample size.
Revised: The intensity function is then the density function multiplied by the sample size.

Original: The synthetic data is generated by directly drawing a sample from the probability density function .
Revised: The synthetic data is generated by directly drawing a sample from the probability density function .

Original: An arbitrary number of samples is drawn from the mixture of Gaussians.
Revised: An arbitrary number of samples is drawn from the mixture of Gaussians.

Original: We then run our models and compare with Kernel Density Estimation (KDE) (Rosenblatt, 1956), an inhomogeneous Poisson process whose intensity is estimated by a reproducing kernel Hilbert space formulation (RKHS) (Flaxman et al., 2017), and a Dirichlet process mixture of Beta distributions (DP-beta) (Kottas, 2006; Kottas & Sans ´ o, 2007).
Revised: We then run our models and compare with Kernel Density Estimation (KDE) (Rosenblatt, 1956), an inhomogeneous Poisson process whose intensity is estimated by a reproducing kernel Hilbert space formulation (RKHS) (Flaxman et al., 2017), and a Dirichlet process mixture of Beta distributions (DP-beta) (Kottas, 2006; Kottas & Sans ´ o, 2007).

Original: The hyper-parameters M and h in our proposed model are selected using grid search and cross-validation.
Revised: The hyper-parameters M and h in our proposed model are selected using grid search and cross-validation.

Original: For situations where a validation set is not available, then h could be selected using a rule of thumb approach such as Scott’s Rule (Scott, 2015) and M could be selected empirically from the input data by computing the time interval of the joint observation.
Revised: For situations where a validation set is not available, then h could be selected using a rule of thumb approach such as Scott’s Rule (Scott, 2015) and M could be selected empirically from the input data by computing the time interval of the joint observation.

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: I n t e n s i t y
Revised: I n t e n s i t y

Original: Process: [1]     10 Time

Revised: Process: [1]     10 Time

Original: I n t e n s i t y
Revised: I n t e n s i t y

Original: Process: [2]
Revised: Process: [2]

Original: Ground Truth
Revised: Ground Truth

Original: Order: Order:
Revised: Order: Order:

Original: KDE
Revised: KDE

Original: RKHS
Revised: RKHS

Original: DP-beta     10 Time 0.0 0.
Revised: DP-beta     10 Time 0.0 0.

Original: I n t e n s i t y
Revised: I n t e n s i t y

Original: Process: [1, 2]
Revised: Process: [1, 2]

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

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

Original: 3. E XPERIMENTS ON T WO -D IMENSIONAL P ROCESSES
Revised: 3. E XPERIMENTS ON T WO -D IMENSIONAL P ROCESSES

Original: For our experiment
Revised: For our experiment

Original: [Table]
Revised: [Table]

Original: we use 20 Gaussian components and simulate a dense case with 100,000 observations and a sparse case with 1,000 observations within the time frame of 10 seconds.
Revised: we use 20 Gaussian components and simulate a dense case with 100,000 observations and a sparse case with 1,000 observations within the time frame of 10 seconds.

Original: We consider that a joint event occurs if the two events occur 0.1 seconds apart.
Revised: We consider that a joint event occurs if the two events occur 0.1 seconds apart.

Original: Figure 3a and Figure 3b compare the KL divergence between the first- and second-order models and plots in Figure 4 are the corresponding intensity functions.
Revised: Figure 3a and Figure 3b compare the KL divergence between the first- and second-order models and plots in Figure 4 are the corresponding intensity functions.

Original: In the first-order processes, both first- and second-order models have the same performance.
Revised: In the first-order processes, both first- and second-order models have the same performance.

Original: This is expected, as both of the models can treat first-order interactions and are able to learn the empirical intensity function exactly, which is the superposition of the onedimensional projection of the Gaussian kernels on each observation.
Revised: This is expected, as both of the models can treat first-order interactions and are able to learn the empirical intensity function exactly, which is the superposition of the onedimensional projection of the Gaussian kernels on each observation.

Original: For the second-order process, the second-order model performs better than the first-order model because it is able to directly learn
Revised: For the second-order process, the second-order model performs better than the first-order model because it is able to directly learn

Original: [Figure]
Revised: [Figure]

Original: [Figure]
Revised: [Figure]

Original: the intensity function from the projection onto the two-dimensional space.
Revised: the intensity function from the projection onto the two-dimensional space.

Original: In contrast, the first-order model must approximate the second-order process using the observations from the first-order processes.
Revised: In contrast, the first-order model must approximate the second-order process using the observations from the first-order processes.

Original: In the sparse case, the second-order model performs better when the correct bandwidth is selected.
Revised: In the sparse case, the second-order model performs better when the correct bandwidth is selected.

Original: Table 1 compares our approach APP with other state-of-the-art approaches.
Revised: Table 1 compares our approach APP with other state-of-the-art approaches.

Original: APP performs the best for first-order processes in both the sparse and dense experiments.
Revised: APP performs the best for first-order processes in both the sparse and dense experiments.

Original: Experiments for RKHS and
Revised: Experiments for RKHS and

Original: DP-beta were unable to complete running within two days for the dense experiment.
Revised: DP-beta were unable to complete running within two days for the dense experiment.

Original: In the secondorder process, our approach was outperformed by KDE, while the second-order APP was able to outperform both RKHS and DP-beta process for both sparse and dense experiments.
Revised: In the secondorder process, our approach was outperformed by KDE, while the second-order APP was able to outperform both RKHS and DP-beta process for both sparse and dense experiments.

Original: Figures 3a and 3b show that KDE is sensitive to changes in bandwidth, which means that, for any practical implementation of the model, second-order APP with a less sensitive bandwidth is more likely to learn a more accurate intensity function when the ground truth is unknown.
Revised: Figures 3a and 3b show that KDE is sensitive to changes in bandwidth, which means that, for any practical implementation of the model, second-order APP with a less sensitive bandwidth is more likely to learn a more accurate intensity function when the ground truth is unknown.

Original: 3. E XPERIMENTS ON H IGHER -D IMENSIONAL P ROCESSES
Revised: 3. E XPERIMENTS ON H IGHER -D IMENSIONAL P ROCESSES

Original: We generate a fourth-order process to simulate the behavior of the model in higher dimensions.
Revised: We generate a fourth-order process to simulate the behavior of the model in higher dimensions.

Original: The model is generalizable to higher dimensions, but it is difficult to demonstrate results for processes higher than fourth order.
Revised: The model is generalizable to higher dimensions, but it is difficult to demonstrate results for processes higher than fourth order.

Original: For our experiment, we generate an intensity function using 50 Gaussian components and draw a sample with the size of 10 7 for the dense case and that with the size of 10for the sparse case.
Revised: For our experiment, we generate an intensity function using 50 Gaussian components and draw a sample with the size of 10 7 for the dense case and that with the size of 10for the sparse case.

Original: We consider the joint event to be the time frame of 0.1 seconds.
Revised: We consider the joint event to be the time frame of 0.1 seconds.

Original: We were not able to run comparison experiments with other models because they are unable to learn when there are no or few joint observations in third- and fourth-order processes.
Revised: We were not able to run comparison experiments with other models because they are unable to learn when there are no or few joint observations in third- and fourth-order processes.

Original: In addition, the time complexity is too high to learn from joint observations in first- and second-order processes because all the other models have their time complexity proportional to the number of observations.
Revised: In addition, the time complexity is too high to learn from joint observations in first- and second-order processes because all the other models have their time complexity proportional to the number of observations.

Original: The time complexity for KDE is O ( N D ) for the dimensionality with D , while DP-beta is O ( N 2 K ) , where
Revised: The time complexity for KDE is O ( N D ) for the dimensionality with D , while DP-beta is O ( N 2 K ) , where

Original: K is the number of clusters, and RKHS is O ( N 2 ) for each iteration with respect to the sample size
Revised: K is the number of clusters, and RKHS is O ( N 2 ) for each iteration with respect to the sample size

Original: N , where DP-beta and RKHS are applied directly on the joint observation as they cannot use the projections in lower-dimensional space.
Revised: N , where DP-beta and RKHS are applied directly on the joint observation as they cannot use the projections in lower-dimensional space.

Original: KDE is able to make an estimation of the intensity function using projections in lower-dimensional space, but it was too computationally expensive to complete running the experiment.
Revised: KDE is able to make an estimation of the intensity function using projections in lower-dimensional space, but it was too computationally expensive to complete running the experiment.

Original: By contrast, our model is more efficient because the time complexity is proportional to the number of bins in our model.
Revised: By contrast, our model is more efficient because the time complexity is proportional to the number of bins in our model.

Original: The time complexity of APP for each iteration is
Revised: The time complexity of APP for each iteration is

Original: O ( | Ω ||S| ) , where | Ω | =
Revised: O ( | Ω ||S| ) , where | Ω | =

Original: M D and |S| = (cid:80) kc =1 (cid:0) Dc (cid:1) .
Revised: M D and |S| = (cid:80) kc =1 (cid:0) Dc (cid:1) .

Original: Our model scales combinatorially with respect to the number of dimensions.
Revised: Our model scales combinatorially with respect to the number of dimensions.

Original: However, this is unavoidable for any model that directly takes into account the high-order interactions.
Revised: However, this is unavoidable for any model that directly takes into account the high-order interactions.

Original: For practical applications, the number of dimensions D and the order of the model k is often small, making it feasible to compute.
Revised: For practical applications, the number of dimensions D and the order of the model k is often small, making it feasible to compute.

Original: In Figure 5a, we observe similar behavior in the model, where the first-order processes fit precisely to the empirical distribution generated by the Gaussian kernels.
Revised: In Figure 5a, we observe similar behavior in the model, where the first-order processes fit precisely to the empirical distribution generated by the Gaussian kernels.

Original: The third-order model is able to predict better on the fourth-order process.
Revised: The third-order model is able to predict better on the fourth-order process.

Original: This is because the observation shown in Figure 6a is largely sparse and learning from the observations directly may overfit.
Revised: This is because the observation shown in Figure 6a is largely sparse and learning from the observations directly may overfit.

Original: A lower-dimensional approximation is able to provide a better result in the third-order model.
Revised: A lower-dimensional approximation is able to provide a better result in the third-order model.

Original: Similar trends can be seen in the sparse case, as shown in Figure 5b, where a second-order model is able to produce better estimation in third- and fourth-order processes.
Revised: Similar trends can be seen in the sparse case, as shown in Figure 5b, where a second-order model is able to produce better estimation in third- and fourth-order processes.

Original: The observations are extremely sparse, as seen in
Revised: The observations are extremely sparse, as seen in

Original: Figure 6b, where there are only a few observations or no observations at all to learn the intensity function.
Revised: Figure 6b, where there are only a few observations or no observations at all to learn the intensity function.

Original: 3. U NCOVERING C OMMON P ATTERNS IN THE N EW Y ORK T AXI D ATASET
Revised: 3. U NCOVERING C OMMON P ATTERNS IN THE N EW Y ORK T AXI D ATASET

Original: We demonstrate the capability of our model on the 2016 Green Taxi Trip dataset 4 , which is a open source dataset with a CC0: Public Domain licences.
Revised: We demonstrate the capability of our model on the 2016 Green Taxi Trip dataset 4 , which is a open source dataset with a CC0: Public Domain licences.

Original: We are interested in finding the common pick-up patterns across Tuesdays and Wednesdays.
Revised: We are interested in finding the common pick-up patterns across Tuesdays and Wednesdays.

Original: We define a common pick-up time to be within 1-minute intervals of each other between the two days.
Revised: We define a common pick-up time to be within 1-minute intervals of each other between the two days.

Original: We have chosen to learn an intensity function using the Poisson process for Tuesday and Wednesday and a joint process for both of them.
Revised: We have chosen to learn an intensity function using the Poisson process for Tuesday and Wednesday and a joint process for both of them.

Original: The joint process uncovers the common pick-up patterns between the two days.
Revised: The joint process uncovers the common pick-up patterns between the two days.

Original: We have selected to use the first two Tuesdays and Wednesdays in January 2016 as our training and validation sets and the
Revised: We have selected to use the first two Tuesdays and Wednesdays in January 2016 as our training and validation sets and the

Original: Tuesday and Wednesday of the third week of January 2016 as our testing set.
Revised: Tuesday and Wednesday of the third week of January 2016 as our testing set.

Original: We repeat the same experiment for February and March.
Revised: We repeat the same experiment for February and March.

Original: We show our results in Table 2, where we use the negative test log-likelihood as an evaluation measure.
Revised: We show our results in Table 2, where we use the negative test log-likelihood as an evaluation measure.

Original: APP-2 has consistently outperformed all the other approaches for the joint process between
Revised: APP-2 has consistently outperformed all the other approaches for the joint process between

Original: Tuesday and Wednesday.
Revised: Tuesday and Wednesday.

Original: In addition, for the individual process, APP-1 and -2 also showed the best result for February and March.
Revised: In addition, for the individual process, APP-1 and -2 also showed the best result for February and March.

Original: These results demonstrate the effectiveness of our model in capturing higher-order interactions between processes, which is difficult for the other existing approaches.
Revised: These results demonstrate the effectiveness of our model in capturing higher-order interactions between processes, which is difficult for the other existing approaches.

Original:  C ONCLUSION
Revised:  C ONCLUSION

Original: We have proposed a novel framework, called Additive Poisson Process (APP), to learn the intensity function of the higher-order interaction between Poisson processes using observations projected into lower-dimensional spaces.
Revised: We have proposed a novel framework, called Additive Poisson Process (APP), to learn the intensity function of the higher-order interaction between Poisson processes using observations projected into lower-dimensional spaces.

Original: We formulated our proposed model using the log-linear model and optimize it using information geometric structure of the distribution space.
Revised: We formulated our proposed model using the log-linear model and optimize it using information geometric structure of the distribution space.

Original: We drew parallels between our proposed model and generalized additive model and showed the ability to learn from lower dimensional projections via the Kolmogorov-Arnold representation theorem .
Revised: We drew parallels between our proposed model and generalized additive model and showed the ability to learn from lower dimensional projections via the Kolmogorov-Arnold representation theorem .

Original: Our empirical results show the superiority of our method when learning the higher-order interactions between Poisson processes and when there are no or extremely sparse joint observations.
Revised: Our empirical results show the superiority of our method when learning the higher-order interactions between Poisson processes and when there are no or extremely sparse joint observations.

Original: Our model is also robust to varying sample sizes.
Revised: Our model is also robust to varying sample sizes.

Original: Our approach provides a novel formulation to learn the joint intensity function which typically has extremely low intensity.
Revised: Our approach provides a novel formulation to learn the joint intensity function which typically has extremely low intensity.

Original: There is enormous potential to apply APP to real-world applications, where higher order interaction effects need to be modeled such as transportation, finance and ecology.
Revised: There is enormous potential to apply APP to real-world applications, where higher order interaction effects need to be modeled such as transportation, finance and ecology.

Original: A PPENDIX A R ELATED W ORK A. B AYESIAN I NFERENCE FOR P OISSON P ROCESS
Revised: A PPENDIX A R ELATED W ORK A. B AYESIAN I NFERENCE FOR P OISSON P ROCESS

Original: Learning an intensity function from sparse high-dimensional datasets is a challenging problem.
Revised: Learning an intensity function from sparse high-dimensional datasets is a challenging problem.

Original: It often comes a trade-off between computational complexity and numerical accuracy.
Revised: It often comes a trade-off between computational complexity and numerical accuracy.

Original: For applications which are sparse with higher dimensionality, numerical accuracy is often sacrificed to approximate the intensity function.
Revised: For applications which are sparse with higher dimensionality, numerical accuracy is often sacrificed to approximate the intensity function.

Original: The na¨ıve approach using MCMC has cubic complexity O ( n 3 ) for each dimension and increases exponentially with respect with additional input dimension, that is, O (( n 3 ) d ) , where n refers to the number of observations and d is the number of dimensions.
Revised: The na¨ıve approach using MCMC has cubic complexity O ( n 3 ) for each dimension and increases exponentially with respect with additional input dimension, that is, O (( n 3 ) d ) , where n refers to the number of observations and d is the number of dimensions.

Original: One example of this approach is using a Dirichlet process mixture of Beta distribution as a prior for the intensity function of the Poisson process (Kottas, 2006; Kottas & Sans´o, 2007).
Revised: One example of this approach is using a Dirichlet process mixture of Beta distribution as a prior for the intensity function of the Poisson process (Kottas, 2006; Kottas & Sans´o, 2007).

Original: The solution from MCMC is often accurate and asymtopically converges to the true posterior intensity function.
Revised: The solution from MCMC is often accurate and asymtopically converges to the true posterior intensity function.

Original: However, due to its computational complexity, it is infeasible to estimate any high-dimensional intensity function.
Revised: However, due to its computational complexity, it is infeasible to estimate any high-dimensional intensity function.

Original: More recent techniques have attempted to scale up these approaches by using Gaussian processes as a functional prior to the intensity function (Samo & Roberts, 2015).
Revised: More recent techniques have attempted to scale up these approaches by using Gaussian processes as a functional prior to the intensity function (Samo & Roberts, 2015).

Original: However, the model complexity is O ( n 2 k ) for each dimension and is exponential with respect to the number of input dimensions, which is still infeasible to estimate any high-dimensional intensity function.
Revised: However, the model complexity is O ( n 2 k ) for each dimension and is exponential with respect to the number of input dimensions, which is still infeasible to estimate any high-dimensional intensity function.

Original: Variational inference (Lloyd et al., 2015) approaches that can be used to make Bayesian inference of
Revised: Variational inference (Lloyd et al., 2015) approaches that can be used to make Bayesian inference of

Original: Poisson process much more efficient scaling it up to the linear complexity O ( n ) for each dimension.
Revised: Poisson process much more efficient scaling it up to the linear complexity O ( n ) for each dimension.

Original: One of the most notable work in this area is using Fourier Features in the Cox Process (John &
Revised: One of the most notable work in this area is using Fourier Features in the Cox Process (John &

Original: Hensman, 2018).
Revised: Hensman, 2018).

Original: However variational inference is not guaranteed to asymptotically converge to the true posterior distribution.
Revised: However variational inference is not guaranteed to asymptotically converge to the true posterior distribution.

Original: Because variational inference does not have any theoretical guarantees, it is likely to fail in extremely high dimensions and sparse observations.
Revised: Because variational inference does not have any theoretical guarantees, it is likely to fail in extremely high dimensions and sparse observations.

Original: Our approach uses the discretization approach to scale up the model to higher dimensions.
Revised: Our approach uses the discretization approach to scale up the model to higher dimensions.

Original: We use a graph (partial order) structure to allow the flexibility for domain expertise to specific how each dimension is treated and which interaction effects should be included into the model.
Revised: We use a graph (partial order) structure to allow the flexibility for domain expertise to specific how each dimension is treated and which interaction effects should be included into the model.

Original: Unlike variational inference based approaches, our estimation procedure of the intensity function has theoretical convergence which is based by the Kolmogorov-Arnold theorem.
Revised: Unlike variational inference based approaches, our estimation procedure of the intensity function has theoretical convergence which is based by the Kolmogorov-Arnold theorem.

Original: A. P OISSON F ACTORIZATION
Revised: A. P OISSON F ACTORIZATION

Original: Our work is closely related to Poisson Factorization (Chi & Kolda, 2012), where random variables in a tensor are represented with a Poisson distributed or Poisson process likelihood.
Revised: Our work is closely related to Poisson Factorization (Chi & Kolda, 2012), where random variables in a tensor are represented with a Poisson distributed or Poisson process likelihood.

Original: The tensor is usually used to represent some high-dimensional dataset such as contingency tables or other collection of counting datasets, which are often large and sparse.
Revised: The tensor is usually used to represent some high-dimensional dataset such as contingency tables or other collection of counting datasets, which are often large and sparse.

Original: The objective of Poison Factorization is to decompose the high-dimensional sparse matrices into lower dimensional space, where we can find some meaningful latent structure.
Revised: The objective of Poison Factorization is to decompose the high-dimensional sparse matrices into lower dimensional space, where we can find some meaningful latent structure.

Original: The effectiveness of Poisson factorization for high dimensional datasets makes it ideal to analyze spatial-temporal problems consisting of sparse count data.
Revised: The effectiveness of Poisson factorization for high dimensional datasets makes it ideal to analyze spatial-temporal problems consisting of sparse count data.

Original: One example of this work is Bayesian
Revised: One example of this work is Bayesian

Original: Poisson Tucker decomposition (BPTD) (Schein et al., 2016), where a dataset of interaction events is represented as a set of N events, each of which consists of a pair of a token e i that encodes certain features and time, that is, ( e i , t i ).
Revised: Poisson Tucker decomposition (BPTD) (Schein et al., 2016), where a dataset of interaction events is represented as a set of N events, each of which consists of a pair of a token e i that encodes certain features and time, that is, ( e i , t i ).

Original: BPTD uses an MCMC inference algorithm to learn the latent structure, which is based on an extension of stochastic block models (SBM)
Revised: BPTD uses an MCMC inference algorithm to learn the latent structure, which is based on an extension of stochastic block models (SBM)

Original: (Nowicki & Snijders, 2001) with a Poisson likelihood.
Revised: (Nowicki & Snijders, 2001) with a Poisson likelihood.

Original: Our approach provides a generalization of this idea of Poisson Factorization by using Legendre tensor decomposition (Sugiyama et al., 2018) and demonstrating its ability on a spatial-temporal problem.
Revised: Our approach provides a generalization of this idea of Poisson Factorization by using Legendre tensor decomposition (Sugiyama et al., 2018) and demonstrating its ability on a spatial-temporal problem.

Original: Our optimization is much more efficient as it is guided by gradients to minimize the KLdivergence.
Revised: Our optimization is much more efficient as it is guided by gradients to minimize the KLdivergence.

Original: Our approach also contains a graph structure which allows domain experts to encode certain properties into the model.
Revised: Our approach also contains a graph structure which allows domain experts to encode certain properties into the model.

Original: B A DDITIONAL E XPERIMENTS B. B ANDWIDTH S ENSITIVITY A NALYSIS
Revised: B A DDITIONAL E XPERIMENTS B. B ANDWIDTH S ENSITIVITY A NALYSIS

Original: Our first experiment is to demonstrate the ability for our proposed model to learn an intensity function from samples.
Revised: Our first experiment is to demonstrate the ability for our proposed model to learn an intensity function from samples.

Original: We generate a Bernoulli process with probably of p = 0 .
Revised: We generate a Bernoulli process with probably of p = 0 .

Original: 1 to generate samples for every 1 seconds for 100 seconds to create a toy problem for our model.
Revised: 1 to generate samples for every 1 seconds for 100 seconds to create a toy problem for our model.

Original: This experiment is to observe the behaviour of varying the bandwidth in our model.
Revised: This experiment is to observe the behaviour of varying the bandwidth in our model.

Original: In Figure 7a, we observe that applying no kernel, we learn the deltas of each individual observation.
Revised: In Figure 7a, we observe that applying no kernel, we learn the deltas of each individual observation.

Original: When we apply a Gaussian kernel, the output of the model for the intensity function is much more smooth.
Revised: When we apply a Gaussian kernel, the output of the model for the intensity function is much more smooth.

Original: Increasing the bandwidth of the kernel will provide a wider and much smoother function.
Revised: Increasing the bandwidth of the kernel will provide a wider and much smoother function.

Original: Between the 60 seconds andseconds mark, it can be seen when two observations have overlapping kernels, the intensity function becomes larger in magnitude.
Revised: Between the 60 seconds andseconds mark, it can be seen when two observations have overlapping kernels, the intensity function becomes larger in magnitude.

Original: B. O NE D IMENSIONAL P OISSON P ROCESS
Revised: B. O NE D IMENSIONAL P OISSON P ROCESS

Original: A one dimensional experiment is simulated using Ogata’s thinning algorithm (Ogata, 1981).
Revised: A one dimensional experiment is simulated using Ogata’s thinning algorithm (Ogata, 1981).

Original: We generate two experiments use the standard sinusoidal benchmark intensity function with a frequency of 20 π .
Revised: We generate two experiments use the standard sinusoidal benchmark intensity function with a frequency of 20 π .

Original: The dense experiment has troughs with 0 intensity and peaks at 201 and the sparse experiment has troughs with 0 intensity and peaks at 2.
Revised: The dense experiment has troughs with 0 intensity and peaks at 201 and the sparse experiment has troughs with 0 intensity and peaks at 2.

Original: Figure 7d shows the experimental results of the dense case, our model has no problem learning the intensity function.
Revised: Figure 7d shows the experimental results of the dense case, our model has no problem learning the intensity function.

Original: We compare our results using KL
Revised: We compare our results using KL

Original: 1: Function Thinning Algorithm ( λ ( t ) , T ): 2: n = m = 0 , t 

Revised: 1: Function Thinning Algorithm ( λ ( t ) , T ): 2: n = m = 0 , t

Original: = s 

Revised: = s

Original: = 0 , ¯ λ = sup 0 ≤ t ≤ T λ ( t ) 3: repeat 4: u ∼ uniform (0 , 1) 5: w = − 1¯
Revised: = 0 , ¯ λ = sup 0 ≤ t ≤ T λ ( t ) 3: repeat 4: u ∼ uniform (0 , 1) 5: w = − 1¯

Original: λ ln u { w ∼ exponential(¯ λ ) } 6: s m +

Revised: λ ln u { w ∼ exponential(¯ λ ) } 6: s m +

Original: =
Revised: =

Original: s m + w 7:
Revised: s m + w 7:

Original: D ∼ uniform (0 , 1) 8: if D ≤ λ ( s m +1 ) ¯ λ then 9: t n +

Revised: D ∼ uniform (0 , 1) 8: if D ≤ λ ( s m +1 ) ¯ λ then 9: t n +

Original: = s m +1 10: n = n +11: else 12: m = m
Revised: = s m +1 10: n = n +11: else 12: m = m

Original: +13: end if 14: if t n ≤ T then 15: return { t k } k =1 , 2 ,...,n 16: else 17: return { t k } k =1 , 2 ,...,n − 1 18: end if 19: until s m ≤ T 20:
Revised: +13: end if 14: if t n ≤ T then 15: return { t k } k =1 , 2 ,...,n 16: else 17: return { t k } k =1 , 2 ,...,n − 1 18: end if 19: until s m ≤ T 20:

Original: End Function
Revised: End Function

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: [Figure]
Revised: [Figure]

Original: n
Revised: n

Original: [Figure]
Revised: [Figure]

Original: I
Revised: I

Original: [Figure]
Revised: [Figure]

Original: t
Revised: t

Original: [Figure]
Revised: [Figure]

Original: i t y
Revised: i t y

Original: [Figure]
Revised: [Figure]

Original: divergence between the underlying intensity function used to generate the samples to the intensity function generated by the model.
Revised: divergence between the underlying intensity function used to generate the samples to the intensity function generated by the model.

Original: Figure 7b shows that the optimal bandwidth is h =
Revised: Figure 7b shows that the optimal bandwidth is h =

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

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

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

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: ( b ) S p a r s e ob s e r v a ti on s .
Revised: ( b ) S p a r s e ob s e r v a ti on s .

Original: F i gu r e 8 :
Revised: F i gu r e 8 :

Original: K L
Revised: K L

Original: D i v e r g e n ce
Revised: D i v e r g e n ce

Original: f
Revised: f

Original: o r f ou ro r d e r P o i ss on p r o ce ss .
Revised: o r f ou ro r d e r P o i ss on p r o ce ss .

Original: [Table]
Revised: [Table]

Original: ss
Revised: ss

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

Original: ss
Revised: ss

Original: [Table]
Revised: [Table]

Original: 50 Intensity
Revised: 50 Intensity

Original: P r o c e ss : [ 2 , 3 , 4 ]
Revised: P r o c e ss : [ 2 , 3 , 4 ]

Original: T i m e 0 2 4 Intensity
Revised: T i m e 0 2 4 Intensity

Original: P r o c e ss : [ 1 , 2 , 3 ,]
Revised: P r o c e ss : [ 1 , 2 , 3 ,]

Original: O r d e r : 1 O r d e r : 2 O r d e r :
Revised: O r d e r : 1 O r d e r : 2 O r d e r :

Original: O r d e r : 4 G r o un
Revised: O r d e r : 4 G r o un

Original: ( a )
Revised: ( a )

Original: D e n s e ob s e r v a ti on s .
Revised: D e n s e ob s e r v a ti on s .

Original: [Table]
Revised: [Table]

Original: T i m e 0 . 0 0 .
Revised: T i m e 0 . 0 0 .

Original: Intensity
Revised: Intensity

Original: P r o c e ss : [ 2 , 3 , 4 ]
Revised: P r o c e ss : [ 2 , 3 , 4 ]

Original: T i m e 0 . 

Revised: T i m e 0 .

Original: Intensity
Revised: Intensity

Original: P r o c e ss : [ 1 , 2 , 3 ,]
Revised: P r o c e ss : [ 1 , 2 , 3 ,]

Original: O r d e r : 1 O r d e r : 2 O r d e r :
Revised: O r d e r : 1 O r d e r : 2 O r d e r :

Original: O r d e r : 4 G r o un d
Revised: O r d e r : 4 G r o un d

Original: T r u t h ( a ) S p a r s e ob s e r v a ti on s .
Revised: T r u t h ( a ) S p a r s e ob s e r v a ti on s .

Original: F i gu r e 10 : I n t e n s it y f un c ti on o f h
Revised: F i gu r e 10 : I n t e n s it y f un c ti on o f h

Original: i gh e r d
Revised: i gh e r d

Original: i m e n s i on a l p r
Revised: i m e n s i on a l p r

Original: o ce ss e s .
Revised: o ce ss e s .

Original: D o t s r e p r e s e n t ob s e r v a ti on s .
Revised: D o t s r e p r e s e n t ob s e r v a ti on s .