CF-KAN: Kolmogorov-Arnold Network-based Collaborative Filtering to Mitigate Catastrophic Forgetting in Recommender Systems
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 19 of its 38 references that are in the map. First posted on arXiv 25 Aug 2024.
Builds on
19 of 38 references.
References · 19
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2017Neural Collaborative Filteringcited by 1,111
- 2019Neural Graph Collaborative Filteringcited by 661
- 2017Measuring Catastrophic Forgetting in Neural Networkscited by 360
- 2018Variational Autoencoders for Collaborative Filteringcited by 310
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2024U-KAN Makes Strong Backbone for Medical Image Segmentation and Generationcited by 179
- 2020Anatomy of Catastrophic Forgetting: Hidden Representations and Task Semanticscited by 161
- 2015VBPR: Visual Bayesian Personalized Ranking from Implicit Feedbackcited by 151
- 2020RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithmscited by 138
7 more
- 2024A comprehensive and FAIR comparison between MLP and KAN representations for differential equations and operator networkscited by 104
- 2022Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learningcited by 86
- 2019RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedbackcited by 63
- 2020GraphSAIL: Graph Structure Aware Incremental Learning for Recommender Systemscited by 42
- 2024Suitability of KANs for Computer Vision: A preliminary investigationcited by 34
- 2024Collaborative Filtering Based on Diffusion Models: Unveiling the Potential of High-Order Connectivitycited by 18
- 2023Beyond Two-Tower Matching: Learning Sparse Retrievable Cross-Interactions for Recommendationcited by 13
Built on by
Citing papers per year: 2025: 7; 2026: 1.
8 papers.
- 2026KANtize: Exploring Low-bit Quantization of Kolmogorov-Arnold Networks for Efficient Inferencecited by 4
- 2025KAN-SAs: Efficient Acceleration of Kolmogorov-Arnold Networks on Systolic Arrayscited by 3
- 2025Criteria-Aware Graph Filtering: Extremely Fast Yet Accurate Multi-Criteria Recommendationcited by 2
- 2025iTFKAN: Interpretable Time Series Forecasting with Kolmogorov-Arnold Networkcited by 2
- 2025Unifying Locality of KANs and Feature Drift Compensation Projection for Data-free Replay based Continual Face Forgery Detectioncited by 1
- 2025HKAN: Hierarchical Kolmogorov-Arnold Network without Backpropagationcited by 0
- 2025FS-KAN: Permutation Equivariant Kolmogorov-Arnold Networks via Function Sharingcited by 0
- 2025DecoKAN: Interpretable Decomposition for Forecasting Cryptocurrency Market Dynamicscited by 0
- 2026KANtize: Exploring Low-bit Quantization of Kolmogorov-Arnold Networks for Efficient Inference18 Mar 2026
- 2025DecoKAN: Interpretable Decomposition for Forecasting Cryptocurrency Market Dynamics23 Dec 2025
- 2025KAN-SAs: Efficient Acceleration of Kolmogorov-Arnold Networks on Systolic Arrays20 Nov 2025
- 2025FS-KAN: Permutation Equivariant Kolmogorov-Arnold Networks via Function Sharing29 Sep 2025
- 2025Unifying Locality of KANs and Feature Drift Compensation Projection for Data-free Replay based Continual Face Forgery Detection5 Aug 2025
- 2025iTFKAN: Interpretable Time Series Forecasting with Kolmogorov-Arnold Network23 Apr 2025
- 2025Criteria-Aware Graph Filtering: Extremely Fast Yet Accurate Multi-Criteria Recommendation13 Feb 2025
- 2025HKAN: Hierarchical Kolmogorov-Arnold Network without Backpropagation30 Jan 2025