TY - JOUR
T1 - Hawkes processes with stochastic exogenous effects for continuous-time interaction modelling
AU - Fan, Xuhui
AU - Li, Yaqiong
AU - Chen, Ling
AU - Li, Bin
AU - Sisson, Scott A.
PY - 2023/2
Y1 - 2023/2
N2 - Continuous-time interaction data is usually generated under time-evolving environment. Hawkes processes (HP) are commonly used mechanisms for the analysis of such data. However, typical model implementations (such as e.g., stochastic block models) assume that the exogenous (background) interaction rate is constant, and so they are limited in their ability to adequately describe any complex time-evolution in the background rate of a process. In this paper, we introduce a stochastic exogenous rate Hawkes process (SE-HP) which is able to learn time variations in the exogenous rate. The model affiliates each node with a piecewise-constant membership distribution with an unknown number of changepoint locations, and allows these distributions to be related to the membership distributions of interacting nodes. The time-varying background rate function is derived through combinations of these membership functions. We introduce a stochastic gradient MCMC algorithm for efficient, scalable inference. The performance of the SE-HP is explored on real world, continuous-time interaction datasets, where we demonstrate that the SE-HP strongly outperforms comparable state-of-the-art methods.
AB - Continuous-time interaction data is usually generated under time-evolving environment. Hawkes processes (HP) are commonly used mechanisms for the analysis of such data. However, typical model implementations (such as e.g., stochastic block models) assume that the exogenous (background) interaction rate is constant, and so they are limited in their ability to adequately describe any complex time-evolution in the background rate of a process. In this paper, we introduce a stochastic exogenous rate Hawkes process (SE-HP) which is able to learn time variations in the exogenous rate. The model affiliates each node with a piecewise-constant membership distribution with an unknown number of changepoint locations, and allows these distributions to be related to the membership distributions of interacting nodes. The time-varying background rate function is derived through combinations of these membership functions. We introduce a stochastic gradient MCMC algorithm for efficient, scalable inference. The performance of the SE-HP is explored on real world, continuous-time interaction datasets, where we demonstrate that the SE-HP strongly outperforms comparable state-of-the-art methods.
UR - http://www.scopus.com/inward/record.url?scp=85127064295&partnerID=8YFLogxK
UR - http://purl.org/au-research/grants/arc/CE140100049
UR - http://purl.org/au-research/grants/arc/FT170100079
UR - http://purl.org/au-research/grants/arc/DP210101347
U2 - 10.1109/TPAMI.2022.3161649
DO - 10.1109/TPAMI.2022.3161649
M3 - Article
C2 - 35320087
SN - 0162-8828
VL - 45
SP - 1848
EP - 1861
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
JF - IEEE Transactions on Pattern Analysis and Machine Intelligence
IS - 2
ER -