Improving Collaborative Metric Learning with Efficient Negative Sampling
Not on the map. Why?
Abstract (arXiv)
Distance metric learning based on triplet loss has been applied with success in a wide range of applications such as face recognition, image retrieval, speaker change detection and recently recommendation with the CML model. However, as we show in this article, CML requires large batches to work reasonably well because of a too simplistic uniform negative sampling strategy for selecting triplets. Due to memory limitations, this makes it difficult to scale in high-dimensional scenarios. To alleviate this problem, we propose here a 2-stage negative sampling strategy which finds triplets that are highly informative for learning. Our strategy allows CML to work effectively in terms of accuracy and popularity bias, even when the batch size is an order of magnitude smaller than what would be needed with the default uniform sampling. We demonstrate the suitability of the proposed strategy for recommendation and exhibit consistent positive results across various datasets.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 3; 2023: 1; 2024: 3.
11 papers.
- 2021ConvFiT: Conversational Fine-Tuning of Pretrained Language Modelscited by 25
- 2022Rethinking Collaborative Metric Learning: Toward an Efficient Alternative without Negative Samplingcited by 14
- 2024Does Negative Sampling Matter? A Review with Insights into its Theory and Applicationscited by 14
- 2022The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithmcited by 9
- 2024Improved Diversity-Promoting Collaborative Metric Learning for Recommendationcited by 9
- 2022Exploring the Algorithm-Dependent Generalization of AUPRC Optimization with List Stabilitycited by 8
- 2021Hierarchical Latent Relation Modeling for Collaborative Metric Learningcited by 6
- 2021Dynamic Slate Recommendation with Gated Recurrent Units and Thompson Samplingcited by 5
- 2021Semantically-Conditioned Negative Samples for Efficient Contrastive Learningcited by 4
- 2024Transformers Meet ACT-R: Repeat-Aware and Sequential Listening Session Recommendationcited by 4
- 2023Proxy-based Item Representation for Attribute and Context-aware Recommendationcited by 2
- 2024Improved Diversity-Promoting Collaborative Metric Learning for Recommendation2 Sep 2024
- 2024Transformers Meet ACT-R: Repeat-Aware and Sequential Listening Session Recommendation29 Aug 2024
- 2024Does Negative Sampling Matter? A Review with Insights into its Theory and Applications27 Feb 2024
- 2023Proxy-based Item Representation for Attribute and Context-aware Recommendation11 Dec 2023
- 2022The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm30 Sep 2022
- 2022Exploring the Algorithm-Dependent Generalization of AUPRC Optimization with List Stability27 Sep 2022
- 2022Rethinking Collaborative Metric Learning: Toward an Efficient Alternative without Negative Sampling23 Jun 2022
- 2021ConvFiT: Conversational Fine-Tuning of Pretrained Language Models21 Sep 2021
- 2021Hierarchical Latent Relation Modeling for Collaborative Metric Learning26 Jul 2021
- 2021Dynamic Slate Recommendation with Gated Recurrent Units and Thompson Sampling30 Apr 2021
- 2021Semantically-Conditioned Negative Samples for Efficient Contrastive Learning12 Feb 2021