基于Inlabru的贝叶斯霍克斯过程模型近似
Approximation of bayesian Hawkes process models with Inlabru
AI总结:
本文提出基于R包inlabru的霍克斯过程参数近似贝叶斯推断方法,通过分解对数似然并线性近似实现确定性后验,相比MCMC方法快2-10倍且结果相似。
摘要:
霍克斯过程是用于建模具有自激发或自校正行为现象的非常流行的数学工具。典型例子包括地震发生、野火、干旱、捕获-再捕获、犯罪暴力、贸易交换和社交网络活动。霍克斯过程在不同领域的广泛使用,要求有快速、可复现、可靠且易于编码的技术来实现此类模型。我们提出了一种基于R包inlabru的霍克斯过程参数近似贝叶斯推断技术。inlabru R包又依赖于INLA方法来近似参数的后验分布。我们的霍克斯过程近似基于对数似然分解为三个部分,并分别进行线性近似。线性近似是相对于参数后验分布的众数进行的,该众数通过迭代梯度法确定。因此,参数后验的近似是确定性的,确保了结果的完全可复现性。所提出的技术仅要求用户提供计算分解似然不同部分的函数,这些函数由R包inlabru在内部进行线性近似。我们与基于MCMC方法的bayesianETAS R包进行了比较。两种技术提供了相似的结果,但我们的方法收敛所需的计算时间少两到十倍,具体取决于数据量。
英文摘要:
Hawkes process are very popular mathematical tools for modelling phenomena exhibiting a \textit{self-exciting} or \textit{self-correcting} behaviour. Typical examples are earthquakes occurrence, wild-fires, drought, capture-recapture, crime violence, trade exchange, and social network activity. The widespread use of Hawkes process in different fields calls for fast, reproducible, reliable, easy-to-code techniques to implement such models. We offer a technique to perform approximate Bayesian inference of Hawkes process parameters based on the use of the R-package \inlabru. The \inlabru R-package, in turn, relies on the INLA methodology to approximate the posterior of the parameters. Our Hawkes process approximation is based on a decomposition of the log-likelihood in three parts, which are linearly approximated separately. The linear approximation is performed with respect to the mode of the parameters' posterior distribution, which is determined with an iterative gradient-based method. The approximation of the posterior parameters is therefore deterministic, ensuring full reproducibility of the results. The proposed technique only requires the user to provide the functions to calculate the different parts of the decomposed likelihood, which are internally linearly approximated by the R-package \inlabru. We provide a comparison with the \bayesianETAS R-package which is based on an MCMC method. The two techniques provide similar results but our approach requires two to ten times less computational time to converge, depending on the amount of data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。