Laplacian Constrained Precision Matrix Estimation: Existence and High Dimensional Consistency
arXiv:2111.00590
Abstract
This paper considers the problem of estimating high dimensional Laplacian constrained precision matrices by minimizing Stein's loss. We obtain a necessary and sufficient condition for existence of this estimator, that consists on checking whether a certain data dependent graph is connected. We also prove consistency in the high dimensional setting under the symmetrized Stein loss. We show that the error rate does not depend on the graph sparsity, or other type of structure, and that Laplacian constraints are sufficient for high dimensional consistency. Our proofs exploit properties of graph Laplacians, the matrix tree theorem, and a characterization of the proposed estimator based on effective graph resistances. We validate our theoretical claims with numerical experiments.
arXiv commentThe 25th International Conference on Artificial Intelligence and Statistics (AISTATS) 2022
References in corpus (9)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Geometric deep learning: going beyond Euclidean data
- Learning graphs from data: A signal representation perspective
- Connecting the Dots: Identifying Network Structure via Graph Signal Processing
- Graph signal processing for machine learning: A review and new perspectives
- Geometry of maximum likelihood estimation in Gaussian graphical models
- Learning Graphs with Monotone Topology Properties and Multiple Connected Components
- Topology design for stochastically-forced consensus networks
- Covariance estimation with nonnegative partial correlations