The proposed method estimates all partial correlations simultaneously within a unified optimization framework, thereby preserving symmetry and easing the pain of selecting the best models and improves graph recovery performance compared to existing approaches.
Abstract
Matrix graphical models aim to characterize conditional dependence structures in matrix-variate data under a separable covariance assumption. In this framework, the precision matrix is decomposed as a Kronecker product, enabling separate modeling of undirected graphs across row and column domains. Existing methods have been developed for this problem, including likelihood-based approaches and regression-based procedures for graph estimation. Likelihood-based methods estimate precision matrices directly and recover graph structures indirectly, whereas regression-based approaches directly target estimating edges among variables, thus outperforming the former. However, existing regression-based methods are based on multiple penalized regression problems, which naturally yields asymmetry in estimated graphs and computational difficulty in selecting tuning parameters. To address the limitations, we propose a joint estimation of partial correlations in matrix graphical models. The proposed method estimates all partial correlations simultaneously within a unified optimization framework, thereby preserving symmetry and easing the pain of selecting the best models. Numerical studies demonstrate that the proposed method improves graph recovery performance compared to existing approaches. We also analyze protein expression data collected from patients with pulmonary tuberculosis, measured repeatedly at multiple time points, where the proposed method compares protein networks between two groups of patients and recovers the temporal dependence structure.
We study causal discovery where each node is a random function. Previous studies on this topic rely on structural assumptions, e.g., linearity or non-linearity, and distributional assumptions, e.g., Gaussianity or non-Gaussianity. In contrast, we make use of covariance operators to avoid these assumptions. Under functi...
Gaussian graphical models (GGMs) describe the dependence structure among jointly Gaussian random variables. However, the most common parameterisation of GGMs, the precision matrix, describes both the dependence and scale of the variables. This has been shown to lead to model selection methods that depend on the scale o...
A nonparametric joint estimator based on blockmodel approximations is developed, which captures each layer's varying sparsity and connection structure, accounting for heterogeneity via shared latent variables across all layers, and enables high-resolution estimation even in sparser layers.
Mixed Graphical Models (MGMs) provide a flexible framework for structure learning from heterogeneous data by treating sets of both continuous and discrete. Bayesian inference for MGMs remains challenging due to the combinatorial complexity of graph space exploration and posterior computation. In this paper, we model di...
Er-Dong Guo, A. Beskos, M. D. De Iorio· 0 citations
In the analysis of multivariate data, factor models represent a powerful technique for both reducing dimensionality and facilitating qualitative understanding of the latent determinants governing the observed data. Interpretability, however, is often hindered by the non-identifiability of factor loading matrices due to...
Antonio Canale, Sylvia Fruhwirth-Schnatter· 0 citations
Estimating high dimensional Generalized Structural Equation Models presents severe computational challenges. Traditional simultaneous estimators frequently suffer from numerical instability and prohibitive computational costs. Moreover, there are no tractable algorithms for families such as Poisson, negative binomial,...
M. Hattab· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.