Network Estimation from Point Process Data
Benjamin Mark, Garvesh Raskutti, Rebecca Willett

TL;DR
This paper develops a novel framework for estimating network structures from self-exciting point process data, incorporating non-linear effects, structural assumptions, and long-range dependencies, with theoretical guarantees and practical demonstrations.
Contribution
It introduces a comprehensive approach that models saturation, structural assumptions, and long-term memory in point processes, providing new theoretical bounds and practical algorithms.
Findings
The method ensures stability through saturation modeling.
It handles high-dimensional data with sparsity, group sparsity, and low-rank assumptions.
The approach is validated with simulations and real-world data.
Abstract
Consider observing a collection of discrete events within a network that reflect how network nodes influence one another. Such data are common in spike trains recorded from biological neural networks, interactions within a social network, and a variety of other settings. Data of this form may be modeled as self-exciting point processes, in which the likelihood of future events depends on the past events. This paper addresses the problem of estimating self-excitation parameters and inferring the underlying functional network structure from self-exciting point process data. Past work in this area was limited by strong assumptions which are addressed by the novel approach here. Specifically, in this paper we (1) incorporate saturation in a point process model which both ensures stability and models non-linear thresholding effects; (2) impose general low-dimensional structural assumptions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
