Progressive Optimization of Target Distribution and Effective Refinement of Hard Samples for Source-Free Domain Adaptation

In recent years, the research on source-free domain adaptation has received increasing attention and has achieved considerable progress. It can overcome the dependence on source domain data and obtain a target domain model with robust performance on the target domain only by using the source domain model and unlabeled target domain data. However, existing studies typically handle the target domain distribution in a relatively coarse manner and are consistently susceptible to model noise interference. Therefore, we propose a progressive optimization strategy for the target domain distribution, including two parts: inter-category and intra-category. Regarding inter-category, we decide whether to separate category pairs based on the degree of discrepancy between them. Regarding intra-category, we consider whether to aggregate sample pairs based on whether their pairwise similarity—among samples assigned to the same predicted category—is sufficiently high. And as the training progresses, all data will be optimized. Additionally, for some difficult-to-distinguish categories, we propose a screening strategy that fuses source domain and target domain knowledge. We also further optimized the samples belonging to these categories. Our results on three image datasets demonstrate the effectiveness of our method.

Authors

Institutions

Publication Details

Journal
Computers
Published
2026-03-15
DOI
https://doi.org/10.3390/computers15030190
Primary Topic
Domain Adaptation and Few-Shot Learning
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Progressive Optimization of Target Distribution and Effective Refinement of Hard Samples for Source-Free Domain Adaptation

Yajian Zeng, Xinrui Wang, Xiaorong Hou, Shumin Liang
Computers
Domain Adaptation and Few-Shot Learning
article

Progressive Optimization of Target Distribution and Effective Refinement of Hard Samples for Source-Free Domain Adaptation

Yajian Zeng, Xinrui Wang, Xiaorong Hou, Shumin Liang
article en

Abstract

In recent years, the research on source-free domain adaptation has received increasing attention and has achieved considerable progress. It can overcome the dependence on source domain data and obtain a target domain model with robust performance on the target domain only by using the source domain model and unlabeled target domain data. However, existing studies typically handle the target domain distribution in a relatively coarse manner and are consistently susceptible to model noise interference. Therefore, we propose a progressive optimization strategy for the target domain distribution, including two parts: inter-category and intra-category. Regarding inter-category, we decide whether to separate category pairs based on the degree of discrepancy between them. Regarding intra-category, we consider whether to aggregate sample pairs based on whether their pairwise similarity—among samples assigned to the same predicted category—is sufficiently high. And as the training progresses, all data will be optimized. Additionally, for some difficult-to-distinguish categories, we propose a screening strategy that fuses source domain and target domain knowledge. We also further optimized the samples belonging to these categories. Our results on three image datasets demonstrate the effectiveness of our method.

ComputersVol. 15(3)
University of Electronic Science and Technology of China (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 23%
Domain Adaptation and Few-Shot Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.