- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper presents Bayesian matrix-weighted graph (BMWG), a framework that improve edge weight representation for multivariate graph nodes, by encoding it as an SPD rather than a scalar, which allows representation of conditional variable effects.
Critical strengths
- An expressive framework that goes beyond scalar representation in weighted edge to represent entire classes of SPD matrices
- A method of high relevance to multiple domains in graph theoretical applications Demonstrated insights in 2 use case applications
- Method rests on validated body of work in GGMs and robust sampling of SPD posteriors
Critical weaknesses
- Not clear if the method can scale up to many thousands of variables like in biology and that’s what determines real world usability
- A few passages are really hard to read for a human like “We claim no new SPD metric or generic MCMC method. Our contribution is their graph-specific synthesis into a posterior over matrix-weighted edges”, not sure who “their” referes to. Significant rewriting is needed to make it appealing to readers
- The cancer example is hardly relevant because it is only a 5-gene system, I would drop it for more expansive benchmarks against similar work such Multi-attribute GGMs, and Laplacian-constrained GGMs work
Questions for authors
- It is not clear how multivariate data enter the likelihood estimate. Do sample estimate collapse to a single number per covariate or per data point?
- How does runtime and how cost scales with nodes and d?
5 comments
Thanks for you work on this.
-
(runtime) I think a direct consequence of the runtime analysis would be to specify were the limit of the models are in terms of variable size which would help modelers for an application domain. Possibly including the complexity analysis in the main text.
-
(use case) Which follows directly from the previous comment is that a realistic cancer analysis with thousands of genes is then not feasible. I'd suggest for the author to consider removing the cancer use case application, because with 15 gene no meaningful insights can be gained.
Thank you for the follow-up.
-
Runtime limits: We agree and have stated the tested range explicitly. The complexity analysis is in the main text (Section 3, Computational cost), which now also gives the measured limits. The cost is driven by , the total number of node variables. On cycle graphs (two neighbors per node), our dense implementation on an Apple M3 MacBook Pro takes 7.5 ms per sampler step at and 20 ms at , and the full three-context workflow takes 29 and 81 minutes (Table 4, Appendix C.1). The largest size we tested is ; these results do not establish scalability beyond it. Because has the sparsity pattern of the graph, sparse Cholesky factorization is the natural route to larger problems.
-
Cancer use case: We agree that an analysis of 15 genes cannot establish meaningful biological findings or demonstrate scalability to genome-wide data. We therefore propose to move the TCGA analysis out of the main text and remove it from the abstract and contributions. A shortened version would remain in the appendix strictly as a methodological illustration, without biological claims: it is the only test of the fixed-map extension (Appendix A.6), where different nodes contain different variables, a case that Meteostat, whose nodes share aligned variables, does not cover. Would this address your concern? We would appreciate your perspective.
We will upload the revised PDF, including the runtime changes above, once we hear your view on the use case.
Response to Reviewer 9Qas
We thank the reviewer for the positive evaluation.
Q1 (how data enter the likelihood): Node features are never reduced to a single number before modeling. In the incidence model, each observation is the stacked vector Yr∈Rmd of all node features, the likelihood is Gaussian with precision Q(W)=R+∑eBeWeBe⊤, and it depends on the data through the md×md sample second moment (Section 3, Appendix A.1). Each edge contributes the term (yi−yj)⊤We(yi−yj)=∑k,l(We)kl(yi−yj)k(yi−yj)l. The term is a scalar, as every log-likelihood term is, but it weights every pair of variables through the full matrix We, whereas a scalar edge weight we would give only we∥yi−yj∥2, the same weight in every direction. In TCGA, the fixed edge-specific CCA maps yield scalar edge weights, but the Gaussian likelihood still acts on the 15-dimensional observation vector (Appendix A.6).
W1/Q2 (runtime): Appendix C.1 gives the dense per-evaluation cost O(p3+p2qd+qd3), where p=md and q=∣E∣, plus the cost of pairwise geometric comparisons. In 25 end-to-end experiments on cycle graphs with m∈{5,10,20,50,100} nodes, mean workflow time rises from 2.61 to 80.82 minutes and ESS per second falls from 175.07 to 2.03 as m grows from 5 to 100. All tested conditions pass the monitored convergence gates, but these experiments do not establish scalability to thousands of nodes or high-dimensional edge blocks. We have added hardware, software, and timing details. Since Q(W) has the sparsity pattern of the graph, sparse Cholesky factorization is the natural route, which we note in the Discussion.
W2 (readability): Thank you; "their" was ambiguous. We rewrote that passage and others in plain language and defined abbreviations at first use.
W3 (cancer example; benchmarks): The TCGA analysis uses 15 genes in five prespecified three-gene modules (ten module-pair edges), not 5 genes. It is a heterogeneous setting: each module contains different genes, so variables cannot be matched across nodes. The fixed-map extension (Appendix A.6) handles this case, and TCGA is the only study that exercises it, which is why we keep the example. Laplacian-constrained GGMs are the d=1 special case of BMWG (Proposition 1), and multi-attribute GGMs estimate a single context without a cross-context summary, so our empirical comparisons use methods designed to estimate and compare dependence structure across several contexts: fused graphical lasso, Bayesian multiple-GGM, and common principal components. Both families are now discussed in Section 2 and Table 3.
We hope these revisions address your concerns, and we would be glad to clarify anything further during the discussion period.