首页> 外文会议>IEEE Conference on Computer Vision and Pattern Recognition >Beyond the shortest path: Unsupervised domain adaptation by Sampling Subspaces along the Spline Flow
【24h】

Beyond the shortest path: Unsupervised domain adaptation by Sampling Subspaces along the Spline Flow

机译:超出最短路径:通过沿着样条流采样子空间来进行无监督域适应

获取原文

摘要

Recently, a particular paradigm [18] in the domain adaptation field has received considerable attention by introducing novel and important insights to the problem. In this case, the source and target domains are represented in the form of subspaces, which are treated as points on the Grassmann manifold. The geodesic curve between them is sampled to obtain intermediate points. Then a classifier is learnt using the projections of the data onto these subspaces. Despite its relevance and popularity, this paradigm [18] contains some limitations. Firstly, in real-world applications, that simple curve (i.e. shortest path) does not provide the necessary flexibility to model the domain shift between the training and testing data sets. Secondly, by using the geodesic curve, we are restricted to only one source domain, which does not allow to take fully advantage of the multiple datasets that are available nowadays. It is then, natural to ask whether this popular concept could be extended to deal with more complex curves and to integrate multi-sources domains. This is a hard problem considering the Riemannian structure of the space, but we propose a mathematically well-founded idea that enables us to solve it. We exploit the geometric insight of rolling maps [30] to compute a spline curve on the Grassmann manifold. The benefits of the proposed idea are demonstrated through several empirical studies on standard datasets. This novel concept allows to explicitly integrate multi-source domains while the previous one [18] uses the mean of all sources. This enables to model better the domain shift and take fully advantage of the training datasets.
机译:最近,域适应领域的特定范式[18]通过对问题引入新颖和重要的见解来获得了相当大的关注。在这种情况下,源极和目标域以子空间的形式表示,其被视为基于基地歧管的点。它们之间的测地曲线被取样以获得中间点。然后使用数据的投影来学习对这些子空间的分类器。尽管有其相关性和普及,但这种范式[18]含有一些限制。首先,在现实世界应用中,简单的曲线(即最短路径)没有提供对培训和测试数据集之间的域移位的必要灵活性。其次,通过使用GeodeSic曲线,我们仅限于一个源域,这不允许完全利用现在可用的多个数据集。然后,自然地询问这种流行的概念是否可以扩展到处理更复杂的曲线并集成多源域。考虑到riemananian结构的空间的结构,但我们提出了一个数学上得以创立的想法,使我们能够解决它。我们利用滚动地图的几何洞察[30]来计算Grassmann歧管上的样条曲线。通过标准数据集的若干实证研究证明了提出的想法的好处。这种新颖的概念允许显式集成多源域,而前一个[18]使用所有源的均值。这使得可以更好地模拟域移位并完全优势训练数据集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号