Cumulative Distribution Function based General Temporal Point Processes
Not on the map. Why?
Abstract (arXiv)
Temporal Point Processes (TPPs) hold a pivotal role in modeling event sequences across diverse domains, including social networking and e-commerce, and have significantly contributed to the advancement of recommendation systems and information retrieval strategies. Through the analysis of events such as user interactions and transactions, TPPs offer valuable insights into behavioral patterns, facilitating the prediction of future trends. However, accurately forecasting future events remains a formidable challenge due to the intricate nature of these patterns. The integration of Neural Networks with TPPs has ushered in the development of advanced deep TPP models. While these models excel at processing complex and nonlinear temporal data, they encounter limitations in modeling intensity functions, grapple with computational complexities in integral computations, and struggle to capture long-range temporal dependencies effectively. In this study, we introduce the CuFun model, representing a novel approach to TPPs that revolves around the Cumulative Distribution Function (CDF). CuFun stands out by uniquely employing a monotonic neural network for CDF representation, utilizing past events as a scaling factor. This innovation significantly bolsters the model's adaptability and precision across a wide range of data scenarios. Our approach addresses several critical issues inherent in traditional TPP modeling: it simplifies log-likelihood calculations, extends applicability beyond predefined density function forms, and adeptly captures long-range temporal patterns. Our contributions encompass the introduction of a pioneering CDF-based TPP model, the development of a methodology for incorporating past event information into future event prediction, and empirical validation of CuFun's effectiveness through extensive experimentation on synthetic and real-world datasets.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 16 of its 43 references that are in the map. First posted on arXiv 1 Feb 2024.
Builds on
16 of 43 references.
References · 16
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
- 2020Transformer Hawkes Processcited by 230
- 2022Transformer Neural Processes: Uncertainty-Aware Meta Learning Via Sequence Modelingcited by 126
- 2019Fully Neural Network based Model for General Temporal Point Processescited by 119
- 2021Neural Temporal Point Processes: A Reviewcited by 113
- 2017Wasserstein Learning of Deep Generative Point Process Modelscited by 46
- 2018Learning Temporal Point Processes via Reinforcement Learningcited by 40
- 2018Deep Reinforcement Learning of Marked Temporal Point Processescited by 32
- 2018Neural Likelihoods via Cumulative Distribution Functionscited by 25
- 2019Modeling Event Propagation via Graph Biased Temporal Point Processcited by 25
- 2019Deep Mixture Point Processes: Spatio-temporal Event Prediction with Rich Contextual Informationcited by 24
4 more
- 2023Meta Temporal Point Processescited by 16
- 2021VigDet: Knowledge Informed Neural Temporal Point Process for Coordination Detection on Social Mediacited by 14
- 2022Learning Temporal Point Processes for Efficient Retrieval of Continuous Time Event Sequencescited by 14
- 2016Distilling Information Reliability and Source Trustworthiness from Digital Tracescited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.