Low-rank Robust Online Distance/similarity Learning Based On The Rescaled Hinge Loss

Abstract

An important challenge in metric learning is scalability to both size and dimension of input data. Online metric learning algorithms are proposed to address this challenge. Existing methods are commonly based on (Passive Aggressive) PA approach. Hence, they can rapidly process large volumes of data with an adaptive learning rate. However, these algorithms are based on the Hinge loss and so are not robust against outliers and label noise. Also, existing online methods usually assume training triplets or pairwise constraints are exist in advance. However, many datasets in real-world applications are in the form of input data and their associated labels. We address these challenges by formulating the online Distance-Similarity learning problem with the robust Rescaled hinge loss function. The proposed model is rather general and can be applied to any PA-based online Distance-Similarity algorithm. Also, we develop an efficient robust one-pass triplet construction algorithm. Finally, to pro

Stats

• citations9
• S2 citations—
• github stars0
• HF likes0
• heat score7.50
• arxiv keyzabihzadeh2020low

Related papers

• Large Scale Local Online Similarity/distance Learning Framework Based On Passive/aggressive (2018)2.26
• Sparse Online Relative Similarity Learning (2021)2.26
• Discrete Scale-invariant Metric Learning For Efficient Collaborative Filtering (2025)0.00
• Dynamic Metric Learning From Pairwise Comparisons (2016)3.58
• Provably Robust Metric Learning (2020)2.08
• Nonstationary Distance Metric Learning (2016)0.00
• Similarity Function Tracking Using Pairwise Comparisons (2017)2.26
• Rethinking Preventing Class-collapsing In Metric Learning With Margin-based Losses (2020)9.23