Low-Rank Optimal Transport for Robust Domain Adaptation

• Published in: IEEE/CAA journal of automatica sinica Vol. 11; no. 7; pp. 1667 - 1680
• Main Authors: Xu, Bingrong, Yin, Jianhua, Lian, Cheng, Su, Yixin, Zeng, Zhigang
• Format: Journal Article
• Language: English
• Published: Piscataway Chinese Association of Automation (CAA) 01.07.2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE); School of Automation,Wuhan University of Technology,Wuhan 430070,China%Intelligent Transportation Systems Research Center,Wuhan University of Technology,Wuhan 430063; Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China,Wuhan 430074,China; Chongqing Research Institute,Wuhan University of Technology,Chongqing,China%School of Artificial Intelligence and Automation,Huazhong University of Science and Technology,Wuhan 430074
• Subjects: Adaptation; Adaptation models; Convergence; Convex functions; Convexity; Domain adaptation; Lagrange multiplier; low-rank constraint; Noise; noise corruption; Noise measurement; optimal transport; Robustness; Robustness (mathematics); Training; Domain adaptation; optimal transport; noise cor-ruption; low-rank constraint
• ISSN: 2329-9266; 2329-9274
• DOI: 10.1109/JAS.2024.124344

When encountering the distribution shift between the source (training) and target (test) domains, domain adaptation attempts to adjust the classifiers to be capable of dealing with different domains. Previous domain adaptation research has achieved a lot of success both in theory and practice under the assumption that all the examples in the source domain are well-labeled and of high quality. However, the methods consistently lose robustness in noisy settings where data from the source domain have corrupted labels or features which is common in reality. Therefore, robust domain adaptation has been introduced to deal with such problems. In this paper, we attempt to solve two interrelated problems with robust domain adaptation: distribution shift across domains and sample noises of the source domain. To disentangle these challenges, an optimal transport approach with low-rank constraints is applied to guide the domain adaptation model training process to avoid noisy information influence. For the domain shift problem, the optimal transport mechanism can learn the joint data representations between the source and target domains using a measurement of discrepancy and preserve the discriminative information. The rank constraint on the transport matrix can help recover the corrupted subspace structures and eliminate the noise to some extent when dealing with corrupted source data. The solution to this relaxed and regularized optimal transport framework is a convex optimization problem that can be solved using the Augmented Lagrange Multiplier method, whose convergence can be mathematically proved. The effectiveness of the proposed method is evaluated through extensive experiments on both synthetic and real-world datasets.