CF-KAN: Kolmogorov-Arnold Network-based Collaborative Filtering to Mitigate Catastrophic Forgetting in Recommender Systems

• URL: http://arxiv.org/abs/2409.05878v2
• Date: Wed, 11 Sep 2024 04:47:52 GMT
• Title: CF-KAN: Kolmogorov-Arnold Network-based Collaborative Filtering to Mitigate Catastrophic Forgetting in Recommender Systems
• Authors: Jin-Duk Park, Kyung-Min Kim, Won-Yong Shin,
• Abstract summary: Collaborative filtering (CF) remains essential in recommender systems. We propose CF-KAN, a new CF method utilizing Kolmogorov-Arnold networks (KANs) By learning nonlinear functions on the edge level, KANs are more robust to the catastrophic forgetting problem than sparses.
• Score: 16.261654043738385
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Collaborative filtering (CF) remains essential in recommender systems, leveraging user--item interactions to provide personalized recommendations. Meanwhile, a number of CF techniques have evolved into sophisticated model architectures based on multi-layer perceptrons (MLPs). However, MLPs often suffer from catastrophic forgetting, and thus lose previously acquired knowledge when new information is learned, particularly in dynamic environments requiring continual learning. To tackle this problem, we propose CF-KAN, a new CF method utilizing Kolmogorov-Arnold networks (KANs). By learning nonlinear functions on the edge level, KANs are more robust to the catastrophic forgetting problem than MLPs. Built upon a KAN-based autoencoder, CF-KAN is designed in the sense of effectively capturing the intricacies of sparse user--item interactions and retaining information from previous data instances. Despite its simplicity, our extensive experiments demonstrate 1) CF-KAN's superiority over state-of-the-art methods in recommendation accuracy, 2) CF-KAN's resilience to catastrophic forgetting, underscoring its effectiveness in both static and dynamic recommendation scenarios, and 3) CF-KAN's edge-level interpretation facilitating the explainability of recommendations.

Related papers

• Efficient and Robust Regularized Federated Recommendation [52.24782464815489]
  The recommender system (RSRS) addresses both user preference and privacy concerns. We propose a novel method that incorporates non-uniform gradient descent to improve communication efficiency. RFRecF's superior robustness compared to diverse baselines.
  arXiv  Detail & Related papers  (2024-11-03T12:10:20Z)
• Understanding and Improving Adversarial Collaborative Filtering for Robust Recommendation [60.719158008403376]
  Adversarial Collaborative Filtering (ACF) is widely recognized as an effective strategy for enhancing the robustness of recommender systems against poisoning attacks. Despite empirical successes, the theoretical understanding of ACF's effectiveness in terms of both performance and robustness remains unclear. We propose Personalized Magnitude Adversarial Collaborative Filtering (PamaCF)
  arXiv  Detail & Related papers  (2024-10-30T09:23:14Z)
• Revisiting Catastrophic Forgetting in Large Language Model Tuning [79.70722658190097]
  Catastrophic Forgetting (CF) means models forgetting previously acquired knowledge when learning new data. This paper takes the first step to reveal the direct link between the flatness of the model loss landscape and the extent of CF in the field of large language models. Experiments on three widely-used fine-tuning datasets, spanning different model scales, demonstrate the effectiveness of our method in alleviating CF.
  arXiv  Detail & Related papers  (2024-06-07T11:09:13Z)
• How Does Message Passing Improve Collaborative Filtering? [49.019075781827034]
  Collaborative filtering (CF) has exhibited prominent results for recommender systems and been broadly utilized for real-world applications. Message passing helps CF methods in a manner akin to its benefits for graph-based learning tasks in general. We present Test-time Aggregation for CF, a test-time augmentation framework that only conducts message passing once at inference time.
  arXiv  Detail & Related papers  (2024-03-27T18:53:04Z)
• User-Specific Bicluster-based Collaborative Filtering: Handling Preference Locality, Sparsity and Subjectivity [1.0398909602421018]
  Collaborative Filtering (CF) is the most common approach to build Recommender Systems. We propose USBFC, a Biclustering-based CF approach that creates user-specific models from strongly coherent and statistically significant rating patterns. USBFC achieves competitive predictive accuracy against state-of-the-art CF methods.
  arXiv  Detail & Related papers  (2022-11-15T18:10:52Z)
• DualCF: Efficient Model Extraction Attack from Counterfactual Explanations [57.46134660974256]
  Cloud service providers have launched Machine-Learning-as-a-Service platforms to allow users to access large-scale cloudbased models via APIs. Such extra information inevitably causes the cloud models to be more vulnerable to extraction attacks. We propose a novel simple yet efficient querying strategy to greatly enhance the querying efficiency to steal a classification model.
  arXiv  Detail & Related papers  (2022-05-13T08:24:43Z)
• Hypergraph Contrastive Collaborative Filtering [44.8586906335262]
  We propose a new self-supervised recommendation framework Hypergraph Contrastive Collaborative Filtering (HCCF) HCCF captures local and global collaborative relations with a hypergraph-enhanced cross-view contrastive learning architecture. Our model effectively integrates the hypergraph structure encoding with self-supervised learning to reinforce the representation quality of recommender systems.
  arXiv  Detail & Related papers  (2022-04-26T10:06:04Z)
• Localized Graph Collaborative Filtering [20.868562372148677]
  We introduce a novel perspective to build GNN-based CF methods for recommendations. One key advantage of LGCF is that it does not need to learn embeddings for each user and item. Experiments on various datasets validate the effectiveness of LGCF especially in sparse scenarios.
  arXiv  Detail & Related papers  (2021-08-10T06:48:32Z)
• BCFNet: A Balanced Collaborative Filtering Network with Attention Mechanism [106.43103176833371]
  Collaborative Filtering (CF) based recommendation methods have been widely studied. We propose a novel recommendation model named Balanced Collaborative Filtering Network (BCFNet) In addition, an attention mechanism is designed to better capture the hidden information within implicit feedback and strengthen the learning ability of the neural network.
  arXiv  Detail & Related papers  (2021-03-10T14:59:23Z)
• Constructing Complexity-efficient Features in XCS with Tree-based Rule Conditions [3.0538120180981294]
  A major goal of machine learning is to create techniques that abstract away irrelevant information. This paper aims to optimise the structural efficiency of Code Fragments (CFs) in XOF.
  arXiv  Detail & Related papers  (2020-04-23T05:41:41Z)

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.