Maximum likelihood estimation in Gaussian models under total positivity
Not on the map. Why?
Abstract (arXiv)
We analyze the problem of maximum likelihood estimation for Gaussian distributions that are multivariate totally positive of order two (MTP2). By exploiting connections to phylogenetics and single-linkage clustering, we give a simple proof that the maximum likelihood estimator (MLE) for such distributions exists based on at least 2 observations, irrespective of the underlying dimension. Slawski and Hein, who first proved this result, also provided empirical evidence showing that the MTP2 constraint serves as an implicit regularizer and leads to sparsity in the estimated inverse covariance matrix, determining what we name the ML graph. We show that we can find an upper bound for the ML graph by adding edges corresponding to correlations in excess of those explained by the maximum weight spanning forest of the correlation matrix. Moreover, we provide globally convergent coordinate descent algorithms for calculating the MLE under the MTP2 constraint which are structurally similar to iterative proportional scaling. We conclude the paper with a discussion of signed MTP2 distributions.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Feb 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 4; 2023: 2; 2024: 0; 2025: 3; 2026: 2.
14 papers.
Sort:
- 2021Fast Projected Newton-like Method for Precision Matrix Estimation under Total Positivitycited by 8
- 2022Learning Graphical Factor Models with Riemannian Optimizationcited by 8
- 2021Sparse Graph Learning Under Laplacian-Related Constraintscited by 5
- 2023Learning Large-Scale MTP2 Gaussian Graphical Models via Bridge-Block Decompositioncited by 5
- 2021Laplacian Constrained Precision Matrix Estimation: Existence and High Dimensional Consistencycited by 4
- 2023Network Topology Inference with Sparsity and Laplacian Constraintscited by 4
- 2022Learning with latent group sparsity via heat flow dynamics on networkscited by 2
- 2022Adaptive Estimation of Graphical Models under Total Positivitycited by 2
- 2025Leveraging Low-rank Factorizations of Conditional Correlation Matrices in Graph Learningcited 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
- 2025Learning Kronecker-Structured Graphs from Smooth Signalscited 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
- 2025Learning under Latent Group Sparsity via Diffusion on Networks20 Jul 2025
- 2025Leveraging Low-rank Factorizations of Conditional Correlation Matrices in Graph Learning12 Jun 2025
- 2025Learning Kronecker-Structured Graphs from Smooth Signals14 May 2025
- 2023Learning Large-Scale MTP2 Gaussian Graphical Models via Bridge-Block Decomposition23 Sep 2023
- 2023Network Topology Inference with Sparsity and Laplacian Constraints2 Sep 2023
- 2022Adaptive Estimation of Graphical Models under Total Positivity27 Oct 2022
- 2022Learning Graphical Factor Models with Riemannian Optimization21 Oct 2022
- 2022A note on incorrect inferences in non-binary qualitative probabilistic networks19 Aug 2022
- 2022Learning with latent group sparsity via heat flow dynamics on networks20 Jan 2022
- 2021Fast Projected Newton-like Method for Precision Matrix Estimation under Total Positivity3 Dec 2021
- 2021Fast Projected Newton-like Method for Precision Matrix Estimation under Total Positivitycited by 8
- 2022Learning Graphical Factor Models with Riemannian Optimizationcited by 8
- 2021Sparse Graph Learning Under Laplacian-Related Constraintscited by 5
- 2023Learning Large-Scale MTP2 Gaussian Graphical Models via Bridge-Block Decompositioncited by 5
- 2021Laplacian Constrained Precision Matrix Estimation: Existence and High Dimensional Consistencycited by 4
- 2023Network Topology Inference with Sparsity and Laplacian Constraintscited by 4
- 2022Learning with latent group sparsity via heat flow dynamics on networkscited by 2
- 2022Adaptive Estimation of Graphical Models under Total Positivitycited by 2
- 2025Leveraging Low-rank Factorizations of Conditional Correlation Matrices in Graph Learningcited 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
- 2025Learning Kronecker-Structured Graphs from Smooth Signalscited by 0
12 most cited of 14 All 14 (JSON)
- 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
- 2025Learning under Latent Group Sparsity via Diffusion on Networks20 Jul 2025
- 2025Leveraging Low-rank Factorizations of Conditional Correlation Matrices in Graph Learning12 Jun 2025
- 2025Learning Kronecker-Structured Graphs from Smooth Signals14 May 2025
- 2023Learning Large-Scale MTP2 Gaussian Graphical Models via Bridge-Block Decomposition23 Sep 2023
- 2023Network Topology Inference with Sparsity and Laplacian Constraints2 Sep 2023
- 2022Adaptive Estimation of Graphical Models under Total Positivity27 Oct 2022
- 2022Learning Graphical Factor Models with Riemannian Optimization21 Oct 2022
- 2022A note on incorrect inferences in non-binary qualitative probabilistic networks19 Aug 2022
- 2022Learning with latent group sparsity via heat flow dynamics on networks20 Jan 2022
- 2021Fast Projected Newton-like Method for Precision Matrix Estimation under Total Positivity3 Dec 2021
12 newest of 14 All 14 (JSON)