Understanding and Scaling Collaborative Filtering Optimization from the Perspective of Matrix Rank
Donald Loveland, Xinyi Wu, Tong Zhao, Danai Koutra, Neil Shah, Mingxuan Ju
摘要
Collaborative Filtering (CF) methods dominate real-world recommender systems given their ability to learn high-quality, sparse ID-embedding tables that effectively capture user preferences. These tables scale linearly with the number of users and items, and are trained to ensure high similarity between embeddings of interacted user-item pairs, while maintaining low similarity for non-interacted pairs. Despite their high performance, encouraging dispersion for non-interacted pairs necessitates expensive regularization (e.g., negative sampling), hurting runtime and scalability. Existing research tends to address these challenges by simplifying the learning process, either by reducing model complexity or sampling data, trading performance for runtime. In this work, we move beyond model-level modifications and study the properties of the embedding tables under different learning strategies. Through theoretical analysis, we find that the singular values of the embedding tables are intrinsically linked to different CF loss functions. These findings are empirically validated on real-world datasets, demonstrating the practical benefits of higher stable rank -- a continuous version of matrix rank which encodes the distribution of singular values. Based on these insights, we propose an efficient warm-start strategy that regularizes the stable rank of the user and item embeddings. We show that stable rank regularization during early training phases can promote higher-quality embeddings, resulting in training speed improvements of up to 65.9%. Additionally, stable rank regularization can act as a proxy for negative sampling, allowing for performance gains of up to 21.2% over loss functions with small negative sampling ratios. Overall, our analysis unifies current CF methods under a new perspective -- their optimization of stable rank -- motivating a flexible regularization method that is easy to implement, yet effective at enhancing CF systems.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Bypassing Skip-Gram Negative Sampling: Dimension Regularization as a More Efficient Alternative for Graph EmbeddingsDavid Liu, Arjun Seshadri, Tina Eliassi-Rad, Johan UganderKDD 2025
- On the Role of Weight Decay in Collaborative Filtering: A Popularity PerspectiveDonald Loveland, Mingxuan Ju, Tong Zhao, Neil Shah 等KDD 2025
它引用的顶会 Paper8
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li 等SIGIR 2020 · 被引用 4,448 次
- Barlow Twins: Self-Supervised Learning via Redundancy ReductionJure Zbontar, Li Jing, Ishan Misra, Yann LeCun 等ICML 2021 · 被引用 2,942 次
- DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank SystemsRuoxi Wang, Rakesh Shivanna, Derek Zhiyuan Cheng, Sagar Jain 等WWW 2021 · 被引用 793 次
- Understanding Dimensional Collapse in Contrastive Self-supervised LearningLi Jing, Pascal Vincent, Yann LeCun, Yuandong TianICLR 2022 · 被引用 467 次
- Towards Representation Alignment and Uniformity in Collaborative FilteringChenyang Wang, Yuanqing Yu, Weizhi Ma, Min Zhang 等KDD 2022 · 被引用 179 次
相关 Paper
- StabCF: A Stabilized Training Method for Collaborative FilteringXi Wu, Wenzhe Zhang, Liangwei Yang, Yi Zhao 等KDD 2026
- Personalized Ranking with Importance SamplingDefu Lian, Qi Liu, Enhong ChenWWW 2020 · 被引用 98 次
- Learning to Warm Up Cold Item Embeddings for Cold-start Recommendation with Meta Scaling and Shifting NetworksYongchun Zhu, Ruobing Xie, Fuzhen Zhuang, Kaikai Ge 等SIGIR 2021 · 被引用 129 次
- Efficient Heterogeneous Collaborative Filtering without Negative Sampling for RecommendationChong Chen, Min Zhang, Yongfeng Zhang, Weizhi Ma 等AAAI 2020 · 被引用 185 次
- Clustered Embedding Learning for Recommender SystemsYizhou Chen, Guangda Huzhang, Anxiang Zeng, Qingtao Yu 等WWW 2023 · 被引用 13 次
