arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1812.01945cs.LGstat.ML
收藏

基于污染相对比较的鲁棒有序嵌入

Robust Ordinal Embedding from Contaminated Relative Comparisons

Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);University of Chinese Academy of Sciences(中国科学院大学);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所)

Ke Ma, Qianqian Xu, Xiaochun Cao

摘要:

现有的有序嵌入方法通常遵循两个阶段的例程:首先使用离群值检测来挑选不一致的比较;然后从干净的数据中学习嵌入。然而,众所周知,以多阶段的方式学习会受到次优解的影响。在本文中,我们提出了一个统一的框架,共同识别污染的比较,并获得可靠的嵌入。该方法的优点有三个:(1)通过所提出的统一框架,极大地缓解了传统方法的次优性;(2)通过最小化相应的代价,该方法能够意识到全局不一致性,而传统方法只涉及局部不一致性;(3)采用秩等式约束的精确解,而不是考虑核范数约束。我们的研究得到了模拟实例和真实数据实验的支持。该框架为我们提供了一个很有前途的工具,从污染的比较鲁棒序数嵌入。

英文摘要:

Existing ordinal embedding methods usually follow a two-stage routine: outlier detection is first employed to pick out the inconsistent comparisons; then an embedding is learned from the clean data. However, learning in a multi-stage manner is well-known to suffer from sub-optimal solutions. In this paper, we propose a unified framework to jointly identify the contaminated comparisons and derive reliable embeddings. The merits of our method are three-fold: (1) By virtue of the proposed unified framework, the sub-optimality of traditional methods is largely alleviated; (2) The proposed method is aware of global inconsistency by minimizing a corresponding cost, while traditional methods only involve local inconsistency; (3) Instead of considering the nuclear norm heuristics, we adopt an exact solution for rank equality constraint. Our studies are supported by experiments with both simulated examples and real-world data. The proposed framework provides us a promising tool for robust ordinal embedding from the contaminated comparisons.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