High-dimensional inference for cluster-based graphical models

zbMATH Open1498.62113arXiv1806.05139MaRDI QIDQ4969100FDOQ4969100

Authors: Carson Eisenach, Florentina Bunea, Yang Ning, Claudiu Dinicu 

Publication date: 5 October 2020

Abstract: Motivated by modern applications in which one constructs graphical models based on a very large number of features, this paper introduces a new class of cluster-based graphical models, in which variable clustering is applied as an initial step for reducing the dimension of the feature space. We employ model assisted clustering, in which the clusters contain features that are similar to the same unobserved latent variable. Two different cluster-based Gaussian graphical models are considered: the latent variable graph, corresponding to the graphical model associated with the unobserved latent variables, and the cluster-average graph, corresponding to the vector of features averaged over clusters. Our study reveals that likelihood based inference for the latent graph, not analyzed previously, is analytically intractable. Our main contribution is the development and analysis of alternative estimation and inference strategies, for the precision matrix of an unobservable latent vector $Z$. We replace the likelihood of the data by an appropriate class of empirical risk functions, that can be specialized to the latent graphical model and to the simpler, but under-analyzed, cluster-average graphical model. The estimators thus derived can be used for inference on the graph structure, for instance on edge strength or pattern recovery. Inference is based on the asymptotic limits of the entry-wise estimates of the precision matrices associated with the conditional independence graphs under consideration. While taking the uncertainty induced by the clustering step into account, we establish Berry-Esseen central limit theorems for the proposed estimators. It is noteworthy that, although the clusters are estimated adaptively from the data, the central limit theorems regarding the entries of the estimated graphs are proved under the same conditions one would use if the clusters were known....

Full work available at URL: https://arxiv.org/abs/1806.05139

Recommendations

• The cluster graphical Lasso for improved estimation of Gaussian graphical models
• scientific article; zbMATH DE number 7255095
• Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
• Inferring sparse Gaussian graphical models with latent structure
• Graphical model selection with latent variables

zbMATH Keywords

clusteringfalse discovery ratehigh-dimensional inferenceBerry-Esseen boundlatent variablesgraphical model

Mathematics Subject Classification ID

Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Cites Work

• ROCKET: robust confidence intervals via Kendall's tau for transelliptical graphical models
• Confidence intervals for high-dimensional inverse covariance estimation
• Asymptotic normality and optimalities in estimation of large Gaussian graphical models
• Honest confidence regions and optimality in high-dimensional precision matrix estimation
• Gaussian graphical model estimation with false discovery rate control
• Asymptotic Statistics
• Conditional-mean least-squares fitting of Gaussian Markov random fields to Gaussian fields
• High-dimensional semiparametric Gaussian copula graphical models
• Confidence intervals for high-dimensional linear regression: minimax rates and adaptivity
• High-dimensional graphs and variable selection with the Lasso
• Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
• Title not available (Why is that?)
• Confidence Intervals for Low Dimensional Parameters in High Dimensional Linear Models
• Regularized rank-based estimation of high-dimensional nonparanormal graphical models
• Sparsistency and rates of convergence in large covariance matrix estimation
• Sparse inverse covariance estimation with the graphical lasso
• The control of the false discovery rate in multiple testing under dependency.
• Sparse permutation invariant covariance estimation
• A significance test for the lasso
• Exact post-selection inference, with application to the Lasso
• Model selection and estimation in the Gaussian graphical model
• Title not available (Why is that?)
• Partial correlation estimation by joint sparse regression models
• High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
• High dimensional inverse covariance matrix estimation via linear programming
• Sparse matrix inversion with scaled Lasso
• A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
• High dimensional semiparametric latent graphical model for mixed data
• Estimating sparse precision matrix: optimal rates of convergence and adaptive estimation
• A general theory of hypothesis tests and confidence regions for sparse high dimensional models
• One-Step Huber Estimates in the Linear Model
• Consistent covariate selection and post model selection inference in semiparametric regression.
• High-dimensional semiparametric bigraphical models
• A likelihood ratio framework for high-dimensional semiparametric regression
• Testing and Confidence Intervals for High Dimensional Proportional Hazards Models
• Title not available (Why is that?)
• A unified theory of confidence regions and testing for high-dimensional estimating equations
• Replicates in high dimensions, with applications to latent variable graphical models
• Model assisted variable clustering: minimax-optimal recovery and algorithms
• Efficient, certifiably optimal clustering with applications to latent variable graphical models
• On semiparametric exponential family graphical models

Cited In (8)

• Combinatorial inference for graphical models
• The cluster graphical Lasso for improved estimation of Gaussian graphical models
• StarTrek: combinatorial variable selection with false discovery rate control
• The huge Package for High-dimensional Undirected Graph Estimation in R
• Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
• Finding Non-Overlapping Clusters for Generalized Inference Over Graphical Models
• Identifying graph clusters using variational inference and links to covariance parametrization
• Diffuse Interface Models on Graphs for Classification of High Dimensional Data

Uses Software

• ROCKET

This page was built for publication: High-dimensional inference for cluster-based graphical models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969100)