Topology Only Pre-Training: Towards Generalised Multi-Domain Graph Models
Abstract: The principal benefit of unsupervised representation learning is that a pre-trained model can be fine-tuned where data or labels are scarce. Existing approaches for graph representation learning are domain specific, maintaining consistent node and edge features across the pre-training and target datasets. This has precluded transfer to multiple domains. We present Topology Only Pre-Training (ToP), a graph pre-training method based on node and edge feature exclusion. We show positive transfer on evaluation datasets from multiple domains, including domains not present in pre-training data, running directly contrary to assumptions made in contemporary works. On 75% of experiments, ToP models perform significantly $p \leq 0.01$ better than a supervised baseline. Performance is significantly positive on 85.7% of tasks when node and edge features are used in fine-tuning. We further show that out-of-domain topologies can produce more useful pre-training than in-domain. Under ToP we show better transfer from non-molecule pre-training, compared to molecule pre-training, on 79% of molecular benchmarks. Against the limited set of other generalist graph models ToP performs strongly, including against models with many orders of magnitude larger. These findings show that ToP opens broad areas of research in both transfer learning on scarcely populated graph domains and in graph foundation models.
- On the Opportunities and Risks of Foundation Models. arXiv Preprint 1, 1 (8 2021), 1–214. https://arxiv.org/abs/2108.07258v3
- Language Models are Few-Shot Learners. In Advances in Neural Information Processing Systems, H. Larochelle and M. Ranzato and R. Hadsell and M.F. Balcan and H. Lin (Ed.), Vol. 33. Curran Associates, Inc., 1877–1901. https://commoncrawl.org/the-data/
- Graph representation learning: A survey. , e15Â pages. https://doi.org/10.1017/ATSIP.2020.13
- CuCo: Graph Representation with Curriculum Contrastive Learning.. In IJCAI, Zhi-Hua Zhou (Ed.). International Joint Conferences on Artificial Intelligence Organization, 2300–2306.
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In NAACL HLT 2019 - 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies - Proceedings of the Conference, Vol. 1. Association for Computational Linguistics (ACL), 4171–4186. https://arxiv.org/abs/1810.04805v2
- P. Erdos and A. Renyi. 1960. On The Evolution Of Random Graphs. (1960).
- Benchmarking graph neural networks for materials chemistry. npj Computational Materials 7, 1 (6 2021), 1–8. https://doi.org/10.1038/s41524-021-00554-0
- On the Adversarial Robustness of Graph Contrastive Learning Methods. In NeurIPS 2023 Workshop: New Frontiers in Graph Learning.
- Negative sampling strategies for contrastive self-supervised learning of graph representations. Signal Processing 190 (2022), 108310.
- William L Hamilton. 2020. Graph Representation Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning 14, 3 (2020), 1–159.
- Representation Learning on Graphs: Methods and Applications. arXiv 1, 1 (9 2017), 1–24. http://arxiv.org/abs/1709.05584
- Kaveh Hassani and Amir Hosein Khasahmadi. 2020. Contrastive multi-view representation learning on graphs. International conference on machine learning 119, 1 (2020), 4116–4126.
- Strategies for Pre-training Graph Neural Networks. In Proceedings of the 8th International Conference on Learning Representations (ICLR). International Conference on Learning Representations, ICLR.
- A Survey on Graph Representation Learning Methods. arXiv 1, 1 (2022), arXiv:2204.01855. https://doi.org/10.48550/ARXIV.2204.01855
- Contrastive Representation Learning: A Framework and Review. IEEE Access 8 (2020), 193907–193934. https://doi.org/10.1109/ACCESS.2020.3031549
- Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics 6, 1 (1 2009), 29–123. https://doi.org/10.1080/15427951.2009.10129177
- Disentangled contrastive learning on graphs. Advances in Neural Information Processing Systems 34 (2021), 21872–21884.
- One for All: Towards Training One Graph Model for All Classification Tasks. arXiv Pre-Print (9 2023). http://arxiv.org/abs/2310.00149
- Towards Understanding the Transferability of Deep Representations. arXiv Pre-Print (9 2019). https://arxiv.org/abs/1909.12031v1
- Towards Graph Foundation Models: A Survey and Beyond. arXiv 1, 1 (10 2023), 1–35. http://arxiv.org/abs/2310.11829
- Automating the construction of internet portals with machine learning. Information Retrieval 3, 2 (2000), 127–163. https://doi.org/10.1023/A:1009953814988/METRICS
- Foundation and large language models: fundamentals, challenges, opportunities, and social impacts. Cluster Computing 27, 1 (2 2024), 1–26. https://doi.org/10.1007/s10586-023-04203-7
- High-Resolution Image Synthesis with Latent Diffusion Models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, New Orleans, 10684–10695. https://github.com/CompVis/latent-diffusion
- Multi-Scale attributed node embedding. Journal of Complex Networks 9, 2 (5 2021), 1–22. https://doi.org/10.1093/comnet/cnab014
- Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs. In CIKM ’20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management. ACM, Online, Ireland, 3125–3132. http://arxiv.org/abs/2003.04819
- Little Ball of Fur: A Python Library for Graph Sampling. In International Conference on Information and Knowledge Management, Proceedings. Association for Computing Machinery, Online, 3133–3140. https://doi.org/10.1145/3340531.3412758
- ImageNet Large Scale Visual Recognition Challenge. International Journal of Computer Vision 115, 3 (12 2015), 211–252. https://doi.org/10.1007/S11263-015-0816-Y/FIGURES/16
- Weisfeiler-Lehman Graph Kernels Nino Shervashidze Kurt Mehlhorn Karsten M. Borgwardt. Journal of Machine Learning Research 12, 1 (2011), 2539–2561.
- Pitfalls of Graph Neural Network Evaluation. arXiv Pre-Print (11 2018). http://arxiv.org/abs/1811.05868
- Evaluating Graph Generative Models with Contrastively Learned Features. In Advances in Neural Information Processing Systems, Vol. 35. New Orleans, 7783–7795. https://github.com/hamed1375/
- Adversarial Graph Augmentation to Improve Graph Contrastive Learning. In Advances in Neural Information Processing Systems, Vol. 34. 15920–15933. https://github.com/susheels/adgcl
- InternImage: Exploring Large-Scale Vision Foundation Models with Deformable Convolutions. In 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Vol. 2023-June. IEEE, 14408–14419. https://doi.org/10.1109/CVPR52729.2023.01385
- The connectome of an insect brain. Science 379, 6636 (3 2023). https://doi.org/10.1126/science.add9330
- MoleculeNet: A Benchmark for Molecular Machine Learning. Chemical Science 9, 2 (3 2017), 513–530. https://doi.org/10.1039/c7sc02664a
- Infogcl: Information-aware graph contrastive learning. Advances in Neural Information Processing Systems 34 (2021), 30414–30425.
- How powerful are graph neural networks?. In 7th International Conference on Learning Representations, ICLR 2019. International Conference on Learning Representations, ICLR.
- Graph contrastive learning with augmentations. Advances in neural information processing systems 33 (2020), 5812–5823.
- Graph Meets LLMs: Towards Large Graph Models. arXiv Preprint (8 2023). https://arxiv.org/abs/2308.14522v2
- Unsupervised Structure-Adaptive Graph Contrastive Learning. IEEE Transactions on Neural Networks and Learning Systems (2023). https://doi.org/10.1109/TNNLS.2023.3271140
- Graph neural networks: A review of methods and applications. AI Open 1 (1 2020), 57–81. https://doi.org/10.1016/J.AIOPEN.2021.01.001
- An empirical study of graph contrastive learning. arXiv preprint arXiv:2109.01116 (2021).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.