How robust are different versions of graphical model selection algorithms

DOI10.1007/S43069-025-00588-WMaRDI QIDQ6884944zbMATH OpenFDO

Authors Kostylev Ilya, Kalyagin Valeriy

Publication date 12 December 2025

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S43069-025-00588-W

zbMATH Keywords

graphical Lasso algorithmgraphical model selection algorithmsprobabilistic graphical modelrobustness of graphical model selection algorithmsuncertainty of graphical model selection algorithms

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Probabilistic graphical models (62H22)

Cites work

• A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
• A review of Gaussian Markov models for conditional independence
• Bayesian graphical Lasso models and efficient posterior computation
• Elliptical graphical modelling
• scientific article; zbMATH DE number 1964693 (Why is no real title available?)
• Least Median of Squares Regression
• Minimum covariance determinant and extensions
• Partial correlation estimation by joint sparse regression models
• Sparse inverse covariance estimation with the graphical lasso
• Statistical analysis of graph structures in random variable networks

This page was built for publication: How robust are different versions of graphical model selection algorithms

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