Online network change point detection with missing values and temporal dependence
Haotian Xu, Paromita Dubey, Yi Yu

TL;DR
This paper introduces a novel online change point detection method for dynamic networks with missing data and temporal dependence, handling complex model parameters and dependencies.
Contribution
It proposes a polynomial time detection algorithm using soft-impute for imputation, addressing a previously unstudied general framework with rigorous theoretical guarantees.
Findings
Algorithm achieves sharp detection delay
Method maintains control over Type-I error
Numerical experiments show superior performance
Abstract
In this paper we study online change point detection in dynamic networks with time heterogeneous missing pattern within networks and dependence across the time course. The missingness probabilities, the entrywise sparsity of networks, the rank of networks and the jump size in terms of the Frobenius norm, are all allowed to vary as functions of the pre-change sample size. On top of a thorough handling of all the model parameters, we notably allow the edges and missingness to be dependent. To the best of our knowledge, such general framework has not been rigorously nor systematically studied before in the literature. We propose a polynomial time change point detection algorithm, with a version of soft-impute algorithm (e.g. Mazumder et al., 2010; Klopp, 2015) as the imputation sub-routine. Piecing up these standard sub-routines algorithms, we are able to solve a brand new problem with…
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.
Taxonomy
TopicsStatistical Methods and Inference · Advanced Causal Inference Techniques · Markov Chains and Monte Carlo Methods
