Le Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Le Zhang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Fengran Mo
Université de Montréal, Montréal, Quebec, Canada
1 shared publication - Jian-Yun Nie
Université de Montréal, Montréal, Quebec, Canada
1 shared publication - Tianyu Zhu
School of Economics and Management, Beihang University, Beijing, China
1 shared publication - Weizhi Ma
Tsinghua University, China
1 shared publication - Yihong Wu
Université de Montréal, Montréal, Canada
1 shared publication
Latest Publications
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 3425-3436
Unifying Graph Convolution and Contrastive Learning in Collaborative Filtering
Graph-based models and contrastive learning have emerged as prominent methods in Collaborative Filtering (CF). While many existing models in CF incorporate these methods in their design, there seems to be a limited depth of analysis regarding the foundational principles behind them. This paper bridges graph convolution, a pivotal element of graph-based models, with contrastive learning through a theoretical framework. By examining the learning dynamics and equilibrium of the contrastive loss, we offer a fresh lens to understand contrastive learning via graph theory, emphasizing its capability to capture high-order connectivity. Building on this analysis, we further show that the graph convolutional layers often used in graph-based models are not essential for high-order connectivity modeling and might contribute to the risk of oversmoothing. Stemming from our findings, we introduce Simple Contrastive Collaborative Filtering (SCCF), a simple and effective algorithm based on a naive embedding model and a modified contrastive loss. The efficacy of the algorithm is demonstrated through extensive experiments across four public datasets. The experiment code is available at https://github.com/wu1hong/SCCF.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 3425-3436
Open AccessUnifying Graph Convolution and Contrastive Learning in Collaborative Filtering
Graph-based models and contrastive learning have emerged as prominent methods in Collaborative Filtering (CF). While many existing models in CF incorporate these methods in their design, there seems to be a limited depth of analysis regarding the foundational principles behind them. This paper bridges graph convolution, a pivotal element of graph-based models, with contrastive learning through a theoretical framework. By examining the learning dynamics and equilibrium of the contrastive loss, we offer a fresh lens to understand contrastive learning via graph theory, emphasizing its capability to capture high-order connectivity. Building on this analysis, we further show that the graph convolutional layers often used in graph-based models are not essential for high-order connectivity modeling and might contribute to the risk of oversmoothing. Stemming from our findings, we introduce Simple Contrastive Collaborative Filtering (SCCF), a simple and effective algorithm based on a naive embedding model and a modified contrastive loss. The efficacy of the algorithm is demonstrated through extensive experiments across four public datasets. The experiment code is available at https://github.com/wu1hong/SCCF.