Discrete Scale-invariant Metric Learning For Efficient Collaborative Filtering

Abstract

Metric learning has attracted extensive interest for its ability to provide personalized recommendations based on the importance of observed user-item interactions. Current metric learning methods aim to push negative items away from the corresponding users and positive items by an absolute geometrical distance margin. However, items may come from imbalanced categories with different intra-class variations. Thus, the absolute distance margin may not be ideal for estimating the difference between user preferences over imbalanced items. To this end, we propose a new method, named discrete scale-invariant metric learning (DSIML), by adding binary constraints to users and items, which maps users and items into binary codes of a shared Hamming subspace to speed up the online recommendation. Specifically, we firstly propose a scale-invariant margin based on angles at the negative item points in the shared Hamming subspace. Then, we derive a scale-invariant triple hinge loss based on the marg

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyzhang2025discrete

Related papers

• Improving Collaborative Metric Learning With Efficient Negative Sampling (2019)10.07
• Dynamic Metric Learning From Pairwise Comparisons (2016)3.58
• Nonstationary Distance Metric Learning (2016)0.00
• Low-rank Robust Online Distance/similarity Learning Based On The Rescaled Hinge Loss (2020)7.50
• Metric Learning As A Service With Covariance Embedding (2022)3.58
• Directional Statistics-based Deep Metric Learning For Image Classification And Retrieval (2018)13.05
• No Fuss Distance Metric Learning Using Proxies (2017)20.03
• Adaptive Hierarchical Similarity Metric Learning With Noisy Labels (2021)10.74