Collaborative Residual Metric Learning
Tianjun Wei, Jianghong Ma, Tommy W. S. Chow
Abstract
In collaborative filtering, distance metric learning has been applied to matrix factorization techniques with promising results. However, matrix factorization lacks the ability of capturing collaborative information, which has been remarked by recent works and improved by interpreting user interactions as signals. This paper aims to find out how metric learning connect to these signal-based models. By adopting a generalized distance metric, we discovered that in signal-based models, it is easier to estimate the residual of distances, which refers to the difference between the distances from a user to a target item and another item, rather than estimating the distances themselves. Further analysis also uncovers a link between the normalization strength of interaction signals and the novelty of recommendation, which has been overlooked by existing studies. Based on the above findings, we propose a novel model to learn a generalized distance user-item distance metric to capture user preference in interaction signals by modeling the residuals of distance. The proposed CoRML model is then further improved in training efficiency by a newly introduced approximated ranking weight. Extensive experiments conducted on 4 public datasets demonstrate the superior performance of CoRML compared to the state-of-the-art baselines in collaborative filtering, along with high efficiency and the ability of providing novelty-promoted recommendations, shedding new light on the study of metric learning-based recommender systems.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 5bf65611-5bf1-451a-8c7d-45d1ebb8b845Cited by top-tier papers2
- Enhancing New-item Fairness in Dynamic Recommender SystemsHuizhong Guo, Zhu Sun, Dongxia Wang, Tianjun Wei et al.SIGIR 2025 · 7 citations
- Revisiting Nearest Neighbor for Tabular Data: A Deep Tabular Baseline Two Decades LaterHan-Jia Ye, Huai-Hong Yin, De-Chuan Zhan, Wei-Lun ChaoICLR 2025
Builds on7
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Are Graph Augmentations Necessary?: Simple Graph Contrastive Learning for RecommendationJunliang Yu, Hongzhi Yin, Xin Xia, Tong Chen et al.SIGIR 2022 · 658 citations
- Autoencoders that don't overfit towards the IdentityHarald SteckNeurIPS 2020 · 72 citations
- Investigating Accuracy-Novelty Performance for Graph-based Collaborative FilteringMinghao Zhao, Le Wu, Yile Liang, Lei Chen et al.SIGIR 2022 · 70 citations
- Symmetric Metric Learning with Adaptive Margin for RecommendationMingming Li, Shuai Zhang, Fuqing Zhu, Wanhui Qian et al.AAAI 2020 · 67 citations
Related papers
- The Minority Matters: A Diversity-Promoting Collaborative Metric Learning AlgorithmShilong Bao, Qianqian Xu, Zhiyong Yang, Yuan He et al.NeurIPS 2022 · 15 citations
- Revisiting Graph Based Collaborative Filtering: A Linear Residual Graph Convolutional Network ApproachLei Chen, Le Wu, Richang Hong, Kun Zhang et al.AAAI 2020 · 634 citations
- Neural Graph Matching based Collaborative FilteringYixin Su, Rui Zhang, Sarah M. Erfani, Junhao GanSIGIR 2021 · 45 citations
- Learning-Efficient Yet Generalizable Collaborative Filtering for Item RecommendationYuanhao Pu, Xiaolong Chen, Xu Huang, Jin Chen et al.ICML 2024 · 8 citations
- MCL: Mixed-Centric Loss for Collaborative FilteringZhaolin Gao, Zhaoyue Cheng, Felipe Pérez, Jianing Sun et al.WWW 2022 · 10 citations
