Research map / Graph learning / Graph self-supervised learning
Learning Adaptive Distribution Alignment with Neural Characteristic Function for Graph Domain Adaptation
Wei Chen, Xingyu Guo, Shuang Li, Zhao Zhang, Yan Zhong, Fuzhen Zhuang, deqing wang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| learn frequency sampler adversarially vs random/low/high fixed frequency bands (ablation) | ADAlign · four transfer tasks (U->E, E->U, DE->EN, EN->DE etc.) | Micro-F1 | Improved |
| use low-frequency band only (ablation) | ADAlign · U->E and E->U | Micro-F1 | No clear effect |
| use high-frequency band only (ablation) | ADAlign · DE->EN and EN->DE | Micro-F1 | Hurt |
| sample random frequencies (ablation) | ADAlign · four transfer tasks | Micro-F1 | Hurt |
| set kappa to extremes (1.0 or 0.0) instead of 0.65-0.75 (ablation) | ADAlign · transfer tasks | Micro-F1 | Hurt |
| increase number of sampled frequencies M beyond 2048 (ablation) | ADAlign · transfer tasks | Micro-F1 | No clear effect |
| increase alignment weight lambda (ablation) | ADAlign · transfer tasks | Micro-F1 | Mixed |
| replace kernel-based alignment with neural characteristic function alignment | ADAlign vs TDSS · A->C | speed and memory: 2.0x speedup, 3.1x memory reduction | Improved |
Earlier methods this paper compares with
Named baselines from earlier accepted papers in this paper's results tables: better than 1 of 1 on most shared results.
- AdaGCN — AdaGCN: Adaboosting Graph Convolutional Networks into Deep Models (ICLR 2021) · better on 1 of 1 shared result
Matched by method name in results tables read by AI. Authors' own tables tend to favour the newer method, and a comparison can be missed when a method is renamed.
Closest papers by meaning
- Pairwise Alignment Improves Graph Domain Adaptation (ICML 2024 · similarity 0.92)
- On the Benefits of Attribute-Driven Graph Domain Adaptation (ICLR 2025 · similarity 0.91)
- Homophily Enhanced Graph Domain Adaptation (ICML 2025 · similarity 0.91)
- Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation (NeurIPS 2024 · similarity 0.90)
- TFGDA: Exploring Topology and Feature Alignment in Semi-supervised Graph Domain Adaptation through Robust Clustering (NeurIPS 2024 · similarity 0.89)
- Rethinking Propagation for Unsupervised Graph Domain Adaptation (AAAI 2024 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
