pith. sign in

arxiv: 2507.23570 · v2 · pith:HU2I3LKInew · submitted 2025-07-31 · 📡 eess.SP

MPFSR-Enhanced GNNs: Spectral Graph Neural Networks Enhancement Through Learnable Multiple-Parameter Graph Fractional Fourier Transforms

classification 📡 eess.SP
keywords spectralgraphfractionalgnnsmodulemultiple-parameterparametersregulation
0
0 comments X
read the original abstract

Graph neural networks (GNNs) excel in processing non-Euclidean data, but traditional spectral GNNs rely on static bases and fundamentally lack active spectral regulation. Although the graph fractional Fourier transform (GFRFT) introduces cross-domain modulation, it applies a uniform fractional parameter across all frequencies. This ignores frequency heterogeneity and restricts the models' adaptive capacity in graph node classification tasks. In the paper, we propose two novel types of multiple-parameter GFRFTs (MPGFRFTs) and establish their corresponding theoretical frameworks, including essential properties, computational complexity, and parameters differentiability. By assigning independent, learnable fractional parameters to distinct frequency bands, MPGFRFTs enable fine-grained spectral regulation. Then, we operationalize this mathematical framework by designing the adaptive multiple-parameter fractional spectral regulation (MPFSR) module, a plug-and-play component for mainstream spectral models. We also establish rigorous theoretical bounds on the spectral stability of this module, guaranteeing a stable and reliable convergence during the end-to-end parameters optimization. Experiments demonstrate that integrating the proposed MPFSR module alleviates the constraints of static bases and yields performance gains in node classification on complex graphs, advancing a novel paradigm for active spectral modulation in graph representation learning.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. FGFRFT: Fast Graph Fractional Fourier Transform via Exact Spectral Splitting and Fourier-Series Approximation

    eess.SP 2026-02 unverdicted novelty 6.0

    FGFRFT splits the spectrum of a unitary GFT to treat λ=-1 exactly and approximates the complementary part by a length-L Fourier series, reducing online complexity to O(2 L N²) with derived error bounds.