TY - GEN
T1 - Causal Discovery in Hawkes Processes by Minimum Description Length
AU - Jalaldoust, Amirkasra
AU - Hlavácková-Schindler, Katerina
AU - Plant, Claudia
PY - 2022/6/28
Y1 - 2022/6/28
N2 - Hawkes processes are a special class of temporal point processes which exhibit a natural notion of causality, as occurrence of events in the past may increase the probability of events in the future. Discovery of the underlying influence network among the dimensions of multi-dimensional temporal processes is of high importance in disciplines where a high-frequency data is to model, e.g. in financial data or in seismological data. This paper approaches the problem of learning Granger-causal network in multi-dimensional Hawkes processes. We formulate this problem as a model selection task in which we follow the minimum description length (MDL) principle. Moreover, we propose a general algorithm for MDL-based inference using a Monte-Carlo method and we use it for our causal discovery problem. We compare our algorithm with the state-of-the-art baseline methods on synthetic and real-world financial data. The synthetic experiments demonstrate superiority of our method in causal graph discovery compared to the baseline methods with respect to the size of the data. The results of experiments with the G-7 bonds price data are consistent with the experts’ knowledge.
AB - Hawkes processes are a special class of temporal point processes which exhibit a natural notion of causality, as occurrence of events in the past may increase the probability of events in the future. Discovery of the underlying influence network among the dimensions of multi-dimensional temporal processes is of high importance in disciplines where a high-frequency data is to model, e.g. in financial data or in seismological data. This paper approaches the problem of learning Granger-causal network in multi-dimensional Hawkes processes. We formulate this problem as a model selection task in which we follow the minimum description length (MDL) principle. Moreover, we propose a general algorithm for MDL-based inference using a Monte-Carlo method and we use it for our causal discovery problem. We compare our algorithm with the state-of-the-art baseline methods on synthetic and real-world financial data. The synthetic experiments demonstrate superiority of our method in causal graph discovery compared to the baseline methods with respect to the size of the data. The results of experiments with the G-7 bonds price data are consistent with the experts’ knowledge.
U2 - 10.48550/arXiv.2206.06124
DO - 10.48550/arXiv.2206.06124
M3 - Contribution to proceedings
SN - 978-1-57735-876-3
SN - 1-57735-876-7
T3 - Proceedings of the ... National Conference on Artificial Intelligence
SP - 6978
EP - 6987
BT - Thirty-Sixth AAAI Conference on Artificial Intelligence; Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence; The Twelveth Symposium on Educational Advances in Artificial Intelligence
PB - AAAI Press
CY - Palo Alto, California
ER -