Riemannian representation learning for multi-source domain adaptation
Pattern Recognition(2023)
摘要
•For the MSDA problem we show that the target error is bounded by the average source error and the average Hellinger distance.•We introduce the RRL approach that aligns distributions in the representation space under the average empirical Hellinger distance.•We derive the average empirical Hellinger distance by constructing and solving unconstrained convex optimization problems.•We conduct comprehensive experiments on several image datasets to demonstrate the superior adaptation performance of the RRL approach.
更多查看译文
关键词
Convex optimization,Hellinger distance,Multi-source domain adaptation,Representation learning,Riemannian manifold
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要