How Do Graph Signals Affect Recommendation: Unveiling the Mystery of Low and High-Frequency Graph Signals

• URL: http://arxiv.org/abs/2512.15744v1
• Date: Wed, 10 Dec 2025 06:57:48 GMT
• Title: How Do Graph Signals Affect Recommendation: Unveiling the Mystery of Low and High-Frequency Graph Signals
• Authors: Feng Liu, Hao Cang, Huanhuan Yuan, Jiaqing Fan, Yongjing Hao, Fuzhen Zhuang, Guanfeng Liu, Pengpeng Zhao,
• Abstract summary: Spectral graph neural networks (GNNs) are highly effective in modeling graph signals.<n>Recent studies highlight the importance of high-frequency signals.<n>This paper aims to investigate the influence of graph signals on recommendation performance.
• Score: 24.943803382279203
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Spectral graph neural networks (GNNs) are highly effective in modeling graph signals, with their success in recommendation often attributed to low-pass filtering. However, recent studies highlight the importance of high-frequency signals. The role of low-frequency and high-frequency graph signals in recommendation remains unclear. This paper aims to bridge this gap by investigating the influence of graph signals on recommendation performance. We theoretically prove that the effects of low-frequency and high-frequency graph signals are equivalent in recommendation tasks, as both contribute by smoothing the similarities between user-item pairs. To leverage this insight, we propose a frequency signal scaler, a plug-and-play module that adjusts the graph signal filter function to fine-tune the smoothness between user-item pairs, making it compatible with any GNN model. Additionally, we identify and prove that graph embedding-based methods cannot fully capture the characteristics of graph signals. To address this limitation, a space flip method is introduced to restore the expressive power of graph embeddings. Remarkably, we demonstrate that either low-frequency or high-frequency graph signals alone are sufficient for effective recommendations. Extensive experiments on four public datasets validate the effectiveness of our proposed methods. Code is avaliable at https://github.com/mojosey/SimGCF.

Related papers

• Graph Signal Generative Diffusion Models [74.75869068073577]
  We introduce U-shaped encoder-decoder graph neural networks (U-GNNs) for graph signal generation using denoising diffusion processes.<n>The architecture learns node features at different resolutions with skip connections between the encoder and decoder paths.<n>We demonstrate the effectiveness of the diffusion model in probabilistic forecasting of stock prices.
  arXiv  Detail & Related papers  (2025-09-21T21:57:27Z)
• SlepNet: Spectral Subgraph Representation Learning for Neural Dynamics [5.424636897130673]
  Graph neural networks have been useful in machine learning on graph-structured data.<n>They have had limited use in representing patterning signals over graphs.<n>SlepNet is a novel GCN that uses Slepian bases rather than graph harmonics.
  arXiv  Detail & Related papers  (2025-06-19T21:03:52Z)
• Graph Signal Inference by Learning Narrowband Spectral Kernels [1.740992908651449]
  We propose a novel graph signal model where the signal spectrum is represented through the combination of narrowband kernels in the graph frequency domain.<n>We show that the proposed method offers quite satisfactory signal accuracy in comparison with a variety of reference approaches in the literature.
  arXiv  Detail & Related papers  (2025-02-19T12:54:39Z)
• Dual-Frequency Filtering Self-aware Graph Neural Networks for Homophilic and Heterophilic Graphs [60.82508765185161]
  We propose Dual-Frequency Filtering Self-aware Graph Neural Networks (DFGNN) DFGNN integrates low-pass and high-pass filters to extract smooth and detailed topological features. It dynamically adjusts filtering ratios to accommodate both homophilic and heterophilic graphs.
  arXiv  Detail & Related papers  (2024-11-18T04:57:05Z)
• DFGNN: Dual-frequency Graph Neural Network for Sign-aware Feedback [51.72177873832969]
  We propose a novel model that models positive and negative feedback from a frequency filter perspective. We conduct extensive experiments on real-world datasets and demonstrate the effectiveness of the proposed model.
  arXiv  Detail & Related papers  (2024-05-24T07:07:41Z)
• Homophily-Related: Adaptive Hybrid Graph Filter for Multi-View Graph Clustering [29.17784041837907]
  We propose Adaptive Hybrid Graph Filter for Multi-View Graph Clustering (AHGFC) AHGFC learns the node embedding based on the graph joint aggregation matrix. Experimental results show that our proposed model performs well on six datasets containing homophilous and heterophilous graphs.
  arXiv  Detail & Related papers  (2024-01-05T07:27:29Z)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• Signed Graph Neural Networks: A Frequency Perspective [14.386571627652975]
  Graph convolutional networks (GCNs) are designed for unsigned graphs containing only positive links. We propose two different signed graph neural networks, one keeps only low-frequency information and one also retains high-frequency information.
  arXiv  Detail & Related papers  (2022-08-15T16:42:18Z)
• FiGLearn: Filter and Graph Learning using Optimal Transport [49.428169585114496]
  We introduce a novel graph signal processing framework for learning the graph and its generating filter from signal observations. We show how this framework can be used to infer missing values if only very little information is available.
  arXiv  Detail & Related papers  (2020-10-29T10:00:42Z)
• Fast Graph Attention Networks Using Effective Resistance Based Graph Sparsification [70.50751397870972]
  FastGAT is a method to make attention based GNNs lightweight by using spectral sparsification to generate an optimal pruning of the input graph. We experimentally evaluate FastGAT on several large real world graph datasets for node classification tasks.
  arXiv  Detail & Related papers  (2020-06-15T22:07:54Z)

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.