mlsanityData to 7 Oct 2026

Implicit Graphon Neural Representation

arXiv 2211.03329 ↗First posted 7 Nov 2022cs.LGcited by 18

Not on the map. Why?

Abstract (arXiv)

Graphons are general and powerful models for generating graphs of varying size. In this paper, we propose to directly model graphons using neural networks, obtaining Implicit Graphon Neural Representation (IGNR). Existing work in modeling and reconstructing graphons often approximates a target graphon by a fixed resolution piece-wise constant representation. Our IGNR has the benefit that it can represent graphons up to arbitrary resolutions, and enables natural and efficient generation of arbitrary sized graphs with desired structure once the model is learned. Furthermore, we allow the input graph data to be unaligned and have different sizes by leveraging the Gromov-Wasserstein distance. We first demonstrate the effectiveness of our model by showing its superior performance on a graphon learning task. We then propose an extension of IGNR that can be incorporated into an auto-encoder framework, and demonstrate its good performance under a more general setting of graphon learning. We also show that our model is suitable for graph representation learning and graph generation.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). Builds on 28 of its 55 references that are in the map. First posted on arXiv 7 Nov 2022.

Builds on

28 of 55 references.

References · 28

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2022Generative Adversarial Networkscited by 5,603
  3. 2018How Powerful are Graph Neural Networks?cited by 4,355
  4. 2013Auto-Encoding Variational Bayescited by 3,980
  5. 2019DeepSDF: Learning Continuous Signed Distance Functions for Shape Representationcited by 2,682
  6. 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
  7. 2016Variational Graph Auto-Encoderscited by 1,373
  8. 2018Learning Implicit Fields for Generative Shape Modelingcited by 1,060
  9. 2016HyperNetworkscited by 1,003
  10. 2018AtlasNet: A Papier-Mach'e Approach to Learning 3D Surface Generationcited by 539
  11. 2018GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoderscited by 375
  12. 2015Learning with a Wasserstein Losscited by 194
16 more
  1. 2018Optimal Transport for structured data with application on graphscited by 170
  2. 2021Modulated Periodic Activations for Generalizable Local Functional Representationscited by 140
  3. 2019Gromov-Wasserstein Learning for Graph Matching and Node Embeddingcited by 125
  4. 2020Graphon Neural Networks and the Transferability of Graph Neural Networkscited by 117
  5. 2019Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matchingcited by 102
  6. 2013Stochastic blockmodel approximation of a graphon: Theory and consistent estimationcited by 38
  7. 2020Graphon Signal Processingcited by 37
  8. 2021Online Graph Dictionary Learningcited by 37
  9. 2014A Consistent Histogram Estimator for Exchangeable Graph Modelscited by 36
  10. 2020Learning Graphons via Structured Gromov-Wasserstein Barycenterscited by 36
  11. 2017Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learningcited by 34
  12. 2019Gromov-Wasserstein Factorization Models for Graph Clusteringcited by 25
  13. 2022Learning to Predict Graphs with Fused Gromov-Wasserstein Barycenterscited by 22
  14. 2017The Geometry of Continuous Latent Space Models for Network Datacited by 11
  15. 2016Graphons, mergeons, and so on!cited by 10
  16. 2021Learning Graphon Autoencoders for Generative Graph Modelingcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 3; 2025: 9; 2026: 4.

18 papers.

Sort:

By area: