A graphon can be estimated in polynomial time by training an implicit neural representation to match empirical subgraph counts, and mixing graph moments in this space yields augmented graphs for classification.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Few Moments Please: Scalable Graphon Learning via Moment Matching
A graphon can be estimated in polynomial time by training an implicit neural representation to match empirical subgraph counts, and mixing graph moments in this space yields augmented graphs for classification.