AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Estimation of Sparse Gaussian Graphical Models with Hidden Clustering Structure

Meixia Lin, Defeng Sun, Kim-Chuan Toh, Chengjing Wang

JMLR 2024 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank approximation theory

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add l1 penalty on pairwise differences of precision entries (hidden clustering) (ablation)sparse Gaussian graphical model · AR(10) model, p = 5nAUC: 0.68224 -> 0.87663Improved
add l1 penalty on pairwise differences of precision entries (ablation)sparse Gaussian graphical model · Modular graph recovery, p = 0.5nAUC: 0.59601 -> 0.65797Improved
add l1 penalty on pairwise differences of precision entries (ablation)sparse Gaussian graphical model · Edge coloring model, p = 0.5nAUC: 0.76952 -> 0.9224Improved
add l1 penalty on pairwise differences of precision entries (ablation)sparse Gaussian graphical model · Edge coloring model, p = 50nAUC: 0.85703 -> 0.86017No clear effect
add exact AR(k=10) structure constraints (ablation)our unconstrained estimator · AR(10) model, p = 0.5nAUC: 0.76864 -> 1Improved
add AR(k=20) constraints with overestimated k (ablation)our unconstrained estimator · AR(10) model, p = 0.5nAUC: 0.76864 -> 0.96337Improved
add linear constraints for modular structure (ablation)our unconstrained estimator · Modular graph recovery, p = 10nAUC: 0.85913 -> 0.87068Improved
add linear constraints for modular structure (ablation)our unconstrained estimator · Modular graph recovery, p = 0.5nAUC: 0.65797 -> 0.67838Improved
use two-phase algorithm (sGS-ADMM then pALM) instead of stand-alone sGS-ADMMsolver for model (P) · AR models, n = 1000, 47971 constraints, rho = 0.1time: 00:05:00 limit hit -> 00:36:47Improved
use two-phase algorithm instead of stand-alone sGS-ADMMsolver for model (P) · Modular graph recovery, n = 1000, nG = 100, rho = 0.1time: 02:02:43 -> 00:13:05Improved
add pALM Phase II after sGS-ADMM Phase I (ablation)two-phase solver · modular graph recovery runtimetimeImproved
use proposed solvers instead of alternating linearization methodsolver · unconstrained model (2), large ntimeImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy