Towards Mitigating Dimensional Collapse of Representations in Collaborative Filtering
Not on the map. Why?
Abstract (arXiv)
Contrastive Learning (CL) has shown promising performance in collaborative filtering. The key idea is to generate augmentation-invariant embeddings by maximizing the Mutual Information between different augmented views of the same instance. However, we empirically observe that existing CL models suffer from the textsldimensional collapse issue, where user/item embeddings only span a low-dimension subspace of the entire feature space. This suppresses other dimensional information and weakens the distinguishability of embeddings. Here we propose a non-contrastive learning objective, named nCL, which explicitly mitigates dimensional collapse of representations in collaborative filtering. Our nCL aims to achieve geometric properties of textslAlignment and textslCompactness on the embedding space. In particular, the alignment tries to push together representations of positive-related user-item pairs, while compactness tends to find the optimal coding length of user/item embeddings, subject to a given distortion. More importantly, our nCL does not require data augmentation nor negative sampling during training, making it scalable to large datasets. Experimental results demonstrate the superiority of our nCL.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Dec 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 5; 2025: 2; 2026: 3.
10 papers.
- 2024How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspectivecited by 21
- 2024SimCE: Simplifying Cross-Entropy Loss for Collaborative Filteringcited by 4
- 2024A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systemscited by 4
- 2025Generalized Category Discovery via Token Manifold Capacity Learningcited by 3
- 2025On the Role of Weight Decay in Collaborative Filtering: A Popularity Perspectivecited by 2
- 2024Understanding and Scaling Collaborative Filtering Optimization from the Perspective of Matrix Rankcited by 1
- 2026Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendationcited by 1
- 2024Prototypical Contrastive Learning through Alignment and Uniformity for Recommendationcited by 0
- 2026Understanding DNNs in Feature Interaction Models: A Dimensional Collapse Perspectivecited by 0
- 2026SpecFormer: Mitigating Embedding and Attention Collapse via Spectral-Aware Transformer for Recommendationcited by 0
- 2026SpecFormer: Mitigating Embedding and Attention Collapse via Spectral-Aware Transformer for Recommendation27 Jul 2026
- 2026Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation22 May 2026
- 2026Understanding DNNs in Feature Interaction Models: A Dimensional Collapse Perspective29 Apr 2026
- 2025Generalized Category Discovery via Token Manifold Capacity Learning20 May 2025
- 2025On the Role of Weight Decay in Collaborative Filtering: A Popularity Perspective16 May 2025
- 2024Understanding and Scaling Collaborative Filtering Optimization from the Perspective of Matrix Rank15 Oct 2024
- 2024A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systems25 Jun 2024
- 2024SimCE: Simplifying Cross-Entropy Loss for Collaborative Filtering23 Jun 2024
- 2024How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspective18 Apr 2024
- 2024Prototypical Contrastive Learning through Alignment and Uniformity for Recommendation3 Feb 2024