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

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Xiao, Zhiqing, Wang, Haobo, Lu, Xu, Ye, Wentao, Chen, Gang, Zhao, Junbo
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866918118305038336
author Xiao, Zhiqing
Wang, Haobo
Lu, Xu
Ye, Wentao
Chen, Gang
Zhao, Junbo
author_facet Xiao, Zhiqing
Wang, Haobo
Lu, Xu
Ye, Wentao
Chen, Gang
Zhao, Junbo
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2508_05182
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle SPA++: Generalized Graph Spectral Alignment for Versatile Domain Adaptation
Xiao, Zhiqing
Wang, Haobo
Lu, Xu
Ye, Wentao
Chen, Gang
Zhao, Junbo
Computer Vision and Pattern Recognition
Machine Learning
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.
title SPA++: Generalized Graph Spectral Alignment for Versatile Domain Adaptation
topic Computer Vision and Pattern Recognition
Machine Learning
url https://arxiv.org/abs/2508.05182