SPA++: Generalized Graph Spectral Alignment for Versatile Domain Adaptation

• URL: http://arxiv.org/abs/2508.05182v1
• Date: Thu, 07 Aug 2025 09:18:36 GMT
• Title: SPA++: Generalized Graph Spectral Alignment for Versatile Domain Adaptation
• Authors: Zhiqing Xiao, Haobo Wang, Xu Lu, Wentao Ye, Gang Chen, Junbo Zhao,
• Abstract summary: Domain Adaptation aims to transfer knowledge from a labeled source domain to an unlabeled or sparsely labeled target domain under domain shifts.<n>We propose a graph SPectral Alignment framework, SPA++, to tackle this tradeoff.<n>Experiments on benchmark datasets demonstrate that SPA++ consistently outperforms existing cutting-edge methods.
• Score: 19.755321056121204
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Domain Adaptation (DA) aims to transfer knowledge from a labeled source domain to an unlabeled or sparsely labeled target domain under domain shifts. Most prior works focus on capturing the inter-domain transferability but largely overlook rich intra-domain structures, which empirically results in even worse discriminability. To tackle this tradeoff, we propose a generalized graph SPectral Alignment framework, SPA++. Its core is briefly condensed as follows: (1)-by casting the DA problem to graph primitives, it composes a coarse graph alignment mechanism with a novel spectral regularizer toward aligning the domain graphs in eigenspaces; (2)-we further develop a fine-grained neighbor-aware propagation mechanism for enhanced discriminability in the target domain; (3)-by incorporating data augmentation and consistency regularization, SPA++ can adapt to complex scenarios including most DA settings and even challenging distribution scenarios. Furthermore, we also provide theoretical analysis to support our method, including the generalization bound of graph-based DA and the role of spectral alignment and smoothing consistency. Extensive experiments on benchmark datasets demonstrate that SPA++ consistently outperforms existing cutting-edge methods, achieving superior robustness and adaptability across various challenging adaptation scenarios.

Related papers

• Gradual Domain Adaptation for Graph Learning [13.143891794601162]
  We present a graph gradual domain adaptation (GGDA) framework with the construction of a compact domain sequence.<n>Our approach starts with an efficient generation of knowledge-preserving intermediate graphs over the Fused Gromov-Wasserstein (FGW) metric.<n>Our framework concretizes the intractable inter-domain distance $W_p(mu_t,mu_t+1)$ via implementable upper and lower bounds.
  arXiv  Detail & Related papers  (2025-01-29T06:48:59Z)
• Towards Cross-domain Few-shot Graph Anomaly Detection [6.732699844225434]
  Cross-domain few-shot graph anomaly detection (GAD) is nontrivial owing to inherent data distribution discrepancies between the source and target domains. We propose a simple and effective framework, termed CDFS-GAD, specifically designed to tackle the aforementioned challenges.
  arXiv  Detail & Related papers  (2024-10-11T08:47:25Z)
• Degree-Conscious Spiking Graph for Cross-Domain Adaptation [9.785526401884155]
  Spiking Graph Networks (SGNs) have demonstrated significant potential in graph classification by emulating brain-inspired neural dynamics.<n>In this paper, we first propose the domain adaptation problem in SGNs, and introduce a novel framework named Degree-Consicious Spiking Graph for Cross-Domain Adaptation.
  arXiv  Detail & Related papers  (2024-10-09T13:45:54Z)
• Semi Supervised Heterogeneous Domain Adaptation via Disentanglement and Pseudo-Labelling [4.33404822906643]
  Semi-supervised domain adaptation methods leverage information from a source labelled domain to generalize over a scarcely labelled target domain. Such a setting is denoted as Semi-Supervised Heterogeneous Domain Adaptation (SSHDA) We introduce SHeDD (Semi-supervised Heterogeneous Domain Adaptation via Disentanglement) an end-to-end neural framework tailored to learning a target domain.
  arXiv  Detail & Related papers  (2024-06-20T08:02:49Z)
• SPA: A Graph Spectral Alignment Perspective for Domain Adaptation [41.89873161315133]
  Unsupervised domain adaptation (UDA) is a pivotal form in machine learning to extend the in-domain model to the distinctive target domains where the data distributions differ. Most prior works focus on capturing the inter-domain transferability but largely overlook rich intra-domain structures, which empirically results in even worse discriminability. We introduce a novel graph SPectral Alignment (SPA) framework to tackle the tradeoff.
  arXiv  Detail & Related papers  (2023-10-26T17:13:48Z)
• Label Alignment Regularization for Distribution Shift [63.228879525056904]
  Recent work has highlighted the label alignment property (LAP) in supervised learning, where the vector of all labels in the dataset is mostly in the span of the top few singular vectors of the data matrix. We propose a regularization method for unsupervised domain adaptation that encourages alignment between the predictions in the target domain and its top singular vectors. We report improved performance over domain adaptation baselines in well-known tasks such as MNIST-USPS domain adaptation and cross-lingual sentiment analysis.
  arXiv  Detail & Related papers  (2022-11-27T22:54:48Z)
• Relation Matters: Foreground-aware Graph-based Relational Reasoning for Domain Adaptive Object Detection [81.07378219410182]
  We propose a new and general framework for DomainD, named Foreground-aware Graph-based Reasoning (FGRR) FGRR incorporates graph structures into the detection pipeline to explicitly model the intra- and inter-domain foreground object relations. Empirical results demonstrate that the proposed FGRR exceeds the state-of-the-art on four DomainD benchmarks.
  arXiv  Detail & Related papers  (2022-06-06T05:12:48Z)
• Amplitude Spectrum Transformation for Open Compound Domain Adaptive Semantic Segmentation [62.68759523116924]
  Open compound domain adaptation (OCDA) has emerged as a practical adaptation setting. We propose a novel feature space Amplitude Spectrum Transformation (AST)
  arXiv  Detail & Related papers  (2022-02-09T05:40:34Z)
• Cross-domain Detection via Graph-induced Prototype Alignment [114.8952035552862]
  We propose a Graph-induced Prototype Alignment (GPA) framework to seek for category-level domain alignment. In addition, in order to alleviate the negative effect of class-imbalance on domain adaptation, we design a Class-reweighted Contrastive Loss. Our approach outperforms existing methods with a remarkable margin.
  arXiv  Detail & Related papers  (2020-03-28T17:46:55Z)
• Supervised Domain Adaptation using Graph Embedding [86.3361797111839]
  Domain adaptation methods assume that distributions between the two domains are shifted and attempt to realign them. We propose a generic framework based on graph embedding. We show that the proposed approach leads to a powerful Domain Adaptation framework.
  arXiv  Detail & Related papers  (2020-03-09T12:25:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.