Size-Invariant Graph Representations for Graph Classification Extrapolations
In general, graph representation learning methods assume that the train and test data come from the same distribution. In this work we consider an underexplored area of an otherwise rapidly developing field of graph representation learning: The task of out-of-distribution (OOD) graph classification, where train and test data have different distributions, with test data unavailable during training. Our work shows it is possible to use a causal model to learn approximately invariant representations that better extrapolate between train and test data. Finally, we conclude with synthetic and real-world dataset experiments showcasing the benefits of representations that are invariant to train/test distribution shifts.
Code (1)
Tasks
ClassificationGeneral ClassificationGraph ClassificationGraph Representation LearningRepresentation LearningSimilar Papers 제목 키워드 기반
Invariant embedding for graph classification
Learning on graphs requires a graph feature representation able to discriminate among different graphs while being amenable to fast computation. The graph isomorphism problem tells us that fast representation of graphs i…
ClassificationGeneral ClassificationGraph ClassificationGraph EmbeddingEnhancing Size Generalization in Graph Neural Networks through Disentangled Representation Learning
Although most graph neural networks (GNNs) can operate on graphs of any size, their classification performance often declines on graphs larger than those encountered during training. Existing methods insufficiently addre…
Representation LearningA Unified Invariant Learning Framework for Graph Classification
Invariant learning demonstrates substantial potential for enhancing the generalization of graph neural networks (GNNs) with out-of-distribution (OOD) data. It aims to recognize stable features in graph data for classific…
ClassificationGraph ClassificationGraph LearningLearning over Families of Sets -- Hypergraph Representation Learning for Higher Order Tasks
Graph representation learning has made major strides over the past decade. However, in many relational domains, the input data are not suited for simple graph representations as the relationships between entities go beyo…
Graph Representation Learninghyperedge classificationRepresentation LearningGraphProp: Training the Graph Foundation Models using Graph Properties
This work focuses on training graph foundation models (GFMs) that have strong generalization ability in graph-level tasks such as graph classification. Effective GFM training requires capturing information consistent acr…
Domain GeneralizationGraph ClassificationFew-Shot Learning