Online Bayesian Node Classification on Inductive Graphs under Distribution Shift
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2607. 25376v1 Announce Type: cross Abstract: In Bayesian neural networks (BNNs), variational inference is a widely adopted framework for modeling uncertainty in a distributional way, with the evidence lower bound (ELBO) serving as the standard objective function.
arXiv:2605. 08446v3 Announce Type: replace Abstract: Bayesian neural networks are typically trained against the evidence lower bound (ELBO), whose Jensen gap closes only when the variational posterior is exact.
SiST‑GNN introduces a simultaneous spatial‑temporal message‑passing framework for dynamic graph neural networks, fusing per‑node temporal embeddings with spatial aggregation in a single operation. By maintaining a recurrent hidden state per node and treating it as a cross‑time edge, the model jointly reasons over topology and evolution. Experiments on link‑prediction and node‑classification benchmarks show significant improvements over prior methods, achieving up to 158% gains in live‑update link prediction and outperforming discrete‑time baselines by 7–23% in dynamic node classification.
arXiv:2607. 24583v1 Announce Type: new Abstract: Large scale Bayesian nonparametrics (BNP) learner such as Stochastic Variational Inference (SVI) can handle datasets with large class number and large training size at fractional cost.
arXiv:2609. 19210v1 Announce Type: cross Abstract: Graph neural networks are widely used for transductive node classification, with accuracy typically measured on randomly drawn train/validation/test splits.
arXiv:2607. 10804v1 Announce Type: new Abstract: Graph neural networks (GNNs) are increasingly deployed in real-world applications where distribution shift is un-avoidable.