mlsanityData to 7 Oct 2026

Why not Collaborative Filtering in Dual View? Bridging Sparse and Dense Models

arXiv 2601.09286 ↗First posted 14 Jan 2026cs.IR cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 22 of its 40 references that are in the map. First posted on arXiv 14 Jan 2026.

Builds on

22 of 40 references.

References · 22

  1. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  2. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  3. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  4. 2017Neural Collaborative Filteringcited by 1,108
  5. 2016Wide & Deep Learning for Recommender Systemscited by 745
  6. 2019Graph Neural Networks for Social Recommendationcited by 711
  7. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  8. 2020Self-supervised Graph Learning for Recommendationcited by 305
  9. 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
  10. 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 119
  11. 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 93
  12. 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
10 more
  1. 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
  2. 2022Hypergraph Contrastive Collaborative Filteringcited by 63
  3. 2022XSimGCL: Towards Extremely Simple Graph Contrastive Learning for Recommendationcited by 57
  4. 2021How Powerful is Graph Convolution for Recommendation?cited by 50
  5. 2023Personalized Graph Signal Processing for Collaborative Filteringcited by 29
  6. 2019Topic-Enhanced Memory Networks for Personalised Point-of-Interest Recommendationcited by 10
  7. 2025Tricolore: Multi-Behavior User Profiling for Enhanced Candidate Generation in Recommender Systemscited by 6
  8. 2025SoREX: Towards Self-Explainable Social Recommendation with Relevant Ego-Path Extractioncited by 5
  9. 2025Counterfactual Reasoning for Steerable Pluralistic Value Alignment of Large Language Modelscited by 5
  10. 2025Leave No One Behind: Enhancing Diversity While Maintaining Accuracy in Social Recommendationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.