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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective
Learning to Represent the Evolution of Dynamic Graphs with Recurrent Models
Permutation Equivariant Neural Controlled Differential Equations for Dynamic Graph Representation Learning
Disentangled representations of microscopy images
Studying and Improving Graph Neural Network-based Motif Estimation
Mini-Game Lifetime Value Prediction in WeChat
토론
이 논문과 연결된 포럼 글이 아직 없습니다.