Learning Structure-Semantic Evolution Trajectories for Graph Domain Adaptation
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911439722119168 |
|---|---|
| author | Chen, Wei Guo, Xingyu Li, Shuang Zhong, Yan Zhang, Zhao Zhuang, Fuzhen Liu, Hongrui Zhang, Libang Ye, Guo He, Huimei |
| author_facet | Chen, Wei Guo, Xingyu Li, Shuang Zhong, Yan Zhang, Zhao Zhuang, Fuzhen Liu, Hongrui Zhang, Libang Ye, Guo He, Huimei |
| contents | Graph Domain Adaptation (GDA) aims to bridge distribution shifts between domains by transferring knowledge from well-labeled source graphs to given unlabeled target graphs. One promising recent approach addresses graph transfer by discretizing the adaptation process, typically through the construction of intermediate graphs or stepwise alignment procedures. However, such discrete strategies often fail in real-world scenarios, where graph structures evolve continuously and nonlinearly, making it difficult for fixed-step alignment to approximate the actual transformation process. To address these limitations, we propose \textbf{DiffGDA}, a \textbf{Diff}usion-based \textbf{GDA} method that models the domain adaptation process as a continuous-time generative process. We formulate the evolution from source to target graphs using stochastic differential equations (SDEs), enabling the joint modeling of structural and semantic transitions. To guide this evolution, a domain-aware network is introduced to steer the generative process toward the target domain, encouraging the diffusion trajectory to follow an optimal adaptation path. We theoretically show that the diffusion process converges to the optimal solution bridging the source and target domains in the latent space. Extensive experiments on 14 graph transfer tasks across 8 real-world datasets demonstrate DiffGDA consistently outperforms state-of-the-art baselines. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_10506 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Learning Structure-Semantic Evolution Trajectories for Graph Domain Adaptation Chen, Wei Guo, Xingyu Li, Shuang Zhong, Yan Zhang, Zhao Zhuang, Fuzhen Liu, Hongrui Zhang, Libang Ye, Guo He, Huimei Machine Learning Artificial Intelligence Graph Domain Adaptation (GDA) aims to bridge distribution shifts between domains by transferring knowledge from well-labeled source graphs to given unlabeled target graphs. One promising recent approach addresses graph transfer by discretizing the adaptation process, typically through the construction of intermediate graphs or stepwise alignment procedures. However, such discrete strategies often fail in real-world scenarios, where graph structures evolve continuously and nonlinearly, making it difficult for fixed-step alignment to approximate the actual transformation process. To address these limitations, we propose \textbf{DiffGDA}, a \textbf{Diff}usion-based \textbf{GDA} method that models the domain adaptation process as a continuous-time generative process. We formulate the evolution from source to target graphs using stochastic differential equations (SDEs), enabling the joint modeling of structural and semantic transitions. To guide this evolution, a domain-aware network is introduced to steer the generative process toward the target domain, encouraging the diffusion trajectory to follow an optimal adaptation path. We theoretically show that the diffusion process converges to the optimal solution bridging the source and target domains in the latent space. Extensive experiments on 14 graph transfer tasks across 8 real-world datasets demonstrate DiffGDA consistently outperforms state-of-the-art baselines. |
| title | Learning Structure-Semantic Evolution Trajectories for Graph Domain Adaptation |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2602.10506 |