DualSpectralCF: Training-Free Sign-Aware Spectral Collaborative Filtering
Not on the map. Why?
Abstract (arXiv)
Real-world recommendation platforms routinely collect explicit negative feedback such as 1-star reviews, hate-button clicks, distrust between users, and very-low watch-ratio videos. Learned sign-aware recommenders exploit this signal for clear accuracy gains, but only at the cost of gradient-based training. In parallel, a line of training-free spectral collaborative filtering methods matches or beats learned graph recommenders at a fraction of the cost, yet operates on positive interactions alone. We bridge these two lines with DualSpectralCF, a training-free framework of two components that attach to any spectral backbone of the form hatru = F(M) ru: a signed input signal ru± that encodes the user's explicit dislikes, and a signed item-item operator M± that blends like-together and dislike-together similarity. The framework is backbone-agnostic and adds just two scalar hyperparameters. We instantiate DualSpectralCF on ChebyCF, GF-CF, and Turbo-CF, and evaluate on five sign-aware benchmarks: every instance matches or beats its unsigned backbone on all 5 datasets, with Recall@20 lifts up to +32.6% with backbone-specific (γ, kappa) tuning and +1.9% to +16.0% for DualSpectralCF-Cheby at the fixed default (γ = -0.5, kappa = 0.1), and the family runs 7.7 to 155.3× faster than SIGformer while reaching 70.7% to 90.7% of its accuracy. Sign-awareness helps most for cold-start users, with up to +29.2% Recall@20 on Epinions users with 1 to 5 training items.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 27 references that are in the map. First posted on arXiv 10 Aug 2026.
Builds on
16 of 27 references.
References · 16
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2019Neural Graph Collaborative Filteringcited by 661
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 494
- 2022KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systemscited by 96
- 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 94
- 2022KuaiRand: An Unbiased Sequential Recommendation Dataset with Randomly Exposed Videoscited by 72
- 2022Blurring-Sharpening Process Models for Collaborative Filteringcited by 35
- 2022Signed Graph Neural Networks: A Frequency Perspectivecited by 10
- 2023On Manipulating Signals of User-Item Graph: A Jacobi Polynomial-based Graph Collaborative Filteringcited by 9
- 2024PolyCF: Towards the Optimal Spectral Graph Filters for Collaborative Filteringcited by 7
- 2024Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendationcited by 7
- 2025Graph Spectral Filtering with Chebyshev Interpolation for Recommendationcited by 7
4 more
- 2023PANE-GNN: Unifying Positive and Negative Edges in Graph Neural Networks for Recommendationcited by 4
- 2025GegenNet: Spectral Convolutional Neural Networks for Link Sign Prediction in Signed Bipartite Graphscited by 3
- 2024Towards Unified Modeling for Positive and Negative Preferences in Sign-Aware Recommendationcited by 1
- 2024DFGNN: Dual-frequency Graph Neural Network for Sign-aware Feedbackcited by 1
Built on by
Not cited yet.