Cumulative Hazard Function Based Efficient Multivariate Temporal Point Process Learning

Bingqing Liu
4/21/2024
cs.LGcs.AIstat.ML

Official code: lbq8942/NPP (1 star, last commit 2024-10-15).

Abstract

Most existing temporal point process models are characterized by conditional intensity function. These models often require numerical approximation methods for likelihood evaluation, which potentially hurts their performance. By directly modelling the integral of the intensity function, i.e., the cumulative hazard function (CHF), the likelihood can be evaluated accurately, making it a promising approach. However, existing CHF-based methods are not well-defined, i.e., the mathematical constraints of CHF are not completely satisfied, leading to untrustworthy results. For multivariate temporal point process, most existing methods model intensity (or density, etc.) functions for each variate, limiting the scalability. In this paper, we explore using neural networks to model a flexible but well-defined CHF and learning the multivariate temporal point process with low parameter complexity. Experimental results on six datasets show that the proposed model achieves the state-of-the-art performance on data fitting and event prediction tasks while having significantly fewer parameters and memory usage than the strong competitors. The source code and data can be obtained from https://github.com/lbq8942/NPP.

View on arXivView PDF

Code Implementations(1)

lbq8942/NPPOfficial100%

The source code for "Cumulative Hazard Function Based Efficient Multivariate Temporal Point Process Learning"

10PythonJun 1, 20232 years ago

Similar Papers

Cite this paper

@article{liu2024cumulative,
  title  = {Cumulative Hazard Function Based Efficient Multivariate Temporal Point Process Learning},
  author = {Bingqing Liu},
  year   = {2024},
  eprint = {2404.13663},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.13663v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.13663.svg)](https://codeofpaper.com/paper/2404.13663)

Discussion