序数数据
领域(数学分析)
高斯分布
条件概率分布
计算机科学
约束(计算机辅助设计)
序数回归
数学
人工智能
顺序量表
算法
理论计算机科学
模式识别(心理学)
机器学习
统计
数学分析
物理
几何学
量子力学
作者
Xiaofeng Liu,Site Li,Yubin Ge,Pengyi Ye,Jane You,Jun Lü
标识
DOI:10.1109/tpami.2022.3183115
摘要
There has been a growing interest in unsupervised domain adaptation (UDA) to alleviate the data scalability issue, while the existing works usually focus on classifying independently discrete labels. However, in many tasks (e.g., medical diagnosis), the labels are discrete and successively distributed. The UDA for ordinal classification requires inducing non-trivial ordinal distribution prior to the latent space. Target for this, the partially ordered set (poset) is defined for constraining the latent vector. Instead of the typically i.i.d. Gaussian latent prior, in this work, a recursively conditional Gaussian (RCG) set is proposed for ordered constraint modeling, which admits a tractable joint distribution prior. Furthermore, we are able to control the density of content vectors that violate the poset constraint by a simple "three-sigma rule". We explicitly disentangle the cross-domain images into a shared ordinal prior induced ordinal content space and two separate source/target ordinal-unrelated spaces, and the self-training is worked on the shared space exclusively for ordinal-aware domain alignment. Extensive experiments on UDA medical diagnoses and facial age estimation demonstrate its effectiveness.
科研通智能强力驱动
Strongly Powered by AbleSci AI