通过注意力机制动态加权图对比学习,提升推荐系统精度。
Squeeze and Excitation: A Weighted Graph Contrastive Learning for Collaborative Filtering
- 在GCN最后一层施加鲁棒扰动,生成对比视图。
- 引入SENet动态分配特征权重,增强关键信息关注。
- 在多个数据集上显著优于基线模型,适合推荐系统研究者。
对比学习(CL)近年成为推荐系统中的有力技术,尤其擅长利用扰动视图的自监督信号缓解数据稀疏问题。通过在图卷积网络(GCN)中构建用户-物品二分图的扰动视图并进行对比学习,称为图对比学习(GCL),旨在增强表征学习的鲁棒性。尽管现有基于GCL的模型有效,但扰动视图的权重分配方法尚未充分探索。现有模型存在特征注意力分配不合理的问题,限制了对关键特征的有效利用,导致性能不理想。为此,我们提出加权图对比学习框架(WeightedGCL)。具体而言,WeightedGCL采用鲁棒的扰动策略,仅对GCN最后一层的视图进行扰动;同时引入挤压激励网络(SENet),动态加权扰动视图的特征。该方法强化模型对关键特征的关注,降低无关信息影响。在多个常用数据集上的大量实验表明,与竞争性基线相比,WeightedGCL实现了显著的准确率提升。
原文摘要 · Abstract (English)
Contrastive Learning (CL) has recently emerged as a powerful technique in recommendation systems, particularly for its capability to harness self-supervised signals from perturbed views to mitigate the persistent challenge of data sparsity. The process of constructing perturbed views of the user-item bipartite graph and performing contrastive learning between perturbed views in a graph convolutional network (GCN) is called graph contrastive learning (GCL), which aims to enhance the robustness of representation learning. Although existing GCL-based models are effective, the weight assignment method for perturbed views has not been fully explored. A critical problem in existing GCL-based models is the irrational allocation of feature attention. This problem limits the model's ability to effectively leverage crucial features, resulting in suboptimal performance. To address this, we propose a Weighted Graph Contrastive Learning framework (WeightedGCL). Specifically, WeightedGCL applies a robust perturbation strategy, which perturbs only the view of the final GCN layer. In addition, WeightedGCL incorporates a squeeze and excitation network (SENet) to dynamically weight the features of the perturbed views. Our WeightedGCL strengthens the model's focus on crucial features and reduces the impact of less relevant information. Extensive experiments on widely used datasets demonstrate that our WeightedGCL achieves significant accuracy improvements compared to competitive baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。