GALA: Graph Diffusion-Based Alignment With Jigsaw for Source-Free Domain Adaptation

被引:4
作者
Luo, Junyu [1 ]
Gu, Yiyang [1 ]
Luo, Xiao [2 ]
Ju, Wei [1 ]
Xiao, Zhiping [2 ]
Zhao, Yusheng [1 ]
Yuan, Jingyang [1 ]
Zhang, Ming [1 ]
机构
[1] Peking Univ, Anker Embodied AI Lab, Natl Key Lab Multimedia Informat Proc, Sch Comp Sci, Beijing 100871, Peoples R China
[2] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
基金
中国国家自然科学基金;
关键词
Graph diffusion model; graph neural network; source-free domain adaptation;
D O I
10.1109/TPAMI.2024.3416372
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Source-free domain adaptation is a crucial machine learning topic, as it contains numerous applications in the real world, particularly with respect to data privacy. Existing approaches predominantly focus on euclidean data, such as images and videos, while the exploration of non-euclidean graph data remains scarce. Recent graph neural network (GNN) approaches can suffer from serious performance decline due to domain shift and label scarcity in source-free adaptation scenarios. In this study, we propose a novel method named Graph Diffusion-based Alignment with Jigsaw (GALA), tailored for source-free graph domain adaptation. To achieve domain alignment, GALA employs a graph diffusion model to reconstruct source-style graphs from target data. Specifically, a score-based graph diffusion model is trained using source graphs to learn the generative source styles. Then, we introduce perturbations to target graphs via a stochastic differential equation instead of sampling from a prior, followed by the reverse process to reconstruct source-style graphs. We feed the source-style graphs into an off-the-shelf GNN and introduce class-specific thresholds with curriculum learning, which can generate accurate and unbiased pseudo-labels for target graphs. Moreover, we develop a simple yet effective graph-mixing strategy named graph jigsaw to combine confident graphs and unconfident graphs, which can enhance generalization capabilities and robustness via consistency learning. Extensive experiments on benchmark datasets validate the effectiveness of GALA.
引用
收藏
页码:9038 / 9051
页数:14
相关论文
共 68 条
[1]   Semi-Supervised Learning of Visual Features by Non-Parametrically Predicting View Assignments with Support Samples [J].
Assran, Mahmoud ;
Caron, Mathilde ;
Misra, Ishan ;
Bojanowski, Piotr ;
Joulin, Armand ;
Ballas, Nicolas ;
Rabbat, Michael .
2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021), 2021, :8423-8432
[2]  
Bianchi FM, 2020, PR MACH LEARN RES, V119
[3]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[4]   Protein function prediction via graph kernels [J].
Borgwardt, KM ;
Ong, CS ;
Schönauer, S ;
Vishwanathan, SVN ;
Smola, AJ ;
Kriegel, HP .
BIOINFORMATICS, 2005, 21 :I47-I56
[5]  
Buffelli D., 2022, ADV NEUR IN, P31871
[6]   Universal Domain Adaptive Network Embedding for Node Classification [J].
Chen, Jushuo ;
Dai, Feifei ;
Gu, Xiaoyan ;
Zhou, Jiang ;
Li, Bo ;
Wang, Weiping .
PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA, MM 2023, 2023, :4022-4030
[7]  
Cosmo L, 2024, Arxiv, DOI arXiv:2112.07436
[8]   Topology-Aware Graph Pooling Networks [J].
Gao, Hongyang ;
Liu, Yi ;
Ji, Shuiwang .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2021, 43 (12) :4512-4518
[9]   Back to the Source: Diffusion-Driven Adaptation to Test-Time Corruption [J].
Gao, Jin ;
Zhang, Jialing ;
Liu, Xihui ;
Darrell, Trevor ;
Shelhamer, Evan ;
Wang, Dequan .
2023 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2023, :11786-11796
[10]  
Hamilton WL, 2017, ADV NEUR IN, V30