StateHPs: State Hawkes processes for Granger causal discovery from non-stationary event sequences
Year: 2025
Type: article
Abstract: Learning Granger causality from event sequences has important applications in various scenarios. Many methods have been developed based on Hawkes process with a stationarity assumption. However, these methods often fail in real-world scenarios due to violating the stationarity assumption, as an event sequence can be generated under different states at varying times. Although some work tries to model non-stationarity by searching for best segmentation, they still suffer from the lack of robustness and identification guarantee. An intuitive solution is to model the non-stationary generation process in a unified probabilistic generative framework. This presents two significant challenges: how to model the generation process considering both the stationarity of each subsequence and the non-stationarity among the subsequences, and how to identify the Granger causality. To address these challenges, we devise State Hawkes Processes (StateHPs). For the first challenge, StateHPs formulates the state assignments of each subsequence as a Dirichlet distribution and each state as a Hawkes process. For the second challenge, StateHPs introduces a variational Expectation-Maximization algorithm to identify the Granger causal graph. We also develop the identification theories for StateHPs. On real-world data, StateHPs achieves 35.5%, 33.9%, and 36.7% improvement among F1, Precision, and Recall metrics compared to the SOTA baselines.
Source: Information Sciences
Authors: Yuequn Liu, Guangdong Sun, Ruichu Cai, Zijian Li, Keli Zhang, Lujia Pan, Zhifeng Hao
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,200
Awards: G167464954, G2236945492, G8007181506
OpenAlex ID: W4411274088
