SVD-AE: Simple Autoencoders for Collaborative Filtering
Not on the map. Why?
Abstract (arXiv)
Collaborative filtering (CF) methods for recommendation systems have been extensively researched, ranging from matrix factorization and autoencoder-based to graph filtering-based methods. Recently, lightweight methods that require almost no training have been recently proposed to reduce overall computation. However, existing methods still have room to improve the trade-offs among accuracy, efficiency, and robustness. In particular, there are no well-designed closed-form studies for balanced CF in terms of the aforementioned trade-offs. In this paper, we design SVD-AE, a simple yet effective singular vector decomposition (SVD)-based linear autoencoder, whose closed-form solution can be defined based on SVD for CF. SVD-AE does not require iterative training processes as its closed-form solution can be calculated at once. Furthermore, given the noisy nature of the rating matrix, we explore the robustness against such noisy interactions of existing CF methods and our SVD-AE. As a result, we demonstrate that our simple design choice based on truncated SVD can be used to strengthen the noise robustness of the recommendation while improving efficiency. Code is available at https://github.com/seoyoungh/svd-ae.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 31 of its 73 references that are in the map. First posted on arXiv 8 May 2024.
Builds on
31 of 73 references.
References · 31
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2017Neural Collaborative Filteringcited by 1,108
- 2019Neural Graph Collaborative Filteringcited by 660
- 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 409
- 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 119
- 2020Disentangled Graph Collaborative Filteringcited by 118
- 2019Learning Disentangled Representations for Recommendationcited by 110
- 2014Collaborative Deep Learning for Recommender Systemscited by 95
- 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
- 2022A Survey of Graph Neural Networks for Social Recommender Systemscited by 65
19 more
- 2019RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedbackcited by 63
- 2021How Powerful is Graph Convolution for Recommendation?cited by 50
- 2022Blurring-Sharpening Process Models for Collaborative Filteringcited by 35
- 2018Sequential Variational Autoencoders for Collaborative Filteringcited by 31
- 2023An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attentioncited by 28
- 2021Bootstrapping User and Item Representations for One-Class Collaborative Filteringcited by 22
- 2021LT-OCF: Learnable-Time ODE-based Collaborative Filteringcited by 21
- 2017AutoSVD++: An Efficient Hybrid Collaborative Filtering Model via Contractive Auto-encoderscited by 20
- 2022Infinite Recommendation Networks: A Data-Centric Approachcited by 20
- 2021Linear, or Non-Linear, That is the Question!cited by 19
- 2022SVD-GCN: A Simplified Graph Convolution Paradigm for Recommendationcited by 16
- 2022Mutually-Regularized Dual Collaborative Variational Auto-encoder for Recommendation Systemscited by 9
- 2022TimeKit: A Time-series Forecasting-based Upgrade Kit for Collaborative Filteringcited by 7
- 2023It's Enough: Relaxing Diagonal Constraints in Linear Autoencoders for Recommendationcited by 7
- 2024Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendationcited by 7
- 2018Faster Matrix Completion Using Randomized SVDcited by 5
- 2024SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendationcited by 4
- 2023RDGCL: Reaction-Diffusion Graph Contrastive Learning for Recommendationcited by 3
- 2024QoS-Aware Graph Contrastive Learning for Web Service Recommendationcited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 1.
4 papers.
- 2024Towards Unified and Adaptive Cross-Domain Collaborative Filtering via Graph Signal Processingcited by 1
- 2025LLM-Enhanced Linear Autoencoders for Recommendationcited by 1
- 2026Memory Is No Longer a Bottleneck: Memory-Efficient Graph Filtering for Scalable Collaborative Filteringcited by 1
- 2025TV-Rec: Time-Variant Convolutional Filter for Sequential Recommendationcited by 0
- 2026Memory Is No Longer a Bottleneck: Memory-Efficient Graph Filtering for Scalable Collaborative Filtering19 Jun 2026
- 2025TV-Rec: Time-Variant Convolutional Filter for Sequential Recommendation29 Oct 2025
- 2025LLM-Enhanced Linear Autoencoders for Recommendation19 Aug 2025
- 2024Towards Unified and Adaptive Cross-Domain Collaborative Filtering via Graph Signal Processing17 Jul 2024