mlsanityData to 7 Oct 2026

Hawkes Processes on Graphons

arXiv 2102.02741 ↗First posted 4 Feb 2021cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose a novel framework for modeling multiple multivariate point processes, each with heterogeneous event types that share an underlying space and obey the same generative mechanism. Focusing on Hawkes processes and their variants that are associated with Granger causality graphs, our model leverages an uncountable event type space and samples the graphs with different sizes from a nonparametric model called it graphon. Given those graphs, we can generate the corresponding Hawkes processes and simulate event sequences. Learning this graphon-based Hawkes process model helps to 1) infer the underlying relations shared by different Hawkes processes; and 2) simulate event sequences with different event types but similar dynamics. We learn the proposed model by minimizing the hierarchical optimal transport distance between the generated event sequences and the observed ones, leading to a novel reward-augmented maximum likelihood estimation method. We analyze the properties of our model in-depth and demonstrate its rationality and effectiveness in both theory and experiments.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 30 of its 62 references that are in the map. First posted on arXiv 4 Feb 2021.

Builds on

30 of 62 references.

References · 30

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2018Computational Optimal Transportcited by 765
  3. 2017Wasserstein GANcited by 635
  4. 2020Transformer Hawkes Processcited by 230
  5. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  6. 2019Gromov-Wasserstein Learning for Graph Matching and Node Embeddingcited by 125
  7. 2018Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical propertiescited by 93
  8. 2016Reward Augmented Maximum Likelihood for Neural Structured Predictioncited by 80
  9. 2015SEISMIC: A Self-Exciting Point Process Model for Predicting Tweet Popularitycited by 76
  10. 2016Learning Granger Causality for Hawkes Processescited by 68
  11. 2019Hierarchical Optimal Transport for Document Representationcited by 53
  12. 2017Wasserstein Learning of Deep Generative Point Process Modelscited by 46
18 more
  1. 2018Learning Temporal Point Processes via Reinforcement Learningcited by 40
  2. 2013Stochastic blockmodel approximation of a graphon: Theory and consistent estimationcited by 38
  3. 2019Hierarchical Optimal Transport for Multimodal Distribution Alignmentcited by 38
  4. 2015COEVOLVE: A Joint Point Process Model for Information Diffusion and Network Co-evolutioncited by 37
  5. 2014A Consistent Histogram Estimator for Exchangeable Graph Modelscited by 36
  6. 2020Learning Graphons via Structured Gromov-Wasserstein Barycenterscited by 36
  7. 2018Sliced-Wasserstein Autoencoder: An Embarrassingly Simple Generative Modelcited by 33
  8. 2017Rates of Convergence of Spectral Methods for Graphon Estimationcited by 28
  9. 2020Noise-Contrastive Estimation for Multivariate Point Processescited by 20
  10. 2013Bregman Alternating Direction Method of Multiplierscited by 19
  11. 2018Neural Granger Causalitycited by 19
  12. 2017Learning from Clinical Judgments: Semi-Markov-Modulated Marked Hawkes Processes for Risk Prognosiscited by 18
  13. 2017A Dirichlet Mixture Model of Hawkes Processes for Event Sequence Clusteringcited by 16
  14. 2018Graphon Control of Large-scale Networks of Linear Systemscited by 11
  15. 2017Learning Hawkes Processes from Short Doubly-Censored Event Sequencescited by 6
  16. 2016Patient Flow Prediction via Discriminative Learning of Mutually-Correcting Processescited by 4
  17. 2017Learning Registered Point Processes from Idiosyncratic Observationscited by 3
  18. 2019Fused Gromov-Wasserstein Alignment for Hawkes Processescited by 1

Built on by

Not cited yet.