arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.12394cs.CVcs.LG

Affinity guided Geometric Semi-Supervised Metric Learning

Myntra Designs(Myntra设计公司);Indian Institute of Technology Madras(印度理工学院马德拉斯分校);Monash University(莫纳什大学)

Ujjal Kr Dutta, Mehrtash Harandi, Chellu Chandra Sekhar

英文摘要:

In this paper, we revamp the forgotten classical Semi-Supervised Distance Metric Learning (SSDML) problem from a Riemannian geometric lens, to leverage stochastic optimization within a end-to-end deep framework. The motivation comes from the fact that apart from a few classical SSDML approaches learning a linear Mahalanobis metric, deep SSDML has not been studied. We first extend existing SSDML methods to their deep counterparts and then propose a new method to overcome their limitations. Due to the nature of constraints on our metric parameters, we leverage Riemannian optimization. Our deep SSDML method with a novel affinity propagation based triplet mining strategy outperforms its competitors.

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

↑