Learning High-dimensional Gaussian Graphical Models under Total Positivity without Adjustment of Tuning Parameters
Not on the map. Why?
Abstract (arXiv)
We consider the problem of estimating an undirected Gaussian graphical model when the underlying distribution is multivariate totally positive of order 2 (MTP2), a strong form of positive dependence. Such distributions are relevant for example for portfolio selection, since assets are usually positively dependent. A large body of methods have been proposed for learning undirected graphical models without the MTP2 constraint. A major limitation of these methods is that their structure recovery guarantees in the high-dimensional setting usually require a particular choice of a tuning parameter, which is unknown a priori in real world applications. We here propose a new method to estimate the underlying undirected graphical model under MTP2 and show that it is provably consistent in structure recovery without adjusting the tuning parameters. This is achieved by a constraint-based estimator that infers the structure of the underlying graphical model by testing the signs of the empirical partial correlation coefficients. We evaluate the performance of our estimator in simulations and on financial data.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 1; 2024: 0; 2025: 1; 2026: 2.
9 papers.
- 2021Fast Projected Newton-like Method for Precision Matrix Estimation under Total Positivitycited by 8
- 2021Sparse Graph Learning Under Laplacian-Related Constraintscited by 5
- 2022Adaptive Estimation of Graphical Models under Total Positivitycited by 2
- 2022Online Inference for Mixture Model of Streaming Graph Signals with Non-White Excitationcited by 1
- 2026Learning Gaussian Graphical Models under Total Positivity via Spectral Graph Sparsificationcited by 1
- 2022A note on incorrect inferences in non-binary qualitative probabilistic networkscited by 0
- 2023Inconsistency of cross-validation for structure learning in Gaussian graphical modelscited by 0
- 2025False Discovery Rate Control via Frequentist-assisted Horseshoecited by 0
- 2026Spectral Sparsification of Laplacian-Constrained Gaussian and H"usler-Reiss Graphical Modelscited by 0
- 2026Spectral Sparsification of Laplacian-Constrained Gaussian and H"usler-Reiss Graphical Models15 Jun 2026
- 2026Learning Gaussian Graphical Models under Total Positivity via Spectral Graph Sparsification16 May 2026
- 2025False Discovery Rate Control via Frequentist-assisted Horseshoe8 Feb 2025
- 2023Inconsistency of cross-validation for structure learning in Gaussian graphical models28 Dec 2023
- 2022Adaptive Estimation of Graphical Models under Total Positivity27 Oct 2022
- 2022A note on incorrect inferences in non-binary qualitative probabilistic networks19 Aug 2022
- 2022Online Inference for Mixture Model of Streaming Graph Signals with Non-White Excitation28 Jul 2022
- 2021Fast Projected Newton-like Method for Precision Matrix Estimation under Total Positivity3 Dec 2021
- 2021Sparse Graph Learning Under Laplacian-Related Constraints16 Nov 2021