面向无监督域适应的稀疏正则最优传输模型
A Sparsity-Regularized Optimal Transport Model for Unsupervised Domain Adaptation
DOI: 10.12677/csa.2026.163097, PDF,    科研立项经费支持
作者: 李怡萱, 马丽涛*:河北工程大学数理科学与工程学院,河北 邯郸
关键词: 无监督域适应最优传输扩散成本边际惩罚稀疏正则Unsupervised Domain Adaptation Optimal Transport Diffusion Cost Marginal Penalty Sparsity Regularization
摘要: 无监督域适应旨在利用有标签的源域知识提升模型在无标签目标域上的性能。然而,现有方法大多依赖全局分布对齐来学习域不变特征,普遍面临以下挑战:相似性度量未能充分考虑数据内在的流形结构、域分布不平衡易导致对齐偏差,以及结果可解释性不强等。针对上述问题,本文提出一种基于扩散成本的稀疏正则最优传输模型。首先,基于扩散过程度量跨域样本在流形结构上的相似性,并结合源域标签信息构建成本矩阵,从而实现对非欧空间中跨分布样本相似性的准确刻画。其次,在目标函数中引入边际约束惩罚项,以增强模型对数据不平衡场景的适用性。此外,引入稀疏正则项来增强对齐样本间的可解释性,缓解由稠密传输计划引起的噪声误匹配问题。针对模型的非连续性特点,本文采用简化的SPG算法进行高效求解。最后,利用模型求解结果训练分类器,并在三组公开域适应数据集上进行实验评估,从准确率、精确率、召回率和F1分数四个指标对分类结果进行量化比较,实验结果表明,本文所提模型能够有效提升跨域分类精度,并缓解因域偏移与类别不平衡导致的分类偏差。
Abstract: Unsupervised domain adaptation aims to leverage labeled knowledge from a source domain to improve model performance on an unlabeled target domain. However, most existing methods rely on global distribution alignment to learn domain-invariant features, commonly facing the following challenges: similarity measures fail to adequately account for the intrinsic manifold structure of data; they are sensitive to domain distribution imbalance, which leads to biased alignment; and the interpretability of the alignment results remains limited. To address these issues, this paper proposes a diffusion sparse-regularization optimal transport. Specifically, a diffusion process is employed to measure cross-domain sample similarity on the underlying data manifold firstly. And then source domain label information is incorporated to construct the cost matrix, enabling accurate characterization of cross-distribution similarities in non-Euclidean spaces. Furthermore, a marginal constraint penalty term is introduced into the objective function to enhance robustness under imbalanced data scenarios. In addition, a sparsity regularization term is imposed to improve the interpretability of sample alignment and to mitigate noisy mismatches caused by dense transport plans. To efficiently solve the proposed non-smooth optimization problem, a simplified spectral projected gradient (SPG) algorithm is adopted. Finally, a classifier is trained based on the obtained transport plan, and extensive experiments are conducted on three public domain adaptation datasets. Quantitative evaluations in terms of accuracy, precision, recall, and F1-score demonstrate that the proposed method consistently improves cross-domain classification performance and effectively alleviates classification bias induced by domain shift and class imbalance.
文章引用:李怡萱, 马丽涛. 面向无监督域适应的稀疏正则最优传输模型[J]. 计算机科学与应用, 2026, 16(3): 177-192. https://doi.org/10.12677/csa.2026.163097

参考文献

