On the Role of Weight Decay in Collaborative Filtering: A Popularity Perspective
Donald Loveland, Mingxuan Ju, Tong Zhao, Neil Shah, Danai Koutra
摘要
Collaborative filtering (CF) enables large-scale recommendation systems by encoding information from historical user-item interactions into dense ID-embedding tables. However, as embedding tables grow, closed-form solutions become impractical, often necessitating the use of mini-batch gradient descent for training. Despite extensive work on designing loss functions to train CF models, we argue that one core component of these pipelines is heavily overlooked: weight decay. Attaining high-performing models typically requires careful tuning of weight decay, regardless of loss, yet its necessity is not well understood. In this work, we question why weight decay is crucial in CF pipelines and how it impacts training. Through theoretical and empirical analysis, we surprisingly uncover that weight decay's primary function is to encode popularity information into the magnitudes of the embedding vectors. Moreover, we find that tuning weight decay acts as a coarse, non-linear, knob to influence preference towards popular or unpopular items. Based on these findings, we propose PRISM (Popularity-awaRe Initialization Strategy for embedding Magnitudes), a straightforward yet effective solution to simplify the training of high-performing CF models. PRISM pre-encodes the popularity information typically learned through weight decay, eliminating its necessity. Our experiments show that PRISM improves performance by up to 4.77% and reduces training times by 38.48%, compared to state-of-the-art training strategies. Additionally, we parameterize PRISM to modulate the initialization strength, offering a cost-effective and meaningful strategy to mitigate popularity bias.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- AgentDR: Dynamic Recommendation with Implicit Item-Item Relations via LLM-based AgentsMingdai Yang, Nurendra Choudhary, Jiangshu Du, Edward W. Huang 等WWW 2026
- Rethinking Popularity Bias in Collaborative Filtering via Analytical Vector DecompositionLingfeng Liu, Yixin Song, Dazhong Shen, Bing Yin 等KDD 2026
它引用的顶会 Paper10
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li 等SIGIR 2020 · 被引用 4,448 次
- 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 次
- Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender SystemTianxin Wei, Fuli Feng, Jiawei Chen, Ziwei Wu 等KDD 2021 · 被引用 246 次
- Towards Representation Alignment and Uniformity in Collaborative FilteringChenyang Wang, Yuanqing Yu, Weizhi Ma, Min Zhang 等KDD 2022 · 被引用 179 次
- AutoDebias: Learning to Debias for RecommendationJiawei Chen, Hande Dong, Yang Qiu, Xiangnan He 等SIGIR 2021 · 被引用 167 次
相关 Paper
- Understanding and Scaling Collaborative Filtering Optimization from the Perspective of Matrix RankDonald Loveland, Xinyi Wu, Tong Zhao, Danai Koutra 等WWW 2025 · 被引用 9 次
- Post-hoc Popularity Bias Correction in GNN-based Collaborative FilteringMd Aminul Islam, Elena Zheleva, Ren WangWWW 2026
- Mitigating the Popularity Bias of Graph Collaborative Filtering: A Dimensional Collapse PerspectiveYifei Zhang, Hao Zhu, Yankai Chen, Zixing Song 等NeurIPS 2023 · 被引用 47 次
- Causal Intervention for Leveraging Popularity Bias in RecommendationYang Zhang, Fuli Feng, Xiangnan He, Tianxin Wei 等SIGIR 2021 · 被引用 431 次
- Does Weighting Improve Matrix Factorization for Recommender Systems?Alex Ayoub, Samuel Robertson, Dawen Liang, Harald Steck 等WWW 2025
