Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 47 min ago
PreprintCC BY-SA 4.0arXiv

Comment on Vogels et al.'s (2024) "Bayesian Structure Learning in Undirected Gaussian Graphical Models: Literature Review with Empirical Comparison": An updated performance check using BGGM

Abstract

Vogels et al. (2024) presented an empirical comparison of Bayesian methods for structure learning in undirected Gaussian graphical models. The method implemented in the R package BGGM was run with equal prior probabilities for a null, negative, and positive partial correlation, implying a prior inclusion probability (equivalent to a prior graph density) of 2/3. The other Bayesian methods in the comparison used a prior graph density of 0.2 however. The data-generating densities ranged from 0.01 to 0.1. This resulted in a substantial overestimation of the inclusion probabilities of absent edges by BGGM. For a fair comparison of the performance of the different methods, I repeated the simulation using a prior inclusion probability of 0.2 using BGGM. In this case, the performance of BGGM is comparable with the other Bayesian methods.

Related

  1. A Comparison Pogorelov Estimate for Graphical σk-Curvature Equations
    Jundong Zhou
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  2. Achievability of CSS codes performance limits over Pauli channels under separate ML decoding with bounded graphical complexity
    Gulnihal Mercanoglu, Achilleas Anastasopoulos, S. Sandeep Pradhan
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  3. Generalized Dirichlet Energy and Graph Laplacians for Clustering Directed and Undirected Graphs
    Harry Sevi, Gwendal Debaussart-Joniec, Malik Hacini +2
    Transactions on Machine Learning ResearchPeer-reviewedLicence not statedGeneral mathematicsHAL
  4. Errors of LLM-Assisted Literature Retrieval in Environmental Science: A Comparison Study of Abstract versus Full-text Based Prompts
    Yanjun Chen, Yongfeng Zhang, Lanjing Zhang
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
  5. Undirected edge geography games on stacked prism graphs
    Tharit Sereekiatdilok, Panupong Vichitkunakorn
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{mulder2026comment,
  title = {{Comment on Vogels et al.'s (2024) "Bayesian Structure Learning in Undirected Gaussian Graphical Models: Literature Review with Empirical Comparison": An updated performance check using BGGM}},
  author = {Joris Mulder},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.31969},
  eprint = {2609.31969},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.31969},
  note = {CC BY-SA 4.0},
}
RIS
TY  - UNPB
TI  - Comment on Vogels et al.'s (2024) "Bayesian Structure Learning in Undirected Gaussian Graphical Models: Literature Review with Empirical Comparison": An updated performance check using BGGM
AU  - Joris Mulder
PY  - 2026
DA  - 2026/09/25
PB  - arXiv
DO  - 10.48550/arxiv.2609.31969
UR  - https://arxiv.org/abs/2609.31969
AB  - Vogels et al. (2024) presented an empirical comparison of Bayesian methods for structure learning in undirected Gaussian graphical models. The method implemented in the R package BGGM was run with equal prior probabilities for a null, negative, and positive partial correlation, implying a prior inclusion probability (equivalent to a prior graph density) of 2/3. The other Bayesian methods in the comparison used a prior graph density of 0.2 however. The data-generating densities ranged from 0.01 to 0.1. This resulted in a substantial overestimation of the inclusion probabilities of absent edges by BGGM. For a fair comparison of the performance of the different methods, I repeated the simulation using a prior inclusion probability of 0.2 using BGGM. In this case, the performance of BGGM is comparable with the other Bayesian methods.
ER  -