[1] 王静, 刘嘉星, 宋婉莹, 等. 基于空间变换网络和特征分布校准的小样本皮肤图像分类模型[J]. 计算机应用, 2025, 45(8): 2720-2726.
[2] 周嘉文, 郑小盈, 祝永新, 等. 多头自注意力与双线性池化融合的心肌缺血影像分类[J]. 计算机工程, 2025, 51(11): 246-257.
[3] 袁志祥, 高永奇. InternDiffuseDet: 结合可变形卷积和扩散模型的目标检测方法[J]. 计算机工程与应用, 2024, 60(12): 203-215.
[4] Ganin, Y. and Lempitsky, V. (2015) Unsupervised Domain Adaptation by Backpropagation. International Conference on Machine Learning, 37, 1180-1189.
[5] Pan, S.J., Tsang, I.W., Kwok, J.T. and Yang, Q. (2011) Domain Adaptation via Transfer Component Analysis. IEEE Transactions on Neural Networks, 22, 199-210. [Google Scholar] [CrossRef] [PubMed]
[6] Sun, B., Feng, J. and Saenko, K. (2016) Return of Frustratingly Easy Domain Adaptation. Proceedings of the AAAI Conference on Artificial Intelligence, 30, 2058-2065. [Google Scholar] [CrossRef
[7] Chen, C., Fu, Z., Chen, Z., Jin, S., Cheng, Z., Jin, X., et al. (2020) HoMM: Higher-Order Moment Matching for Unsupervised Domain Adaptation. Proceedings of the AAAI Conference on Artificial Intelligence, 34, 3422-3429. [Google Scholar] [CrossRef
[8] von Seeger, A., Zou, D. and Lerman, G. (2025) Stein Discrepancy for Unsupervised Domain Adaptation. arXiv: 2502.03587.
[9] Courty, N., Flamary, R., Tuia, D. and Rakotomamonjy, A. (2017) Optimal Transport for Domain Adaptation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 39, 1853-1865. [Google Scholar] [CrossRef] [PubMed]
[10] Maman, G. and Talmon, R. (2025) Geometric Optimal Transport for Unsupervised Domain Adaptation. Transactions on Machine Learning Research.
https://openreview.net/forum?id=8Nef4vZUzU
[11] Das, D. and George Lee, C.S. (2018) Unsupervised Domain Adaptation Using Regularized Hyper-Graph Matching. 2018 25th IEEE International Conference on Image Processing (ICIP), Athens, 7-10 October 2018, 3758-3762. [Google Scholar] [CrossRef
[12] Kang, G., Jiang, L., Yang, Y. and Hauptmann, A.G. (2019) Contrastive Adaptation Network for Unsupervised Domain Adaptation. 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Long Beach, 15-20 June 2019, 4893-4902. [Google Scholar] [CrossRef
[13] Li, J., Chen, E., Ding, Z., Zhu, L., Lu, K. and Shen, H.T. (2021) Maximum Density Divergence for Domain Adaptation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 43, 3918-3930. [Google Scholar] [CrossRef] [PubMed]
[14] He, Y., Chen, J., Zhang, J., Ke, W. and Gong, Y. (2025) A Bayesian Dual-Pathway Network for Unsupervised Domain Adaptation. Pattern Recognition, 164, Article 111498. [Google Scholar] [CrossRef
[15] 赵恩庭, 张长春, 赵海涛, 等. 基于对抗学习的野生动物图像域适应识别方法[J]. 林业科学, 2025, 61(4): 1-8.
[16] Wang, X., Jiang, H., Mu, M. and Dong, Y. (2025) A Dynamic Collaborative Adversarial Domain Adaptation Network for Unsupervised Rotating Machinery Fault Diagnosis. Reliability Engineering & System Safety, 255, Article 110662. [Google Scholar] [CrossRef
[17] Courty, N., Flamary, R., Habrard, A. and Rakotomamonjy, A. (2017) Joint Distribution Optimal Transportation for Do-main Adaptation. Advances in Neural Information Processing Systems, 30, 3733-3742.
[18] Damodaran, B.B., Kellenberger, B., Flamary, R., Tuia, D. and Courty, N. (2018) Deepjdot: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptation. In: Ferrari, V., Hebert, M., Sminchisescu, C. and Weiss, Y. Eds., Lecture Notes in Computer Science, Springer International Publishing, 467-483. [Google Scholar] [CrossRef
[19] Ida, Y., Kanai, S., Adachi, K., Kumagai, A. and Fujiwara, Y. (2023) Fast Regularized Discrete Optimal Transport with Group-Sparse Regularizers. Proceedings of the AAAI Conference on Artificial Intelligence, 37, 7980-7987. [Google Scholar] [CrossRef
[20] Nguyen, T., Nguyen, V., Le, T., Zhao, H., Tran, Q.H. and Phung, D. (2024) A Class-Aware Optimal Transport Approach with Higher-Order Moment Matching for Unsupervised Domain Adaptation. arXiv:2401.15952.
[21] Mensch, A. and Peyré, G. (2020) Online Sinkhorn: Optimal Transport Distances from Sample Streams. Advances in Neural Information Processing Systems, 33, 1657-1667.
[22] Bonafini, M. and Schmitzer, B. (2021) Domain Decomposition for Entropy Regularized Optimal Transport. Numerische Mathematik, 149, 819-870. [Google Scholar] [CrossRef
[23] Lin, T., Ho, N. and Jordan, M. I. (2022) On the Efficiency of Entropic Regularized Algorithms for Optimal Transport. Journal of Machine Learning Research, 23, 6143-6184.
[24] Burkard, R.E., Klinz, B. and Rudolf, R. (1996) Perspectives of Monge Properties in Optimization. Discrete Applied Mathematics, 70, 95-161. [Google Scholar] [CrossRef
[25] Kantorovich, L.V. (2006) On a Problem of Monge. Journal of Mathematical Sciences, 133, 1383-1383. [Google Scholar] [CrossRef
[26] Caffarelli, L. and McCann, R. (2010) Free Boundaries in Optimal Transport and Monge-Ampère Obstacle Problems. Annals of Mathematics, 171, 673-730. [Google Scholar] [CrossRef
[27] Chapel, L., Alaya, M. Z. and Gasso, G. (2020) Partial Optimal Transport with Applications on Positive-Unlabeled Learning. Advances in Neural Information Processing Systems, 33, 2903-2913.
[28] Zhang, C., Ren, H. and He, X. (2024) P2OT: Progressive Partial Optimal Transport for Deep Imbalanced Clustering. arXiv:2401.09266.
[29] Cuturi, M. (2013) Sinkhorn Distances: Lightspeed Computation of Optimal Transport. Advances in Neural Information Processing Systems, 26, 2292-2300.
[30] Ma, L., Bian, W. and Xue, X. (2024) Point Clouds Matching Based on Discrete Optimal Transport. IEEE Transactions on Image Processing, 33, 5650-5662. [Google Scholar] [CrossRef] [PubMed]
[31] Lacombe, T. (2023) An Homogeneous Unbalanced Regularized Optimal Transport Model with Applications to Optimal Transport with Boundary. International Conference on Artificial Intelligence and Statistics, 206, 7311-7330.
[32] Tang, W., Ma, Z., Sun, H. and Wang, J. (2023) Learning Sparse Alignments via Optimal Transport for Cross-Domain Fake News Detection. ICASSP 2023-2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Rhodes Island, 4-10 June 2023, 1-5. [Google Scholar] [CrossRef
[33] Haasler, I. and Elvander, F. (2024) Multi-Frequency Tracking via Group-Sparse Optimal Transport. IEEE Control Systems Letters, 8, 1048-1053. [Google Scholar] [CrossRef
[34] Fan, J. and Li, R. (2001) Variable Selection via Nonconcave Penalized Likelihood and Its Oracle Properties. Journal of the American Statistical Association, 96, 1348-1360. [Google Scholar] [CrossRef
[35] Zhang, C. (2010) Nearly Unbiased Variable Selection under Minimax Concave Penalty. The Annals of Statistics, 38, 894-942. [Google Scholar] [CrossRef
[36] Bian, W. and Chen, X. (2020) A Smoothing Proximal Gradient Algorithm for Nonsmooth Convex Regression with Cardinality Penalty. SIAM Journal on Numerical Analysis, 58, 858-883. [Google Scholar] [CrossRef
[37] Radford, A., Kim, J.W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., Krueger, G. and Sutskever, I. (2021) Learning Transferable Visual Models from Natural Language Supervision. Interna-tional Conference on Machine Learning, 139, 8748-8763.
[38] Fernando, B., Habrard, A., Sebban, M. and Tuytelaars, T. (2013) Unsupervised Visual Domain Adaptation Using Subspace Alignment. 2013 IEEE International Conference on Computer Vision, Sydney, 1-8 December 2013, 2960-2967. [Google Scholar] [CrossRef
[39] Liu, T., Puigcerver, J. and Blondel, M. (2022) Sparsity-Constrained Optimal Transport. arXiv:2209.15466.
[40] Friedman, M. (1937) The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance. Journal of the American Statistical Association, 32, 675-701. [Google Scholar] [CrossRef
[41] Hommel, G. (1988) A Stagewise Rejective Multiple Test Procedure Based on a Modified Bonferroni Test. Biometrika, 75, 383-386. [Google Scholar] [CrossRef
[42] 附 录
[43] 注意到函数是凸函数,关于简化的SPG算法有如下收敛结论:
[44] 定理(单调下降性)算法生成的序列满足
[45] 其中。
[46] 证明:因为子问题是强凸函数,且满足线搜索下降条件时,对于任意,有
[47] (14)
[48] 重新整理得到
[49] (15)
[50] 下降条件可写为
[51] (16)
[52] 结合(15)和(16)式可以得到
[53] (17)
[54] 因为是凸函数,有:
[55] (18)
[56] 由(17)和(18)式得到
[57] (19)
[58] 令,我们得到
[59] (20)
[60] 因此
[61] (21)
[62] 这表明单调不增且有下界(因为在紧集上有界),故收敛。