The paper derives transductive generalization bounds for Lipschitz graph learners, including GCNs, on a single graph, with O(N^{-1/2}) rates in the number of labeled nodes.
Cambridge University Press, Cambridge, second edition, 2001
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
-
Learning from one graph: transductive learning guarantees via the geometry of small random worlds
The paper derives transductive generalization bounds for Lipschitz graph learners, including GCNs, on a single graph, with O(N^{-1/2}) rates in the number of labeled nodes.