Graph Convolutional Network for Recommendation with Low-pass Collaborative Filters
Not on the map. Why?
Abstract (arXiv)
Graph Convolutional Network (GCN) is widely used in graph data learning tasks such as recommendation. However, when facing a large graph, the graph convolution is very computationally expensive thus is simplified in all existing GCNs, yet is seriously impaired due to the oversimplification. To address this gap, we leverage the textitoriginal graph convolution in GCN and propose a Low-pass Collaborative Filter (LCF) to make it applicable to the large graph. LCF is designed to remove the noise caused by exposure and quantization in the observed data, and it also reduces the complexity of graph convolution in an unscathed way. Experiments show that LCF improves the effectiveness and efficiency of graph convolution and our GCN outperforms existing GCNs significantly. Codes are available on urlhttps://github.com/Wenhui-Yu/LCFN.
Key facts. Cited by 32 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 6; 2022: 5; 2023: 6; 2024: 9; 2025: 3; 2026: 3.
32 papers.
Sort:
- 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
- 2021Graph Learning based Recommender Systems: A Reviewcited by 59
- 2021How Powerful is Graph Convolution for Recommendation?cited by 50
- 2021Sparse-Interest Network for Sequential Recommendationcited by 37
- 2024How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspectivecited by 21
- 2023Adap-τ: Adaptively Modulating Embedding Magnitude for Recommendationcited by 19
- 2021Causal Incremental Graph Convolution for Recommender System Retrainingcited by 14
- 2022Parameter-free Dynamic Graph Embedding for Link Predictioncited by 12
- 2021Boosting-GNN: Boosting Algorithm for Graph Networks on Imbalanced Node Classificationcited by 10
- 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendationcited by 9
- 2023AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothingcited by 7
- 2024Layer-diverse Negative Sampling for Graph Neural Networkscited by 7
20 more
- 2025You Are What You Bought: Generating Customer Personas for E-commerce Applicationscited by 7
- 2022DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Predictioncited by 5
- 2023BSL: Understanding and Improving Softmax Loss for Recommendationcited by 5
- 2023Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysiscited by 3
- 2024Frequency-aware Graph Signal Processing for Collaborative Filteringcited by 3
- 2024Graph Neural Networks Are More Than Filters: Revisiting and Benchmarking from A Spectral Perspectivecited by 3
- 2023Time-aware Hyperbolic Graph Attention Network for Session-based Recommendationcited by 2
- 2024Signal-SGN: A Spiking Graph Convolutional Network for Skeletal Action Recognition via Learning Temporal-Frequency Dynamicscited by 2
- 2025Training-free Adjustable Polynomial Graph Filtering for Ultra-fast Multimodal Recommendationcited by 2
- 2025Advancing Loss Functions in Recommender Systems: A Comparative Study with a R'enyi Divergence-Based Solutioncited by 2
- 2022GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomialscited by 1
- 2024Graph Contrastive Learning with Low-Rank Regularization and Low-Rank Attention for Noisy Node Classificationcited by 1
- 2026Talos: Optimizing Top-K Accuracy in Recommender Systemscited by 1
- 2022Stratified Graph Spectracited by 0
- 2022Density-Aware Hyper-Graph Neural Networks for Graph-based Semi-supervised Node Classificationcited by 0
- 2023DualHGNN: A Dual Hypergraph Neural Network for Semi-Supervised Node Classification based on Multi-View Learning and Density Awarenesscited by 0
- 2024Harmonizing Feature Maps: A Graph Convolutional Approach for Enhancing Adversarial Robustnesscited by 0
- 2024A Sinkhorn Regularized Adversarial Network for Image Guided DEM Super-resolution using Frequency Selective Hybrid Graph Transformercited by 0
- 2026Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendationcited by 0
- 2026Low-pass Personalized Subgraph Federated Recommendationcited by 0
- 2026Low-pass Personalized Subgraph Federated Recommendation20 Mar 2026
- 2026Talos: Optimizing Top-K Accuracy in Recommender Systems27 Jan 2026
- 2026Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendation7 Jan 2026
- 2025Advancing Loss Functions in Recommender Systems: A Comparative Study with a R'enyi Divergence-Based Solution18 Jun 2025
- 2025You Are What You Bought: Generating Customer Personas for E-commerce Applications24 Apr 2025
- 2025Training-free Adjustable Polynomial Graph Filtering for Ultra-fast Multimodal Recommendation6 Mar 2025
- 2024Graph Neural Networks Are More Than Filters: Revisiting and Benchmarking from A Spectral Perspective10 Dec 2024
- 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation31 Oct 2024
- 2024A Sinkhorn Regularized Adversarial Network for Image Guided DEM Super-resolution using Frequency Selective Hybrid Graph Transformer21 Sep 2024
- 2024Signal-SGN: A Spiking Graph Convolutional Network for Skeletal Action Recognition via Learning Temporal-Frequency Dynamics3 Aug 2024
- 2024Harmonizing Feature Maps: A Graph Convolutional Approach for Enhancing Adversarial Robustness17 Jun 2024
- 2024How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspective18 Apr 2024
20 more
- 2024Layer-diverse Negative Sampling for Graph Neural Networks18 Mar 2024
- 2024Graph Contrastive Learning with Low-Rank Regularization and Low-Rank Attention for Noisy Node Classification14 Feb 2024
- 2024Frequency-aware Graph Signal Processing for Collaborative Filtering13 Feb 2024
- 2023BSL: Understanding and Improving Softmax Loss for Recommendation20 Dec 2023
- 2023Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis1 Aug 2023
- 2023DualHGNN: A Dual Hypergraph Neural Network for Semi-Supervised Node Classification based on Multi-View Learning and Density Awareness7 Jun 2023
- 2023AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothing14 Apr 2023
- 2023Adap-τ: Adaptively Modulating Embedding Magnitude for Recommendation9 Feb 2023
- 2023Time-aware Hyperbolic Graph Attention Network for Session-based Recommendation10 Jan 2023
- 2022Parameter-free Dynamic Graph Embedding for Link Prediction15 Oct 2022
- 2022GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials30 Sep 2022
- 2022DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Prediction14 Aug 2022
- 2022Density-Aware Hyper-Graph Neural Networks for Graph-based Semi-supervised Node Classification27 Jan 2022
- 2022Stratified Graph Spectra10 Jan 2022
- 2021SimpleX: A Simple and Strong Baseline for Collaborative Filtering26 Sep 2021
- 2021How Powerful is Graph Convolution for Recommendation?17 Aug 2021
- 2021Causal Incremental Graph Convolution for Recommender System Retraining16 Aug 2021
- 2021Boosting-GNN: Boosting Algorithm for Graph Networks on Imbalanced Node Classification25 May 2021
- 2021Graph Learning based Recommender Systems: A Review13 May 2021
- 2021Sparse-Interest Network for Sequential Recommendation18 Feb 2021
- 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
- 2021Graph Learning based Recommender Systems: A Reviewcited by 59
- 2021How Powerful is Graph Convolution for Recommendation?cited by 50
- 2021Sparse-Interest Network for Sequential Recommendationcited by 37
- 2024How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspectivecited by 21
- 2023Adap-τ: Adaptively Modulating Embedding Magnitude for Recommendationcited by 19
- 2021Causal Incremental Graph Convolution for Recommender System Retrainingcited by 14
- 2022Parameter-free Dynamic Graph Embedding for Link Predictioncited by 12
- 2021Boosting-GNN: Boosting Algorithm for Graph Networks on Imbalanced Node Classificationcited by 10
- 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendationcited by 9
- 2023AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothingcited by 7
- 2024Layer-diverse Negative Sampling for Graph Neural Networkscited by 7
12 most cited of 32 All 32 (JSON)
- 2026Low-pass Personalized Subgraph Federated Recommendation20 Mar 2026
- 2026Talos: Optimizing Top-K Accuracy in Recommender Systems27 Jan 2026
- 2026Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendation7 Jan 2026
- 2025Advancing Loss Functions in Recommender Systems: A Comparative Study with a R'enyi Divergence-Based Solution18 Jun 2025
- 2025You Are What You Bought: Generating Customer Personas for E-commerce Applications24 Apr 2025
- 2025Training-free Adjustable Polynomial Graph Filtering for Ultra-fast Multimodal Recommendation6 Mar 2025
- 2024Graph Neural Networks Are More Than Filters: Revisiting and Benchmarking from A Spectral Perspective10 Dec 2024
- 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation31 Oct 2024
- 2024A Sinkhorn Regularized Adversarial Network for Image Guided DEM Super-resolution using Frequency Selective Hybrid Graph Transformer21 Sep 2024
- 2024Signal-SGN: A Spiking Graph Convolutional Network for Skeletal Action Recognition via Learning Temporal-Frequency Dynamics3 Aug 2024
- 2024Harmonizing Feature Maps: A Graph Convolutional Approach for Enhancing Adversarial Robustness17 Jun 2024
- 2024How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspective18 Apr 2024
12 newest of 32 All 32 (JSON)