LGAPMEOct 19, 2021

An Empirical Study: Extensive Deep Temporal Point Process

arXiv:2110.09823v514 citations
Originality Incremental advance
AI Analysis

This work addresses the problem of improving event sequence modeling for researchers in machine learning, but it is incremental as it builds on existing deep temporal point process methods.

The paper tackles the challenge of modeling asynchronous event sequences using deep temporal point processes by reviewing and categorizing existing methods into four fields, and proposes a Granger causality discovery framework with latent graph learning to capture event relations, achieving improved fitting and predicting performance.

Temporal point process as the stochastic process on continuous domain of time is commonly used to model the asynchronous event sequence featuring with occurrence timestamps. Thanks to the strong expressivity of deep neural networks, they are emerging as a promising choice for capturing the patterns in asynchronous sequences, in the context of temporal point process. In this paper, we first review recent research emphasis and difficulties in modeling asynchronous event sequences with deep temporal point process, which can be concluded into four fields: encoding of history sequence, formulation of conditional intensity function, relational discovery of events and learning approaches for optimization. We introduce most of recently proposed models by dismantling them into the four parts, and conduct experiments by remodularizing the first three parts with the same learning strategy for a fair empirical evaluation. Besides, we extend the history encoders and conditional intensity function family, and propose a Granger causality discovery framework for exploiting the relations among multi-types of events. Because the Granger causality can be represented by the Granger causality graph, discrete graph structure learning in the framework of Variational Inference is employed to reveal latent structures of the graph. Further experiments show that the proposed framework with latent graph discovery can both capture the relations and achieve an improved fitting and predicting performance.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes