Pith. sign in

REVIEW 3 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.05878 v2 pith:7GVGH7BB submitted 2024-08-25 cs.IR cs.LG

classification cs.IRcs.LG
keywords cf-kancatastrophicforgettingmlpscollaborativedynamicfilteringinformation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. KAN-SAs: Efficient Acceleration of Kolmogorov-Arnold Networks on Systolic Arrays

    cs.AR 2025-11 conditional novelty 7.0 of 10

    A systolic-array accelerator that tabulates B-splines and exploits B-spline local support achieves ~100% PE utilization and a 2x cycle reduction for KAN inference compared with a conventional systolic array.

  2. Hardware Acceleration of Kolmogorov-Arnold Network (KAN) in Large-Scale Systems

    cs.AR 2025-09 conditional novelty 6.0 of 10

    A co-design of quantization, lookup-table sharing, and analog in-memory circuits lets large KAN recommendation models (39-63MB) scale with 28-41x area growth for 500K-807Kx parameter growth, with 0.11-0.23% accuracy l...

  3. Criteria-Aware Graph Filtering: Extremely Fast Yet Accurate Multi-Criteria Recommendation

    cs.IR 2025-02 conditional novelty 5.0 of 10

    CA-GF is a training-free, matrix-decomposition-free multi-criteria recommender that filters user-item graphs with per-criterion polynomial low-pass filters and aggregates via user-specific criterion preferences.

Pith tools