融合稀疏与稠密视角,让协同过滤在冷门物品上表现更稳。
Why not Collaborative Filtering in Dual View? Bridging Sparse and Dense Models
- 用双向对齐机制结合语义嵌入与交互结构。
- 冷门物品推荐效果显著提升,矩阵分解模型达顶尖水平。
- 可直接插入现有模型,适合做推荐系统优化的工程师。
协同过滤(CF)仍是现代推荐系统的核心,当前主流为基于稠密嵌入的方法。然而,理论分析表明,在数据极度稀疏时,参数型稠密模型对冷门物品建模存在根本性的信噪比(SNR)上限。为此,我们提出统一框架SaD(Sparse and Dense),将稠密嵌入的语义表达力与稀疏交互模式的结构可靠性相结合。理论上证明,双视角对齐可获得严格更优的全局信噪比。具体而言,SaD引入轻量级双向对齐机制:稠密视图通过注入语义相关性增强稀疏视图,稀疏视图则通过显式结构信号正则化稠密模型。大量实验表明,在此双视角对齐下,即使简单的矩阵分解风格稠密模型也能达到顶尖性能。此外,SaD可即插即用,适用于多种现有推荐模型,凸显了从双视角利用协同过滤的持久价值。真实世界基准测试显示,SaD持续优于强基线,在BarsMatch排行榜上排名第一。代码已公开于https://github.com/harris26-G/SaD。
原文摘要 · Abstract (English)
Collaborative Filtering (CF) remains the cornerstone of modern recommender systems, with dense embedding--based methods dominating current practice. However, these approaches suffer from a critical limitation: our theoretical analysis reveals a fundamental signal-to-noise ratio (SNR) ceiling when modeling unpopular items, where parameter-based dense models experience diminishing SNR under severe data sparsity. To overcome this bottleneck, we propose SaD (Sparse and Dense), a unified framework that integrates the semantic expressiveness of dense embeddings with the structural reliability of sparse interaction patterns. We theoretically show that aligning these dual views yields a strictly superior global SNR. Concretely, SaD introduces a lightweight bidirectional alignment mechanism: the dense view enriches the sparse view by injecting semantic correlations, while the sparse view regularizes the dense model through explicit structural signals. Extensive experiments demonstrate that, under this dual-view alignment, even a simple matrix factorization--style dense model can achieve state-of-the-art performance. Moreover, SaD is plug-and-play and can be seamlessly applied to a wide range of existing recommender models, highlighting the enduring power of collaborative filtering when leveraged from dual perspectives. Further evaluations on real-world benchmarks show that SaD consistently outperforms strong baselines, ranking first on the BarsMatch leaderboard. The code is publicly available at https://github.com/harris26-G/SaD.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。