Long-Range Graph Wavelet Networks
This addresses a central problem in graph machine learning for researchers and practitioners, offering an incremental improvement over existing wavelet-based methods.
The paper tackles the challenge of modeling long-range interactions in graphs by proposing Long-Range Graph Wavelet Networks (LR-GWN), which decompose wavelet filters into local and global components to capture both short- and long-distance information flow, achieving state-of-the-art performance among wavelet-based methods on long-range benchmarks.
Modeling long-range interactions, the propagation of information across distant parts of a graph, is a central challenge in graph machine learning. Graph wavelets, inspired by multi-resolution signal processing, provide a principled way to capture both local and global structures. However, existing wavelet-based graph neural networks rely on finite-order polynomial approximations, which limit their receptive fields and hinder long-range propagation. We propose Long-Range Graph Wavelet Networks (LR-GWN), which decompose wavelet filters into complementary local and global components. Local aggregation is handled with efficient low-order polynomials, while long-range interactions are captured through a flexible spectral-domain parameterization. This hybrid design unifies short- and long-distance information flow within a principled wavelet framework. Experiments show that LR-GWN achieves state-of-the-art performance among wavelet-based methods on long-range benchmarks, while remaining competitive on short-range datasets.