Fused Gromov-Wasserstein Subgraph Contrastive Learning for Graph Representation

Monday 31 March 2025


In recent years, artificial intelligence has made tremendous progress in various fields, including computer vision and natural language processing. However, when it comes to machine learning on graphs, which are used to represent complex relationships between entities such as social networks or molecules, researchers have faced significant challenges.


One major issue is that traditional neural network architectures are not designed to handle the unique properties of graph data. Graphs can be highly irregular and contain cycles, making it difficult for models to learn meaningful representations from them.


A new approach called Fused Gromov-Wasserstein Subgraph Contrastive Learning (FOSSIL) has been developed to address this challenge. FOSSIL combines two powerful techniques: subgraph contrastive learning and the Fused Gromov-Wasserstein distance.


Subgraph contrastive learning is a type of self-supervised learning that involves creating positive and negative pairs of subgraphs from a larger graph. The goal is to train a model to distinguish between these pairs, which helps it learn to represent the graph in a meaningful way.


The Fused Gromov-Wasserstein distance is a mathematical concept that measures the similarity between two graphs by comparing their node features and structure. FOSSIL uses this distance to optimize its model’s parameters during training.


By combining these two techniques, FOSSIL can effectively learn graph representations that capture both local and global patterns in the data. This is achieved through a novel framework that incorporates both node-level and subgraph-level contrastive learning.


In experiments, FOSSIL outperformed several state-of-the-art methods on various benchmark datasets, including homophilic and heterophilic graphs. The results demonstrate the effectiveness of FOSSIL in capturing complex relationships between entities in graph data.


One notable aspect of FOSSIL is its ability to adapt to different types of graphs. By adjusting a single hyperparameter, researchers can tune the model’s focus on either node features or graph structure. This flexibility makes FOSSIL a valuable tool for analyzing and understanding diverse graph datasets.


Furthermore, FOSSIL has been tested on large-scale graphs with millions of edges, showcasing its scalability and potential to be used in real-world applications.


The development of FOSSIL is an important step forward in the field of machine learning on graphs. Its ability to effectively learn graph representations from complex data will likely have significant impacts on various domains, including social network analysis, molecular biology, and recommender systems.


Cite this article: “Fused Gromov-Wasserstein Subgraph Contrastive Learning for Graph Representation”, The Science Archive, 2025.


Artificial Intelligence, Machine Learning, Graph Data, Neural Networks, Computer Vision, Natural Language Processing, Fused Gromov-Wasserstein Distance, Subgraph Contrastive Learning, Fossil, Graph Representations


Reference: Amadou S. Sangare, Nicolas Dunou, Jhony H. Giraldo, Fragkiskos D. Malliaros, “A Fused Gromov-Wasserstein Approach to Subgraph Contrastive Learning” (2025).


Leave a Reply