arXiv Machine Learning June 2, 2026 By Yingxu Wang, Xinwang Liu, Siyang Gao, Nan Yin

Safe-Subspace Pseudo-Label Refinement for Source-Free Graph Domain Adaptation

Read the original on arXiv Machine Learning →

arXiv:2606. 00808v1 Announce Type: new Abstract: Source-free graph domain adaptation (SF-GDA) aims to adapt source-trained graph models to unlabeled target graphs when source graphs are no longer accessible.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Sep 15

Data-Efficient Agentic Graph Domain Adaptation via Reliability-Aware Prototype Learning

arXiv:2609.14045v1 Announce Type: new Abstract: Agentic learning systems are often required to adapt after deployment by observing new data and reusing prior knowledge under limited supervision or fe...

By Yingxu Wang, Kunyu Zhang, Siyang Gao

rag agents fine-tuning benchmarks

arXiv Machine Learning

Sep 23

Graph Domain Adaptation Does Not End with Representation Learning

arXiv:2609.25692v1 Announce Type: new Abstract: Graph domain adaptation (GDA) transfers knowledge from a labeled source graph to an unlabeled target graph under shifts in both node attributes and gra...

By Ziqian Liu, Yongxue Xu, Enze Zhang, Jiaqi Zhang, Hao Wang, Maolin Wang

fine-tuning benchmarks safety

arXiv Machine Learning

Aug 3

Cross-Resolution Semantic Learning for Graph Domain Adaptation

arXiv:2607. 29365v1 Announce Type: new Abstract: Graph Domain Adaptation (GDA) transfers predictive knowledge from labeled source graphs to unlabeled target graphs under distribution shift.

By Yingxu Wang, Haoze Huang, Zhongkai Zheng, Shangsong Liang

rag fine-tuning benchmarks

arXiv AI

Jul 7

A Step Towards Robust Unsupervised Domain Adaptation via Fine-Tuning and Reinforcement Learning

arXiv:2607. 03600v1 Announce Type: cross Abstract: Adversarial robustness in Unsupervised Domain Adaptation (UDA) remains a significant challenge due to noisy pseudo labels and inherent distributional shifts between the clean source and adversarially perturbed target domains.

By Sushant Dagaji Desale, Rahul Mishra, Ashutosh Kumar Sinha

reinforcement-learning fine-tuning benchmarks safety

arXiv AI

Jul 21

Selectivity Matters: Source Node Influence Pruning for Unsupervised Graph Domain Adaptation

arXiv:2607. 17668v1 Announce Type: cross Abstract: Unsupervised Graph Domain Adaptation (UGDA) aims to facilitate knowledge transfer from a labeled source graph to an unlabeled target graph by mitigating cross-domain distribution shifts.

By Ridong Han, Yawen Shen, Zhongnian Li, Tongfeng Sun, Xinzheng Xu, Abdulmotaleb El Saddik

fine-tuning efficiency safety

arXiv AI

Jul 21

DIB-OD: Preserving the Invariant Core for Robust Heterogeneous Graph Adaptation via Decoupled Information Bottleneck and Online Distillation

arXiv:2604. 10882v2 Announce Type: replace-cross Abstract: Graph Neural Network pretraining is pivotal for leveraging unlabeled graph data.

By Yang Yan, Yunxuan Li, Qiuyan Wang, Tianjin Huang, Qiudong Yu

fine-tuning efficiency benchmarks

One email a morning, machine-written

Related stories

Data-Efficient Agentic Graph Domain Adaptation via Reliability-Aware Prototype Learning

Graph Domain Adaptation Does Not End with Representation Learning

Cross-Resolution Semantic Learning for Graph Domain Adaptation

A Step Towards Robust Unsupervised Domain Adaptation via Fine-Tuning and Reinforcement Learning

Selectivity Matters: Source Node Influence Pruning for Unsupervised Graph Domain Adaptation

DIB-OD: Preserving the Invariant Core for Robust Heterogeneous Graph Adaptation via Decoupled Information Bottleneck and Online Distillation