Fast Stochastic Ordinal Embedding with Variance Reduction and Adaptive Step Size

IEEE Transactions on Knowledge and Data Engineering(2021)

引用 4|浏览128
暂无评分
摘要
Learning representation from relative similarity comparisons, often called ordinal embedding, gains rising attention in recent years. Most of the existing methods are based on semi-definite programming (SDP), which is generally time-consuming and degrades the scalability, especially confronting large-scale data. To overcome this challenge, we propose a stochastic algorithm called SVRG-SBB, which h...
更多
查看译文
关键词
Convergence,Euclidean distance,Symmetric matrices,Scalability,Computational efficiency,Matrix decomposition
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要