Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation

• URL: http://arxiv.org/abs/2404.14243v1
• Date: Mon, 22 Apr 2024 14:56:36 GMT
• Title: Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation
• Authors: Jin-Duk Park, Yong-Min Shin, Won-Yong Shin,
• Abstract summary: Turbo-CF is a GF-based graph filter that is both training-free and matrix decomposition-free. We demonstrate that Turbo-CF is extremely fast yet accurate, achieving a runtime of less than 1 second on real-world benchmark datasets.
• Score: 9.582288420754152
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A series of graph filtering (GF)-based collaborative filtering (CF) showcases state-of-the-art performance on the recommendation accuracy by using a low-pass filter (LPF) without a training process. However, conventional GF-based CF approaches mostly perform matrix decomposition on the item-item similarity graph to realize the ideal LPF, which results in a non-trivial computational cost and thus makes them less practical in scenarios where rapid recommendations are essential. In this paper, we propose Turbo-CF, a GF-based CF method that is both training-free and matrix decomposition-free. Turbo-CF employs a polynomial graph filter to circumvent the issue of expensive matrix decompositions, enabling us to make full use of modern computer hardware components (i.e., GPU). Specifically, Turbo-CF first constructs an item-item similarity graph whose edge weights are effectively regulated. Then, our own polynomial LPFs are designed to retain only low-frequency signals without explicit matrix decompositions. We demonstrate that Turbo-CF is extremely fast yet accurate, achieving a runtime of less than 1 second on real-world benchmark datasets while achieving recommendation accuracies comparable to best competitors.

Related papers

• Data-Driven Filter Design in FBP: Transforming CT Reconstruction with Trainable Fourier Series [3.6508148866314163]
  We introduce a trainable filter for computed tomography (CT) reconstruction within the filtered backprojection (FBP) framework. This method overcomes the limitation in noise reduction by optimizing Fourier series coefficients to construct the filter. Our filter can be easily integrated into existing CT reconstruction models, making it an adaptable tool for a wide range of practical applications.
  arXiv  Detail & Related papers  (2024-01-29T10:47:37Z)
• Transforming Image Super-Resolution: A ConvFormer-based Efficient Approach [58.57026686186709]
  We introduce the Convolutional Transformer layer (ConvFormer) and propose a ConvFormer-based Super-Resolution network (CFSR) CFSR inherits the advantages of both convolution-based and transformer-based approaches. Experiments demonstrate that CFSR strikes an optimal balance between computational cost and performance.
  arXiv  Detail & Related papers  (2024-01-11T03:08:00Z)
• Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler [103.97487121678276]
  Filter pruning simultaneously accelerates the computation and reduces the memory overhead of CNNs. We propose a novel Knowledge-driven Differential Filter Sampler(KDFS) with Masked Filter Modeling(MFM) framework for filter pruning.
  arXiv  Detail & Related papers  (2023-07-01T02:28:41Z)
• Multiplierless In-filter Computing for tinyML Platforms [6.878219199575747]
  We present a novel multiplierless framework for in-filter acoustic classification. We use MP-based approximation for training, including backpropagation mitigating approximation errors. The framework is more efficient than traditional classification frameworks with just less than 1K slices.
  arXiv  Detail & Related papers  (2023-04-24T04:33:44Z)
• Late Fusion Multi-view Clustering via Global and Local Alignment Maximization [61.89218392703043]
  Multi-view clustering (MVC) optimally integrates complementary information from different views to improve clustering performance. Most of existing approaches directly fuse multiple pre-specified similarities to learn an optimal similarity matrix for clustering. We propose late fusion MVC via alignment to address these issues.
  arXiv  Detail & Related papers  (2022-08-02T01:49:31Z)
• Monarch: Expressive Structured Matrices for Efficient and Accurate Training [64.6871423399431]
  Large neural networks excel in many domains, but they are expensive to train and fine-tune. A popular approach to reduce their compute or memory requirements is to replace dense weight matrices with structured ones. We propose a class of matrices (Monarch) that is hardware-efficient.
  arXiv  Detail & Related papers  (2022-04-01T17:37:29Z)
• How Powerful is Graph Convolution for Recommendation? [21.850817998277158]
  Graph convolutional networks (GCNs) have recently enabled a popular class of algorithms for collaborative filtering (CF) In this paper, we endeavor to obtain a better understanding of GCN-based CF methods via the lens of graph signal processing.
  arXiv  Detail & Related papers  (2021-08-17T11:38:18Z)
• Self-supervised Symmetric Nonnegative Matrix Factorization [82.59905231819685]
  Symmetric nonnegative factor matrix (SNMF) has demonstrated to be a powerful method for data clustering. Inspired by ensemble clustering that aims to seek better clustering results, we propose self-supervised SNMF (S$3$NMF) We take advantage of the sensitivity to code characteristic of SNMF, without relying on any additional information.
  arXiv  Detail & Related papers  (2021-03-02T12:47:40Z)
• Robust CUR Decomposition: Theory and Imaging Applications [9.280330114137778]
  This paper considers the use of Robust PCA in a CUR decomposition framework and applications thereof. We consider two key imaging applications of Robust PCA: video foreground-background separation and face modeling.
  arXiv  Detail & Related papers  (2021-01-05T17:58:15Z)
• Rank and run-time aware compression of NLP Applications [12.965657113072325]
  This paper proposes a new compression technique called Hybrid Matrix Factorization. It improves low-rank matrix factorization techniques by doubling the rank of the matrix. It can achieve more than 2.32x faster inference run-time than pruning and 16.77% better accuracy than LMF.
  arXiv  Detail & Related papers  (2020-10-06T16:03:15Z)
• Augmentation of the Reconstruction Performance of Fuzzy C-Means with an Optimized Fuzzification Factor Vector [99.19847674810079]
  Fuzzy C-Means (FCM) is one of the most frequently used methods to construct information granules. In this paper, we augment the FCM-based degranulation mechanism by introducing a vector of fuzzification factors. Experiments completed for both synthetic and publicly available datasets show that the proposed approach outperforms the generic data reconstruction approach.
  arXiv  Detail & Related papers  (2020-04-13T04:17:30Z)

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.