SBM-style probabilistic models outperform graph neural networks on link prediction when node features are low-dimensional, noisy, or the graph is heterophilic.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
How do Probabilistic Graphical Models and Graph Neural Networks Look at Network Data?
SBM-style probabilistic models outperform graph neural networks on link prediction when node features are low-dimensional, noisy, or the graph is heterophilic.