arXiv:2602.08431cs.LG2026-02KDD被引 7

提出新方法解决图数据跨域迁移中结构差异难题,提升隐私保护下的模型泛化能力。

USBD: Universal Structural Basis Distillation for Source-Free Graph Domain Adaptation

  • 构建无结构依赖的通用结构基底,覆盖多样拓扑模式
  • 在严重结构偏移下性能超越现有方法,精度提升显著
  • 适合处理隐私敏感、结构差异大的图数据迁移场景

源域自适应(SF-GDA)对跨图数据集的隐私保护知识迁移至关重要。尽管现有方法引入了结构信息,但它们隐式依赖源训练GNN的平滑性先验,导致在结构差异大的目标域上泛化能力受限。当拓扑结构发生显著变化时,源模型会将目标域中未见的拓扑模式误判为噪声,使基于伪标签的适应不可靠。为此,本文提出通用结构基底蒸馏(USBD),将范式从适配有偏源模型转向学习通用结构基底。USBD采用双层优化框架,将源数据蒸馏为紧凑的结构基底。通过强制原型覆盖完整的狄利克雷能量谱,所学基底显式捕获从低频聚类到高频链路等多样化拓扑模式,超越源域中的结构。推理时,引入谱感知集成机制,根据目标图的谱指纹动态激活最优原型组合。大量实验表明,USBD在严重结构偏移场景下显著优于当前最优方法,且通过解耦适应代价与目标数据规模,实现更高计算效率。

原文摘要 · Abstract (English)

SF-GDA is pivotal for privacy-preserving knowledge transfer across graph datasets. Although recent works incorporate structural information, they implicitly condition adaptation on the smoothness priors of sourcetrained GNNs, thereby limiting their generalization to structurally distinct targets. This dependency becomes a critical bottleneck under significant topological shifts, where the source model misinterprets distinct topological patterns unseen in the source domain as noise, rendering pseudo-label-based adaptation unreliable. To overcome this limitation, we propose the Universal Structural Basis Distillation, a framework that shifts the paradigm from adapting a biased model to learning a universal structural basis for SF-GDA. Instead of adapting a biased source model to a specific target, our core idea is to construct a structure-agnostic basis that proactively covers the full spectrum of potential topological patterns. Specifically, USBD employs a bi-level optimization framework to distill the source dataset into a compact structural basis. By enforcing the prototypes to span the full Dirichlet energy spectrum, the learned basis explicitly captures diverse topological motifs, ranging from low-frequency clusters to high-frequency chains, beyond those present in the source. This ensures that the learned basis creates a comprehensive structural covering capable of handling targets with disparate structures. For inference, we introduce a spectral-aware ensemble mechanism that dynamically activates the optimal prototype combination based on the spectral fingerprint of the target graph. Extensive experiments on benchmarks demonstrate that USBD significantly outperforms state-of-the-art methods, particularly in scenarios with severe structural shifts, while achieving superior computational efficiency by decoupling the adaptation cost from the target data scale.

图神经网络域适应结构蒸馏隐私保护

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。