Structural Re-weighting Improves Graph Domain Adaptation
- URL: http://arxiv.org/abs/2306.03221v1
- Date: Mon, 5 Jun 2023 20:11:30 GMT
- Title: Structural Re-weighting Improves Graph Domain Adaptation
- Authors: Shikun Liu, Tianchun Li, Yongbin Feng, Nhan Tran, Han Zhao, Qiu Qiang,
Pan Li
- Abstract summary: This work examines different impacts of distribution shifts caused by either graph structure or node attributes.
A novel approach, called structural reweighting (StruRW), is proposed to address this issue and is tested on synthetic graphs, four benchmark datasets, and a new application in high energy physics.
- Score: 13.019371337183202
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In many real-world applications, graph-structured data used for training and
testing have differences in distribution, such as in high energy physics (HEP)
where simulation data used for training may not match real experiments. Graph
domain adaptation (GDA) is a method used to address these differences. However,
current GDA primarily works by aligning the distributions of node
representations output by a single graph neural network encoder shared across
the training and testing domains, which may often yield sub-optimal solutions.
This work examines different impacts of distribution shifts caused by either
graph structure or node attributes and identifies a new type of shift, named
conditional structure shift (CSS), which current GDA approaches are provably
sub-optimal to deal with. A novel approach, called structural reweighting
(StruRW), is proposed to address this issue and is tested on synthetic graphs,
four benchmark datasets, and a new application in HEP. StruRW has shown
significant performance improvement over the baselines in the settings with
large graph structure shifts, and reasonable performance improvement when node
attribute shift dominates.
Related papers
- AdaRC: Mitigating Graph Structure Shifts during Test-Time [66.40525136929398]
Test-time adaptation (TTA) has attracted attention due to its ability to adapt a pre-trained model to a target domain without re-accessing the source domain.
We propose AdaRC, an innovative framework designed for effective and efficient adaptation to structure shifts in graphs.
arXiv Detail & Related papers (2024-10-09T15:15:40Z) - Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation [31.106636947179005]
Unsupervised Graph Domain Adaptation involves the transfer of knowledge from a label-rich source graph to an unlabeled target graph.
We present the first comprehensive benchmark for unsupervised graph domain adaptation named GDABench.
We observe that the performance of current UGDA models varies significantly across different datasets and adaptation scenarios.
arXiv Detail & Related papers (2024-07-09T06:44:09Z) - A Pure Transformer Pretraining Framework on Text-attributed Graphs [50.833130854272774]
We introduce a feature-centric pretraining perspective by treating graph structure as a prior.
Our framework, Graph Sequence Pretraining with Transformer (GSPT), samples node contexts through random walks.
GSPT can be easily adapted to both node classification and link prediction, demonstrating promising empirical success on various datasets.
arXiv Detail & Related papers (2024-06-19T22:30:08Z) - Topology-Aware Dynamic Reweighting for Distribution Shifts on Graph [24.44321658238713]
Graph Neural Networks (GNNs) are widely used for node classification tasks but often fail to generalize when training and test nodes come from different distributions.
We introduce the Topology-Aware Dynamic Reweighting (TAR) framework, which dynamically adjusts sample weights through gradient flow in the Wasserstein space during training.
Our framework's superiority is demonstrated through standard testing on four graph OOD datasets and three class-imbalanced node classification datasets.
arXiv Detail & Related papers (2024-06-03T07:32:05Z) - Pairwise Alignment Improves Graph Domain Adaptation [16.626928606474173]
This work delves into Graph Domain Adaptation (GDA) to address the unique complexities of distribution shifts over graph data.
We propose a novel, theoretically principled method, Pairwise Alignment (Pair-Align) to counter graph structure shift.
Our method demonstrates superior performance in real-world applications, including node classification with region shift in social networks.
arXiv Detail & Related papers (2024-03-02T04:31:28Z) - Chasing Fairness in Graphs: A GNN Architecture Perspective [73.43111851492593]
We propose textsfFair textsfMessage textsfPassing (FMP) designed within a unified optimization framework for graph neural networks (GNNs)
In FMP, the aggregation is first adopted to utilize neighbors' information and then the bias mitigation step explicitly pushes demographic group node presentation centers together.
Experiments on node classification tasks demonstrate that the proposed FMP outperforms several baselines in terms of fairness and accuracy on three real-world datasets.
arXiv Detail & Related papers (2023-12-19T18:00:15Z) - Explaining and Adapting Graph Conditional Shift [28.532526595793364]
Graph Neural Networks (GNNs) have shown remarkable performance on graph-structured data.
Recent empirical studies suggest that GNNs are very susceptible to distribution shift.
arXiv Detail & Related papers (2023-06-05T21:17:48Z) - Similarity-aware Positive Instance Sampling for Graph Contrastive
Pre-training [82.68805025636165]
We propose to select positive graph instances directly from existing graphs in the training set.
Our selection is based on certain domain-specific pair-wise similarity measurements.
Besides, we develop an adaptive node-level pre-training method to dynamically mask nodes to distribute them evenly in the graph.
arXiv Detail & Related papers (2022-06-23T20:12:51Z) - Local Augmentation for Graph Neural Networks [78.48812244668017]
We introduce the local augmentation, which enhances node features by its local subgraph structures.
Based on the local augmentation, we further design a novel framework: LA-GNN, which can apply to any GNN models in a plug-and-play manner.
arXiv Detail & Related papers (2021-09-08T18:10:08Z) - Supervised Domain Adaptation using Graph Embedding [86.3361797111839]
Domain adaptation methods assume that distributions between the two domains are shifted and attempt to realign them.
We propose a generic framework based on graph embedding.
We show that the proposed approach leads to a powerful Domain Adaptation framework.
arXiv Detail & Related papers (2020-03-09T12:25:13Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.