Towards Mitigating Dimensional Collapse of Representations in Collaborative Filtering

18Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Contrastive Learning (CL) has shown promising performance in collaborative filtering. The key idea is to use contrastive loss 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 dimensional 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 Alignment and Compactness 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 compared to contrastive learning methods. Experimental results demonstrate the superiority of our nCL.

Cite

CITATION STYLE

APA

Chen, H., Lai, V., Jin, H., Jiang, Z., Das, M., & Hu, X. (2024). Towards Mitigating Dimensional Collapse of Representations in Collaborative Filtering. In WSDM 2024 - Proceedings of the 17th ACM International Conference on Web Search and Data Mining (pp. 106–115). Association for Computing Machinery, Inc. https://doi.org/10.1145/3616855.3635832

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free