Unified Optimal Transport Framework for Universal Domain Adaptation
Wanxing Chang, Ye Shi, Hoang Tuan, Jingya Wang
摘要
Universal 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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper40
- Feed Two Birds with One Scone: Exploiting Wild Data for Both Out-of-Distribution Generalization and DetectionHaoyue Bai, Gregory Canal, Xuefeng Du, Jeongyeol Kwon 等ICML 2023 · 被引用 67 次
- Universal Domain Adaptation via Compressive Attention MatchingDidi Zhu, Yinchuan Li, Junkun Yuan, Zexi Li 等ICCV 2023 · 被引用 26 次
- LEAD: Learning Decomposition for Source-free Universal Domain AdaptationSanqing Qu, Tianpei Zou, Lianghua He, Florian Röhrbein 等CVPR 2024 · 被引用 25 次
- MLNet: Mutual Learning Network with Neighborhood Invariance for Universal Domain AdaptationYanzuo Lu, Meng Shen, Andy J. Ma, Xiaohua Xie 等AAAI 2024 · 被引用 25 次
- CSOT: Curriculum and Structure-Aware Optimal Transport for Learning with Noisy LabelsWanxing Chang, Ye Shi, Jingya WangNeurIPS 2023 · 被引用 24 次
它引用的顶会 Paper14
- Unsupervised Learning of Visual Features by Contrasting Cluster AssignmentsMathilde Caron, Ishan Misra, Julien Mairal, Priya Goyal 等NeurIPS 2020 · 被引用 5,249 次
- Moment Matching for Multi-Source Domain AdaptationXingchao Peng, Qinxun Bai, Xide Xia, Zijun Huang 等ICCV 2019 · 被引用 2,239 次
- Self-labelling via simultaneous clustering and representation learningYuki Markus Asano, Christian Rupprecht, Andrea VedaldiICLR 2020 · 被引用 873 次
- Universal Domain Adaptation through Self SupervisionKuniaki Saito, Donghyun Kim, Stan Sclaroff, Kate SaenkoNeurIPS 2020 · 被引用 401 次
- Unbalanced minibatch Optimal Transport; applications to Domain AdaptationKilian Fatras, Thibault Séjourné, Rémi Flamary, Nicolas CourtyICML 2021 · 被引用 183 次
相关 Paper
- Prototypical Partial Optimal Transport for Universal Domain AdaptationYucheng Yang, Xiang Gu, Jian SunAAAI 2023 · 被引用 21 次
- COT: Unsupervised Domain Adaptation with Clustering and Optimal TransportYang Liu, Zhipeng Zhou, Baigui SunCVPR 2023
- Universal Domain Adaptation for Semantic SegmentationSeun-An Choe, Keon-Hee Park, Jinwoo Choi, Gyeong-Moon ParkCVPR 2025
- Domain Consensus Clustering for Universal Domain AdaptationGuangrui Li, Guoliang Kang, Yi Zhu, Yunchao Wei 等CVPR 2021
- Mutual Nearest Neighbor Contrast and Hybrid Prototype Self-Training for Universal Domain AdaptationLiang Chen, Qianjin Du, Yihang Lou, Jianzhong He 等AAAI 2022 · 被引用 33 次
