mlsanityData to 14 Oct 2026

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

arXiv 2303.16796 ↗First posted 29 Mar 2023physics.data-an cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Inferring relations from correlational data allows researchers across the sciences to uncover complex connections between variables for insights into the underlying mechanisms. The researchers often represent inferred relations using Gaussian graphical models, requiring regularization to sparsify the models. Acknowledging that the modular structure of the inferred network is often studied, we suggest module-based regularization to balance under- and overfitting. Compared with the graphical lasso, a standard approach using the Gaussian log-likelihood for estimating the regularization strength, this approach better recovers and infers modular structure in noisy synthetic and real data. The module-based regularization technique improves the usefulness of Gaussian graphical models in the many applications where they are employed.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 38 references that are in the map. First posted on arXiv 29 Mar 2023.

Builds on

7 of 38 references.

References · 7

  1. 2019A Unified Framework for Structured Graph Learning via Spectral Constraintscited by 53
  2. 2019Network reconstruction and community detection from dynamicscited by 13
  3. 2016Estimating Psychological Networks and their Accuracy: A Tutorial Papercited by 12
  4. 2017Mapping higher-order network flows in memory and multilayer networks with Infomapcited by 10
  5. 2013The Cluster Graphical Lasso for improved estimation of Gaussian graphical modelscited by 5
  6. 2013Exploring the limits of community detection strategies in complex networkscited by 4
  7. 2019Exploring the solution landscape enables more reliable network community detectioncited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.