Graph Neural Controlled Differential Equations For Collaborative Filtering

• URL: http://arxiv.org/abs/2501.13908v1
• Date: Thu, 23 Jan 2025 18:37:12 GMT
• Title: Graph Neural Controlled Differential Equations For Collaborative Filtering
• Authors: Ke Xu, Weizhi Zhang, Zihe Song, Yuanjie Zhu, Philip S. Yu,
• Abstract summary: We introduce a new method called Graph Neural Controlled Differential Equations for Collaborative Filtering (CDE-CF) Our method improves the performance of the Graph ODE-based method by incorporating weight control in a continuous manner.
• Score: 37.98767924798175
• License:
• Abstract: Graph Convolution Networks (GCNs) are widely considered state-of-the-art for recommendation systems. Several studies in the field of recommendation systems have attempted to apply collaborative filtering (CF) into the Neural ODE framework. These studies follow the same idea as LightGCN, which removes the weight matrix or with a discrete weight matrix. However, we argue that weight control is critical for neural ODE-based methods. The importance of weight in creating tailored graph convolution for each node is crucial, and employing a fixed/discrete weight means it cannot adjust over time within the ODE function. This rigidity in the graph convolution reduces its adaptability, consequently hindering the performance of recommendations. In this study, to create an optimal control for Neural ODE-based recommendation, we introduce a new method called Graph Neural Controlled Differential Equations for Collaborative Filtering (CDE-CF). Our method improves the performance of the Graph ODE-based method by incorporating weight control in a continuous manner. To evaluate our approach, we conducted experiments on various datasets. The results show that our method surpasses competing baselines, including GCNs-based models and state-of-the-art Graph ODE-based methods.

Related papers

• Do We Really Need Graph Convolution During Training? Light Post-Training Graph-ODE for Efficient Recommendation [34.93725892725111]
  Graph convolution networks (GCNs) in training recommender systems (RecSys) have been persistent concerns. This paper presents a critical examination of the necessity of graph convolutions during the training phase. We introduce an innovative alternative: the Light Post-Training Graph Ordinary-Differential-Equation (LightGODE)
  arXiv  Detail & Related papers  (2024-07-26T17:59:32Z)
• Amplify Graph Learning for Recommendation via Sparsity Completion [16.32861024767423]
  Graph learning models have been widely deployed in collaborative filtering (CF) based recommendation systems. Due to the issue of data sparsity, the graph structure of the original input lacks potential positive preference edges. We propose an Amplify Graph Learning framework based on Sparsity Completion (called AGL-SC)
  arXiv  Detail & Related papers  (2024-06-27T08:26:20Z)
• Unifying Graph Convolution and Contrastive Learning in Collaborative Filtering [33.4238287258316]
  Graph-based models and contrastive learning have emerged as prominent methods in Collaborative Filtering. This paper bridges graph convolution, a pivotal element of graph-based models, with contrastive learning through a theoretical framework. We introduce Simple Contrastive Collaborative Filtering (SCCF), a simple and effective algorithm based on a naive embedding model and a modified contrastive loss.
  arXiv  Detail & Related papers  (2024-06-20T04:50:28Z)
• Graph Neural Ordinary Differential Equations-based method for Collaborative Filtering [40.39806741673175]
  We propose a Graph Neural Ordinary Differential Equation-based method for Collaborative Filtering (GODE-CF) This method estimates the final embedding by utilizing the information captured by one or two GCN layers. We show that our proposed GODE-CF model has several advantages over traditional GCN-based models.
  arXiv  Detail & Related papers  (2023-11-21T03:42:15Z)
• Anti-Symmetric DGN: a stable architecture for Deep Graph Networks [12.71306369339218]
  We present Anti-Symmetric Deep Graph Networks (A-DGNs), a framework for stable and non-dissipative DGN design. A-DGN yields to improved performance and enables to learn effectively even when dozens of layers are used.
  arXiv  Detail & Related papers  (2022-10-18T12:04:55Z)
• Deep Manifold Learning with Graph Mining [80.84145791017968]
  We propose a novel graph deep model with a non-gradient decision layer for graph mining. The proposed model has achieved state-of-the-art performance compared to the current models.
  arXiv  Detail & Related papers  (2022-07-18T04:34:08Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• Cogradient Descent for Dependable Learning [64.02052988844301]
  We propose a dependable learning based on Cogradient Descent (CoGD) algorithm to address the bilinear optimization problem. CoGD is introduced to solve bilinear problems when one variable is with sparsity constraint. It can also be used to decompose the association of features and weights, which further generalizes our method to better train convolutional neural networks (CNNs)
  arXiv  Detail & Related papers  (2021-06-20T04:28:20Z)
• Graph Neural Networks with Adaptive Frequency Response Filter [55.626174910206046]
  We develop a graph neural network framework AdaGNN with a well-smooth adaptive frequency response filter. We empirically validate the effectiveness of the proposed framework on various benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-26T19:31:21Z)
• Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approach [55.44107800525776]
  Graph Convolutional Networks (GCNs) are state-of-the-art graph based representation learning models. In this paper, we revisit GCN based Collaborative Filtering (CF) based Recommender Systems (RS) We show that removing non-linearities would enhance recommendation performance, consistent with the theories in simple graph convolutional networks. We propose a residual network structure that is specifically designed for CF with user-item interaction modeling.
  arXiv  Detail & Related papers  (2020-01-28T04:41:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.