Demo Data from EDBT 2026 / reviewers in the wild / expert
Hoang Tuan
dblp:99/3430
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Transfer learning and domain adaptation · 67% Trustworthy machine learning · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › open-world recognition
open-set recognition |
0.6 | 1 | 2022 | Unified Optimal Transport Framework for Universal Domain Adaptation · NeurIPS 2022 |
Machine learning › Transfer learning and domain adaptation
optimal transport alignment |
0.6 | 1 | 2022 | Unified Optimal Transport Framework for Universal Domain Adaptation · NeurIPS 2022 |
Machine learning › Transfer learning and domain adaptation › domain adaptation › unsupervised domain adaptation
universal domain adaptation |
0.6 | 1 | 2022 | Unified Optimal Transport Framework for Universal Domain Adaptation · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
representation learning · 0.6partial alignment · 0.6optimal transport · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Unified Optimal Transport Framework for Universal Domain AdaptationabstractUniversal Domain Adaptation (UniDA) aims to transfer knowledge from a source domain to a target domain without any constraints on label sets. Since both domains may hold private classes, identifying target common samples for domain alignment is an essential issue in UniDA. Most existing methods require manually specified or hand-tuned threshold values to detect common samples thus they are hard to extend to more realistic UniDA because of the diverse ratios of common classes. Moreover, they cannot recognize different categories among target-private samples as these private samples are treated as a whole. In this paper, we propose to use Optimal Transport (OT) to handle these issues under a unified framework, namely UniOT. First, an OT-based partial alignment with adaptive filling is designed to detect common classes without any predefined threshold values for realistic UniDA. It can automatically discover the intrinsic difference between common and private classes based on the statistical information of the assignment matrix obtained from OT. Second, we propose an OT-based target representation learning that encourages both global discrimination and local consistency of samples to avoid the over-reliance on the source. Notably, UniOT is the first method with the capability to automatically discover and recognize private categories in the target domain for UniDA. Accordingly, we introduce a new metric H^3-score to evaluate the performance in terms of both accuracy of common samples and clustering performance of private ones. Extensive experiments clearly demonstrate the advantages of UniOT over a wide range of state-of-the-art methods in UniDA. Wanxing Chang, Ye Shi 0001, Hoang Tuan, Jingya Wang 0001 |
NeurIPS | 3 |