Sparse Online Relative Similarity Learning

Abstract

For many data mining and machine learning tasks, the quality of a similarity measure is the key for their performance. To automatically find a good similarity measure from datasets, metric learning and similarity learning are proposed and studied extensively. Metric learning will learn a Mahalanobis distance based on positive semi-definite (PSD) matrix, to measure the distances between objectives, while similarity learning aims to directly learn a similarity function without PSD constraint so that it is more attractive. Most of the existing similarity learning algorithms are online similarity learning method, since online learning is more scalable than offline learning. However, most existing online similarity learning algorithms learn a full matrix with d 2 parameters, where d is the dimension of the instances. This is clearly inefficient for high dimensional tasks due to its high memory and computational complexity. To solve this issue, we introduce several Sparse Online Relative Sim

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keyyao2021sparse

Related papers

• Large Scale Local Online Similarity/distance Learning Framework Based On Passive/aggressive (2018)2.26
• Similarity Function Tracking Using Pairwise Comparisons (2017)2.26
• Super-sparse Learning In Similarity Spaces (2017)5.24
• Deep Metric Learning Using Similarities From Nonlinear Rank Approximations (2019)2.26
• Metric Learning By Similarity Network For Deep Semi-supervised Learning (2020)3.58
• Dynamic Metric Learning From Pairwise Comparisons (2016)3.58
• Nonstationary Distance Metric Learning (2016)0.00
• A New Similarity Space Tailored For Supervised Deep Metric Learning (2020)3.58