HG-SFDA: HyperGraph learning Meets Source-free unsupervised Domain Adaptation
HG-SFDA: HyperGraph learning Meets Source-free unsupervised Domain Adaptation
Source-Free unsupervised Domain Adaptation (SFDA) aims to classify target samples by only accessing a pretrained source model and unlabelled target samples. Since no source data is available, transferring the knowledge from the source domain to the target domain is challenging. Existing methods normally exploit the pair-wise relation among target samples and attempt to discover their correlations by clustering these samples based on semantic features. The drawbacks of these methods include: 1) the pair-wise relation is limited to exposing the underlying correlations of two more samples, hindering the exploration of the structural information embedded in the target domain; and 2) the clustering process only relies on the semantic feature, while overlooking the critical effect of domain shift, i.e., the distribution differences between the source and target domains. To address these issues, we propose a new SFDA method that exploits the high-order neighborhood relation and explicitly takes the domain shift effect into account. Specifically, we formulate the SFDA as a hypergraph learning problem and construct hyperedges to explore the deep structural and context information among multiple samples. Moreover, we integrate a self-loop strategy into the constructed hypergraph to elegantly introduce the domain uncertainty of each sample. By clustering these samples based on hyperedges, both the semantic feature and domain shift effects are considered. We then describe an adaptive relation-based objective to tune the model with soft attention levels for all samples. Extensive experiments are conducted on Office-31, Office-Home, VisDA, DomainNet-126 and PointDA-10 datasets. The results demonstrate the superiority of our method over state-of-the-art counterparts.
7542-7557
Jiang, Jinkun
255cac60-3774-4e82-9592-5845d5b93651
Lv, Qingxuan
09dec60c-48fb-420d-b0e8-5a176a474abf
Li, Yuezun
f95883a5-3aeb-42ff-ae79-11ea2da9e1e2
Du, Yong
5ae897d7-a3db-45d7-896a-187afa95ac43
Dong, Junyu
ef350fb2-8682-4a0a-b60e-ebcb7f55085f
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80
Yu, Hui
62623ded-fe42-4211-9529-ff32de116743
17 November 2025
Jiang, Jinkun
255cac60-3774-4e82-9592-5845d5b93651
Lv, Qingxuan
09dec60c-48fb-420d-b0e8-5a176a474abf
Li, Yuezun
f95883a5-3aeb-42ff-ae79-11ea2da9e1e2
Du, Yong
5ae897d7-a3db-45d7-896a-187afa95ac43
Dong, Junyu
ef350fb2-8682-4a0a-b60e-ebcb7f55085f
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80
Yu, Hui
62623ded-fe42-4211-9529-ff32de116743
Jiang, Jinkun, Lv, Qingxuan, Li, Yuezun, Du, Yong, Dong, Junyu, Chen, Sheng and Yu, Hui
(2025)
HG-SFDA: HyperGraph learning Meets Source-free unsupervised Domain Adaptation.
IEEE Transactions on Image Processing, 34, .
(doi:10.1109/TIP.2025.3631461).
Abstract
Source-Free unsupervised Domain Adaptation (SFDA) aims to classify target samples by only accessing a pretrained source model and unlabelled target samples. Since no source data is available, transferring the knowledge from the source domain to the target domain is challenging. Existing methods normally exploit the pair-wise relation among target samples and attempt to discover their correlations by clustering these samples based on semantic features. The drawbacks of these methods include: 1) the pair-wise relation is limited to exposing the underlying correlations of two more samples, hindering the exploration of the structural information embedded in the target domain; and 2) the clustering process only relies on the semantic feature, while overlooking the critical effect of domain shift, i.e., the distribution differences between the source and target domains. To address these issues, we propose a new SFDA method that exploits the high-order neighborhood relation and explicitly takes the domain shift effect into account. Specifically, we formulate the SFDA as a hypergraph learning problem and construct hyperedges to explore the deep structural and context information among multiple samples. Moreover, we integrate a self-loop strategy into the constructed hypergraph to elegantly introduce the domain uncertainty of each sample. By clustering these samples based on hyperedges, both the semantic feature and domain shift effects are considered. We then describe an adaptive relation-based objective to tune the model with soft attention levels for all samples. Extensive experiments are conducted on Office-31, Office-Home, VisDA, DomainNet-126 and PointDA-10 datasets. The results demonstrate the superiority of our method over state-of-the-art counterparts.
Text
TIP2025-accepted
- Accepted Manuscript
More information
Accepted/In Press date: 27 October 2025
Published date: 17 November 2025
Identifiers
Local EPrints ID: 507440
URI: http://eprints.soton.ac.uk/id/eprint/507440
ISSN: 1057-7149
PURE UUID: 123a2f6b-9c40-4c0a-9984-565c73b4849a
Catalogue record
Date deposited: 09 Dec 2025 17:47
Last modified: 09 Dec 2025 17:48
Export record
Altmetrics
Contributors
Author:
Jinkun Jiang
Author:
Qingxuan Lv
Author:
Yuezun Li
Author:
Yong Du
Author:
Junyu Dong
Author:
Sheng Chen
Author:
Hui Yu
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics