The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm
Not on the map. Why?
Abstract (arXiv)
Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called textitDiversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a textitdiversity control regularization term to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 28 of its 67 references that are in the map. First posted on arXiv 30 Sep 2022.
Builds on
28 of 67 references.
References · 28
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017Neural Collaborative Filteringcited by 1,111
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
- 2019Neural Graph Collaborative Filteringcited by 661
- 2019Learning Disentangled Representations for Recommendationcited by 110
- 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 101
- 2022AUC Maximization in the Era of Big Data and AI: A Surveycited by 100
- 2020Denoising Implicit Feedback for Recommendationcited by 80
- 2020Understanding Negative Sampling in Graph Representation Learningcited by 66
- 2019Generalization bounds for deep convolutional neural networkscited by 59
- 2021A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learningcited by 57
- 2018Outer Product-based Neural Collaborative Filteringcited by 41
16 more
- 2017Latent Relational Metric Learning via Memory-based Attention for Collaborative Rankingcited by 39
- 2016A Neural Autoregressive Approach to Collaborative Filteringcited by 23
- 2021Bootstrapping User and Item Representations for One-Class Collaborative Filteringcited by 22
- 2019Recommendations and User Agency: The Reachability of Collaboratively-Filtered Informationcited by 21
- 2020Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approachcited by 20
- 2019Multi-Component Graph Convolutional Collaborative Filteringcited by 17
- 2019Collaborative Translational Metric Learningcited by 16
- 2019Improving Collaborative Metric Learning with Efficient Negative Samplingcited by 11
- 2015Local Rademacher Complexity Bounds based on Covering Numberscited by 10
- 2021The Stereotyping Problem in Collaboratively Filtered Recommender Systemscited by 10
- 2017The Sample Complexity of Online One-Class Collaborative Filteringcited by 9
- 2021Quantifying Availability and Discovery in Recommender Systems via Stochastic Reachabilitycited by 8
- 2021Rethinking Neural vs. Matrix-Factorization Collaborative Filtering: the Theoretical Perspectivescited by 8
- 2019Collaborative Metric Learning with Memory Network for Multi-Relational Recommender Systemscited by 7
- 2021Hierarchical Latent Relation Modeling for Collaborative Metric Learningcited by 6
- 2021Density-Ratio Based Personalised Ranking from Implicit Feedbackcited by 4
Built on by
Citing papers per year: 2023: 2; 2024: 4; 2025: 3.
9 papers.
- 2024AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentationcited by 18
- 2025One Image is Worth a Thousand Words: A Usability Preservable Text-Image Collaborative Erasing Frameworkcited by 16
- 2024Improved Diversity-Promoting Collaborative Metric Learning for Recommendationcited by 9
- 2023adSformers: Personalization from Short-Term Sequences and Diversity of Representations in Etsy Adscited by 4
- 2023Break Out of a Pigeonhole: A Unified Framework for Examining Miscalibration, Bias, and Stereotype in Recommender Systemscited by 2
- 2025Tree of Preferences for Diversified Recommendationcited by 2
- 2024Geometric Collaborative Filtering with Convergencecited by 1
- 2024Towards a Theoretical Understanding of Two Tower Recommendation Modelscited by 0
- 2025Cross-Temporal 3D Gaussian Splatting for Sparse-View Guided Scene Updatecited by 0
- 2025Tree of Preferences for Diversified Recommendation24 Dec 2025
- 2025Cross-Temporal 3D Gaussian Splatting for Sparse-View Guided Scene Update29 Nov 2025
- 2025One Image is Worth a Thousand Words: A Usability Preservable Text-Image Collaborative Erasing Framework16 May 2025
- 2024Geometric Collaborative Filtering with Convergence4 Oct 2024
- 2024AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation30 Sep 2024
- 2024Improved Diversity-Promoting Collaborative Metric Learning for Recommendation2 Sep 2024
- 2024Towards a Theoretical Understanding of Two Tower Recommendation Models23 Feb 2024
- 2023Break Out of a Pigeonhole: A Unified Framework for Examining Miscalibration, Bias, and Stereotype in Recommender Systems29 Dec 2023
- 2023adSformers: Personalization from Short-Term Sequences and Diversity of Representations in Etsy Ads2 Feb 2023