Module-based regularization improves Gaussian graphical models when observing noisy data

03/29/2023
by   Magnus Neuman, et al.
0

Researchers often represent relations in multi-variate correlational data using Gaussian graphical models, which require regularization to sparsify the models. Acknowledging that they often study the modular structure of the inferred network, we suggest integrating it in the cross-validation of the regularization strength to balance under- and overfitting. Using synthetic and real data, we show that this approach allows us to better recover and infer modular structure in noisy data compared with the graphical lasso, a standard approach using the Gaussian log-likelihood when cross-validating the regularization strength.

READ FULL TEXT
research
12/02/2021

Optimal regularizations for data generation with probabilistic graphical models

Understanding the role of regularization is a central question in Statis...
research
04/08/2022

Robustly fitting Gaussian graphical models: the R-package robFitConGraph

The paper gives a tutorial-style introduction to the R-package robFitCon...
research
08/11/2021

Bayesian functional graphical models

We develop a Bayesian graphical modeling framework for functional data f...
research
05/01/2020

Thresholded Adaptive Validation: Tuning the Graphical Lasso for Graph Recovery

The graphical lasso is the most popular estimator in Gaussian graphical ...
research
06/17/2020

Efficient Statistics for Sparse Graphical Models from Truncated Samples

In this paper, we study high-dimensional estimation from truncated sampl...
research
10/19/2018

AdaPtive Noisy Data Augmentation (PANDA) for Simultaneous Construction Multiple Graph Models

We extend the data augmentation technique (PANDA) by Li et al. (2018) fo...

Please sign up or login with your details

Forgot password? Click here to reset