DSBD: Dual-Aligned Structural Basis Distillation for Graph Domain Adaptation
Not on the map. Why?
Abstract (arXiv)
Graph domain adaptation (GDA) aims to transfer knowledge from a labeled source graph to an unlabeled target graph under distribution shifts. However, existing methods are largely feature-centric and overlook structural discrepancies, which become particularly detrimental under significant topology shifts. Such discrepancies alter both geometric relationships and spectral properties, leading to unreliable transfer of graph neural networks (GNNs). To address this limitation, we propose Dual-Aligned Structural Basis Distillation (DSBD) for GDA, a novel framework that explicitly models and adapts cross-domain structural variation. DSBD constructs a differentiable structural basis by synthesizing continuous probabilistic prototype graphs, enabling gradient-based optimization over graph topology. The basis is learned under source-domain supervision to preserve semantic discriminability, while being explicitly aligned to the target domain through a dual-alignment objective. Specifically, geometric consistency is enforced via permutation-invariant topological moment matching, and spectral consistency is achieved through Dirichlet energy calibration, jointly capturing structural characteristics across domains. Furthermore, we introduce a decoupled inference paradigm that mitigates source-specific structural bias by training a new GNN on the distilled structural basis. Extensive experiments on graph and image benchmarks demonstrate that DSBD consistently outperforms state-of-the-art methods.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 35 of its 72 references that are in the map. First posted on arXiv 3 Apr 2026.
Builds on
35 of 72 references.
References · 35
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2020Benchmarking Graph Neural Networkscited by 672
- 2021Graph Self-Supervised Learning: A Surveycited by 289
- 2022Discovering Invariant Rationales for Graph Neural Networkscited by 186
- 2021Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillationcited by 151
- 2023A Comprehensive Survey of Dataset Distillationcited by 114
- 2022Condensing Graphs via One-Step Gradient Matchingcited by 100
- 2022A Survey on Graph Representation Learning Methodscited by 66
- 2023CoCo: A Coupled Contrastive Framework for Unsupervised Domain Adaptive Graph Classificationcited by 46
- 2021On Representation Knowledge Distillation for Graph Neural Networkscited by 38
- 2023Knowledge Distillation on Graphs: A Surveycited by 38
- 2021Graph Domain Adaptation: A Generative Viewcited by 35
23 more
- 2022T2-GNN: Graph Neural Networks for Graphs with Incomplete Features and Structure via Teacher-Student Distillationcited by 32
- 2024Rethinking Propagation for Unsupervised Graph Domain Adaptationcited by 31
- 2023Semi-supervised Domain Adaptation in Graph Transfer Learningcited by 27
- 2024Pairwise Alignment Improves Graph Domain Adaptationcited by 25
- 2024Graph Condensation: A Surveycited by 23
- 2023SPA: A Graph Spectral Alignment Perspective for Domain Adaptationcited by 22
- 2025On the Benefits of Attribute-Driven Graph Domain Adaptationcited by 19
- 2024Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learningcited by 17
- 2023Graph Distillation with Eigenbasis Matchingcited by 16
- 2024SA-GDA: Spectral Augmentation for Graph Domain Adaptationcited by 16
- 2024Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain Adaptationcited by 14
- 2025ProtoMol: Enhancing Molecular Property Prediction via Prototype-Guided Multimodal Learningcited by 11
- 2024Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptationcited by 10
- 2025Nested Graph Pseudo-Label Refinement for Noisy Label Domain Adaptation Learningcited by 10
- 2025Homophily Enhanced Graph Domain Adaptationcited by 9
- 2026USBD: Universal Structural Basis Distillation for Source-Free Graph Domain Adaptationcited by 9
- 2024A Teacher-Free Graph Knowledge Distillation Framework with Dual Self-Distillationcited by 8
- 2024AdaGMLP: AdaBoosting GNN-to-MLP Knowledge Distillationcited by 6
- 2024MuGSI: Distilling GNNs with Multi-Granularity Structural Information for Graph Classificationcited by 5
- 2024HiGDA: Hierarchical Graph of Nodes to Learn Local-to-Global Topology for Semi-Supervised Domain Adaptationcited by 4
- 2025Simple yet Effective Graph Distillation via Clusteringcited by 4
- 2026DisRFM: Polar Riemannian Flow Matching for Structure-Preserving Graph Domain Adaptationcited by 4
- 2025SPA++: Generalized Graph Spectral Alignment for Versatile Domain Adaptationcited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.