- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes a Gaussian Graphical Neural Networks which learns a sparse precision matrix J at each layer and computes the µ = J⁻¹h with Gaussian belief propagation. Three parameterizations (pairwise-normalizable, diagonally dominant, Laplacian) guarantee walk-summability and hence convergence. And experiments cover temperature imputation on USCRN (131 stations) and streamflow forecasting on LamaH-CE (608 gauges), where GGNN outperforms GCN-style baselines and is competitive with GraphGPS and Transformers.
Critical strengths
1.The method is well-motivated and somehow control the training memory.
2.The parameterizations guarantee convergent inference by construction.
3.The paper is clearly written and well organized, and includes useful analyses including an iteration-budget ablation and visualizations of the learned precision matrices.
Critical weaknesses
1.The baselines are not fair and completed .Without positional encodings, GCN, IGNN and GPR-GNN cannot distinguish nodes (MAE ≈ 8 on USCRN, worse than a graph-free Transformer). The no-PE gains may therefore reflect node-specific parameters rather than graphical inference. Only GCN-E has learnable edge weights. Established kriging and spatiotemporal baselines are missing (IGNNK, GRIN, Graph WaveNet, AGCRN), as is Deep GMRF.
2.The datasets is construct by the setting only in this paper. The USCRN graph and masks, and the LamaH-CE subset, inputs and horizons, are all defined by the authors. No result can be compared with published numbers. Prior work on LamaH-CE (Kirschstein & Sun, 2024) found that river topology does not help GNNs, but it is neither cited nor addressed.
3.The novelty of this paper is a little limited and the scalability of this method is not clear. Each layer is a linear filter J⁻¹ with learned edge weights, close to existing implicit and diffusion GNNs. The Gaussian semantics are unused: there is no uncertainty output. On graphs this small, a direct solver or conjugate gradient would only require positive definiteness, which calls the walk-summability machinery into question. Training is about 5.5× slower than GCN, and scalability beyond 608 nodes is not demonstrated.
Questions for authors
1.Could you evaluate on at least one established benchmark under its published protocol, e.g. METR-LA or PEMS-BAY kriging following IGNNK/GRIN, or LamaH-CE following Kirschstein & Sun (2024)?
2.The largest graph used has only 608 nodes. Could you test on a substantially larger graph, e.g. LargeST (~8.6k nodes), and report training time, memory, the number of GaBP iterations needed to converge, and accuracy against the baselines?