paper-with-me

Papers

Beyond Node Attention: Multi-Scale Harmonic Encoding for Feature-Wise Graph Message Passing

2025-05-21 · Longlong Li, Cunquan Qu, Guanghui Wang

Conventional Graph Neural Networks (GNNs) aggregate neighbor embeddings as holistic vectors, lacking the ability to identify fine-grained, direction-specific feature relevance. We propose MSH-GNN (Multi-Scale Harmonic Graph Neural Network), a novel architecture that performs feature-wise adaptive message passing through node-specific harmonic projections. For each node, MSH-GNN dynamically projects neighbor features onto frequency-sensitive directions determined by the target node's own representation. These projections are further modulated using learnable sinusoidal encodings at multiple frequencies, enabling the model to capture both smooth and oscillatory structural patterns across scales. A frequency-aware attention pooling mechanism is introduced to emphasize spectrally and structurally salient nodes during readout. Theoretically, we prove that MSH-GNN approximates shift-invariant kernels and matches the expressive power of the 1-Weisfeiler-Lehman (1-WL) test. Empirically, MSH-GNN consistently outperforms state-of-the-art models on a wide range of graph and node classification tasks. Furthermore, in challenging classification settings involving joint variations in graph topology and spectral frequency, MSH-GNN excels at capturing structural asymmetries and high-frequency modulations, enabling more accurate graph discrimination.

📄 PDF Abstract BibTeX arXiv:2505.15015

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Neural NetworkNode Classification

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Attention 설명 없음
Attention Pooling 설명 없음

Similar Papers 제목 키워드 기반

Deformable Graph Transformer

2022-06-29 · Jinyoung Park, Seongjun Yun, Hyeonjin Park, Jaewoo Kang 외

Transformer-based models have recently shown success in representation learning on graph-structured data beyond natural language processing and computer vision. However, the success is limited to small-scale graphs due t…

Representation Learning

SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations

2023-06-19 · NeurIPS 2023 11 · Qitian Wu, Wentao Zhao, Chenxiao Yang, Hengrui Zhang 외

Learning representations on large-sized graphs is a long-standing challenge due to the inter-dependence nature involved in massive data points. Transformers, as an emerging class of foundation encoders for graph-structur…

Node Property PredictionPhilosophyProperty Prediction

Harmonic: Hierarchical State Space Models for Efficient Long-Context Language Modeling

2026-05-30 · Petr Nyoma arxiv

We present Harmonic, a hierarchical state space model (SSM) for language modeling. The architecture stacks three recurrent levels at progressively slower timescales; each level receives the prediction error of the level …

Polyharmonic Cascade

2025-12-19 · Yuriy N. Bakhvalov arxiv

This paper presents a deep machine learning architecture, the "polyharmonic cascade" -- a sequence of packages of polyharmonic splines, where each layer is rigorously derived from the theory of random functions and the p…

Learning Label Initialization for Time-Dependent Harmonic Extension

2022-05-03 · Amitoz Azad

Node classification on graphs can be formulated as the Dirichlet problem on graphs where the signal is given at the labeled nodes, and the harmonic extension is done on the unlabeled nodes. This paper considers a time-de…

ClassificationNode Classification