Papers › Target Semantics Clustering via Text Representations for Robust Universal Domain Adaptation

Target Semantics Clustering via Text Representations for Robust Universal Domain Adaptation

4 Jun 2025AAAI 2025 3arXiv:2506.03521archive 2025-07-28

Weinan He, Zilei Wang, Yixin Zhang

Universal Domain Adaptation (UniDA) focuses on transferring source domain knowledge to the target domain under both domain shift and unknown category shift. Its main challenge lies in identifying common class samples and aligning them. Current methods typically obtain target domain semantics centers from an unconstrained continuous image representation space. Due to domain shift and the unknown number of clusters, these centers often result in complex and less robust alignment algorithm. In this paper, based on vision-language models, we search for semantic centers in a semantically meaningful and discrete text representation space. The constrained space ensures almost no domain bias and appropriate semantic granularity for these centers, enabling a simple and robust adaptation algorithm. Specifically, we propose TArget Semantics Clustering (TASC) via Text Representations, which leverages information maximization as a unified objective and involves two stages. First, with the frozen encoders, a greedy search-based framework is used to search for an optimal set of text embeddings to represent target semantics. Second, with the search results fixed, encoders are refined based on gradient descent, simultaneously achieving robust domain alignment and private class clustering. Additionally, we propose Universal Maximum Similarity (UniMS), a scoring function tailored for detecting open-set samples in UniDA. Experimentally, we evaluate the universality of UniDA algorithms under four category shift scenarios. Extensive experiments on four benchmarks demonstrate the effectiveness and robustness of our method, which has achieved state-of-the-art performance.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2506.03521")

Code

Syntology Ran 0 of 11 code samples harvested from 1 repository linked to this paper; 11 have no recorded run.

By repository: official repository: 11 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Sapphire-356/TASC officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 0 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

11unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from Sapphire-356/TASC. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

LoRA_ViT Sapphire-356/TASC/sapphire/models/LoRA_layer.py official repository unverified MIT (permissive) · 511c1d694621e88c · report
Metric Sapphire-356/TASC/train_sapphire_TASC.py official repository unverified MIT (permissive) · a64a50db3a32fffe · report
NNConsistencyLoss Sapphire-356/TASC/sapphire/train/loss.py official repository unverified MIT (permissive) · b6022f70325a4031 · report
aToBSheduler Sapphire-356/TASC/sapphire/models/utils.py official repository unverified MIT (permissive) · 07e359b5e4b5c432 · report
find_folders_with_keyword Sapphire-356/TASC/exp_scripts/get_results.py official repository unverified MIT (permissive) · 6257214ba37b90f8 · report
find_metric_json_files Sapphire-356/TASC/exp_scripts/get_results.py official repository unverified MIT (permissive) · 38a3330d069f724f · report
flatten_json_fields Sapphire-356/TASC/exp_scripts/get_results.py official repository unverified MIT (permissive) · 62b8c7b3100d78c8 · report
get_entropy Sapphire-356/TASC/train_sapphire_TASCBase.py official repository unverified MIT (permissive) · 2904c1a5e4c8fd97 · report
get_prototypes Sapphire-356/TASC/train_sapphire_TASCBase.py official repository unverified MIT (permissive) · 4f30a84e99b847d7 · report
gmm_threshold Sapphire-356/TASC/train_sapphire_TASC.py official repository unverified MIT (permissive) · 45ced87c694743dd · report
unravel_indices Sapphire-356/TASC/train_sapphire_TASCBase.py official repository unverified MIT (permissive) · 203cd9f4f03efdfd · report

Tasks

Domain AdaptationUniversal Domain Adaptation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Universal Domain Adaptation DomainNet TASC H-Score 73.28 #1 of 12 Archive leaderboard report
Universal Domain Adaptation DomainNet TASC Source-free no #1 of 12 Archive leaderboard report
Universal Domain Adaptation Office-Home TASC H-Score 89.44 #1 of 14 Archive leaderboard report
Universal Domain Adaptation Office-Home TASC Source-free no #1 of 14 Archive leaderboard report
Universal Domain Adaptation Office-Home TASC VLM yes #1 of 14 Archive leaderboard report
Universal Domain Adaptation VisDA2017 TASC H-score 90.36 #1 of 13 Archive leaderboard report
Universal Domain Adaptation VisDA2017 TASC Source-free no #1 of 13 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

SET

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections