Graph data augmentation with Gromow-Wasserstein Barycenters (2404.08376v1)
Abstract: Graphs are ubiquitous in various fields, and deep learning methods have been successful applied in graph classification tasks. However, building large and diverse graph datasets for training can be expensive. While augmentation techniques exist for structured data like images or numerical data, the augmentation of graph data remains challenging. This is primarily due to the complex and non-Euclidean nature of graph data. In this paper, it has been proposed a novel augmentation strategy for graphs that operates in a non-Euclidean space. This approach leverages graphon estimation, which models the generative mechanism of networks sequences. Computational results demonstrate the effectiveness of the proposed augmentation framework in improving the performance of graph classification models. Additionally, using a non-Euclidean distance, specifically the Gromow-Wasserstein distance, results in better approximations of the graphon. This framework also provides a means to validate different graphon estimation approaches, particularly in real-world scenarios where the true graphon is unknown.
- Stochastic blockmodel approximation of a graphon: Theory and consistent estimation. Advances in Neural Information Processing Systems 26 (2013).
- Convergent sequences of dense graphs i: Subgraph frequencies, metric properties and testing. Advances in Mathematics 219, 6 (2008), 1801–1851.
- A consistent histogram estimator for exchangeable graph models. In International Conference on Machine Learning (2014), PMLR, pp. 208–216.
- Classification and estimation in the stochastic blockmodel based on the empirical degrees. Electronic Journal of Statistics 6 (2012), 2574–2601.
- Chatterjee, S. Matrix estimation by universal singular value thresholding. The Annals of Statistics 43, 1 (2015), 177–214.
- Generative diffusion models on graphs: Methods and applications. arXiv preprint arXiv:2302.02591 (2023).
- Quick approximation to matrices and applications. Combinatorica 19, 2 (1999), 175–220.
- Quasi-random words and limits of word sequences. European Journal of Combinatorics 98 (2021), 103403.
- G-mixup: Graph data augmentation for graph classification. In International Conference on Machine Learning (2022), PMLR, pp. 8230–8248.
- Training graph neural networks by graphon estimation. In 2021 IEEE International Conference on Big Data (Big Data) (2021), IEEE, pp. 5153–5162.
- Janson, S. Quasi-random graphs and graph limits. European Journal of Combinatorics 32, 7 (2011), 1054–1083.
- Score-based generative modeling of graphs via the system of stochastic differential equations. In International Conference on Machine Learning (2022), PMLR, pp. 10362–10383.
- Matrix completion from a few entries. IEEE transactions on information theory 56, 6 (2010), 2980–2998.
- Lovász, L. Large networks and graph limits, vol. 60. American Mathematical Soc., 2012.
- Limits of dense graph sequences. Journal of Combinatorial Theory, Series B 96, 6 (2006), 933–957.
- graph2vec: Learning distributed representations of graphs. arXiv preprint arXiv:1707.05005 (2017).
- Graphon neural networks and the transferability of graph neural networks. Advances in Neural Information Processing Systems 33 (2020), 1702–1712.
- Graphon signal processing. IEEE Transactions on Signal Processing 69 (2021), 4961–4976.
- Graphon and graph neural network stability. In ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2021), IEEE, pp. 5255–5259.
- Learning graphons via structured gromov-wasserstein barycenters. In Proceedings of the AAAI Conference on Artificial Intelligence (2021), vol. 35, pp. 10505–10513.
- Graph data augmentation for graph machine learning: A survey. arXiv preprint arXiv:2202.08871 (2022).
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
