Robust Online Covariance and Sparse Precision Estimation Under Arbitrary Data Corruption
Not on the map. Why?
Abstract (arXiv)
Gaussian graphical models are widely used to represent correlations among entities but remain vulnerable to data corruption. In this work, we introduce a modified trimmed-inner-product algorithm to robustly estimate the covariance in an online scenario even in the presence of arbitrary and adversarial data attacks. At each time step, data points, drawn nominally independently and identically from a multivariate Gaussian distribution, arrive. However, a certain fraction of these points may have been arbitrarily corrupted. We propose an online algorithm to estimate the sparse inverse covariance (i.e., precision) matrix despite this corruption. We provide the error-bound and convergence properties of the estimates to the true precision matrix under our algorithms.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 30 references that are in the map. First posted on arXiv 16 Sep 2023.
Builds on
7 of 30 references.
References · 7
- 2019Mean estimation and regression under heavy-tailed distributions--a surveycited by 136
- 2017Network Inference via the Time-Varying Graphical Lassocited by 55
- 2020Outlier Robust Mean Estimation with Subgaussian Rates via Stabilitycited by 50
- 2013Node-Based Learning of Multiple Gaussian Graphical Modelscited by 26
- 2013Estimating Time-varying Brain Connectivity Networks from Functional MRI Time Seriescited by 11
- 2022Robust Online and Distributed Mean Estimation Under Adversarial Data Corruptioncited by 5
- 2014G-AMA: Sparse Gaussian graphical model estimation via alternating minimizationcited by 4
Built on by
Not cited yet.