Skip to content

CondPSE: A Polynomial-Filtered Structural Encoder with Conditional Modulation for Graphs

Jul 2026 · arXiv.org · Vol abs/2607.25169 · 0 citations · 22 references
Computer Science

TL;DR

CondPSE, a learned PSE encoder that applies a learnable polynomial graph filter bank to standard Gaussian node probes and refines the resulting structural-response branches through FiLM-style modulation conditioned on cross-filter, local message-passing, and graph-level signals, is presented.

Abstract

Message-passing graph neural networks are bounded by the 1-WL test and can miss topological structure that distinguishes non-isomorphic graphs. Positional and structural encodings (PSE) inject such topology-derived signals, and learned PSE encoders such as GPSE pretrain a single encoder to produce these signals from random node probes, which can then be frozen and reused as inputs across downstream graph models. We present CondPSE, a learned PSE encoder that applies a learnable polynomial graph filter bank to standard Gaussian node probes and refines the resulting structural-response branches through FiLM-style modulation conditioned on cross-filter, local message-passing, and graph-level signals. CondPSE is pretrained to reconstruct node-level positional/structural targets and graph-level invariants, and is then frozen for use as a downstream input encoding. On synthetic structural-discrimination benchmarks, CondPSE separates graph structures that 1-WL-bounded message passing cannot: it raises CSL accuracy from 42.9% to 97.3% and EXP accuracy from 68.3% to 99.9% relative to GPSE, and ablations show that the polynomial filter bank accounts for most of this gain. On real molecular property prediction, the picture is more limited. With a hybrid local-message-passing/global-attention backbone, CondPSE performs comparably to GPSE without surpassing it, and a ZINC backbone sweep shows no consistent ordering between the two encoders. We report these results and discuss why strong synthetic structural discrimination does not, on its own, yield a downstream advantage for frozen learned PSE encoders, including the role of downstream integration and possible mismatch between structural pretraining targets and molecular property labels.

View source

Similar papers

#machine learning Preprint Aug 2026

HOPPER: Learnable Hop Extraction for Linearized Graph Sequence Models

HOPPER is introduced, an end-to-end learnable extension of LGSM that learns how hop sequences should be extracted before processing by a modern state-space model, and demonstrates that learnable sequence extraction is a flexible and effective framework for long-range graph representation learning across synthetic, phys...

Isuru Herath, Arin Gopakumar, Sharan Sahu · 0 citations
#graph neural networks Preprint Aug 2026

CoRe-GNN: Multilevel Message passing on Coarsened graphs

CoRe-GNN is proposed, which performs both propagations in parallel at each layer: a coarsened inter-cluster term capturing long-range structure, and a local intra-cluster term preserving per-node discriminability.

Antonin Joly, Nicolas Keriven, Aline Roumy · 0 citations
Preprint Aug 2026

Unifying Graph Neural Networks Through a Common Layer Equation

A common layer equation is introduced that represents covered architectures through seven components: an update domain, channel set, propagation bank, per-channel message maps, channel-fusion operator, ego/residual map, and update map, which exposes the empirical inverse problem of mapping measurable graph and task pro...

S. Navuluru, Siddhartha Shankar Das, B. Ni et al. · 0 citations
#machine learning Open access Jan 2025

DeltaGNN: Graph Neural Network With Information Flow Control

DeltaGNN is introduced, to the best of the authors' knowledge, among the first scalable (featuring linear computational and memory complexity overhead) and generalizable (capable of effectively handling graphs with diverse homophily, density, and topology) architectures for long-range and short-range interaction detect...

Kevin Mancini, Islem Rekik · 2 citations
#artificial intelligence Preprint Sep 2026

ProtoGuide: Prototype-Driven Guidance for Class-Conditional Graph Generation

ProtoGuide is introduced, a post-hoc, backbone-agnostic framework that recovers an analogous mechanism for discrete diffusion models and raises macro classification accuracy and outperforms DiGress's built-in conditional training under the authors' configuration.

Salvatore Romano, Marco Grassia, Pietro Liò et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Beyond Flat Netlist: Hierarchical Graph Representation Learning for Scalable Analysis of Sequential Circuits

DeepSeq3 is introduced, a novel hierarchical framework that abstracts circuits into a two-level representation: fine-grained combinational subgraphs partitioned by flip-flops (FFs) and a high-level Super-Node Graph (SNG) that models the register-transfer structure.

Jing-Yi Zhou, Zhengyuan Shi, Jiaying Zhu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.