Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation
Yantao Yu, Sen Qiao, Lei Shen, Bing Wang, Xiaoyi Zeng

TL;DR
This paper introduces SSR, a framework that explicitly incorporates sparsity into recommendation models, improving scalability and performance over dense architectures on large-scale datasets.
Contribution
The paper proposes SSR, a novel architecture with explicit sparsity mechanisms, addressing the structural mismatch in recommendation models and enhancing scalability.
Findings
SSR outperforms state-of-the-art baselines on multiple datasets.
SSR demonstrates superior scalability with continuous performance gains.
Explicit sparsity mechanisms improve model efficiency and effectiveness.
Abstract
Recent progress in scaling large models has motivated recommender systems to increase model depth and capacity to better leverage massive behavioral data. However, recommendation inputs are high-dimensional and extremely sparse, and simply scaling dense backbones (e.g., deep MLPs) often yields diminishing returns or even performance degradation. Our analysis of industrial CTR models reveals a phenomenon of implicit connection sparsity: most learned connection weights tend towards zero, while only a small fraction remain prominent. This indicates a structural mismatch between dense connectivity and sparse recommendation data; by compelling the model to process vast low-utility connections instead of valid signals, the dense architecture itself becomes the primary bottleneck to effective pattern modeling. We propose SSR (Explicit Sparsity for Scalable Recommendation), a framework that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
