mlsanityData to 14 Oct 2026

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

arXiv 2607.25169 ↗First posted 28 Jul 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 22 references that are in the map. First posted on arXiv 28 Jul 2026.

Builds on

14 of 22 references.

References · 14

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2018How Powerful are Graph Neural Networks?cited by 4,393
  3. 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,333
  4. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  5. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
  6. 2019Strategies for Pre-training Graph Neural Networkscited by 971
  7. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
  8. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
  9. 2017Residual Gated Graph ConvNetscited by 346
  10. 2021OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphscited by 329
  11. 2020The Surprising Power of Graph Neural Networks with Random Node Initializationcited by 198
  12. 2020Random Features Strengthen Graph Neural Networkscited by 186
2 more
  1. 2019Relational Pooling for Graph Representationscited by 150
  2. 2025Graph Representational Learning: When Does More Expressivity Hurt Generalization?cited by 5

Built on by

Not cited yet.