A Nonparametric Discrete Hawkes Model with a Collapsed Gaussian-Process Prior
Trinnhallen Brisley, Gordon Ross, Daniel Paulin
TL;DR
This work introduces GP-DHP, a scalable nonparametric model for discrete-time self-exciting count data that places Gaussian-process priors on both the baseline $b(t)$ and the excitation kernel $f(d)$. By collapsing these priors into a single latent Gaussian process over the additive intensity $\boldsymbol{\ell}$, the method enables efficient MAP inference with complexity $O(T\log T)$ and yields a closed-form projection to interpretable baseline and excitation components. Through synthetic experiments and two real-data case studies (U.S. terrorism and weekly Cryptosporidiosis counts), GP-DHP demonstrates accurate recovery of latent dynamics and improved predictive log-likelihood over standard parametric baselines, while maintaining interpretability via the decomposed components and a practical stability diagnostic. The approach advances discrete-time Hawkes modeling by offering flexible, data-adaptive baselines and excitations without compromising scalability, and it includes an open-source implementation for replication and reuse.
Abstract
Hawkes process models are used in settings where past events increase the likelihood of future events occurring. Many applications record events as counts on a regular grid, yet discrete-time Hawkes models remain comparatively underused and are often constrained by fixed-form baselines and excitation kernels. In particular, there is a lack of flexible, nonparametric treatments of both the baseline and the excitation in discrete time. To this end, we propose the Gaussian Process Discrete Hawkes Process (GP-DHP), a nonparametric framework that places Gaussian process priors on both the baseline and the excitation and performs inference through a collapsed latent representation. This yields smooth, data-adaptive structure without prespecifying trends, periodicities, or decay shapes, and enables maximum a posteriori (MAP) estimation with near-linear-time \(O(T\log T)\) complexity. A closed-form projection recovers interpretable baseline and excitation functions from the optimized latent trajectory. In simulations, GP-DHP recovers diverse excitation shapes and evolving baselines. In case studies on U.S. terrorism incidents and weekly Cryptosporidiosis counts, it improves test predictive log-likelihood over standard parametric discrete Hawkes baselines while capturing bursts, delays, and seasonal background variation. The results indicate that flexible discrete-time self-excitation can be achieved without sacrificing scalability or interpretability.
