Pith. sign in

REVIEW 2 cited by

Graph Positional and Structural Encoder

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.07107 v2 pith:2BH4TK23 submitted 2023-07-14 cs.LG

classification cs.LG
keywords graphencodergpsepositionalpsesstructuralcomputedefficient
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Positional and structural encodings (PSE) enable better identifiability of nodes within a graph, rendering them essential tools for empowering modern GNNs, and in particular graph Transformers. However, designing PSEs that work optimally for all graph prediction tasks is a challenging and unsolved problem. Here, we present the Graph Positional and Structural Encoder (GPSE), the first-ever graph encoder designed to capture rich PSE representations for augmenting any GNN. GPSE learns an efficient common latent representation for multiple PSEs, and is highly transferable: The encoder trained on a particular graph dataset can be used effectively on datasets drawn from markedly different distributions and modalities. We show that across a wide range of benchmarks, GPSE-enhanced models can significantly outperform those that employ explicitly computed PSEs, and at least match their performance in others. Our results pave the way for the development of foundational pre-trained graph encoders for extracting positional and structural information, and highlight their potential as a more powerful and efficient alternative to explicitly computed PSEs and existing self-supervised pre-training approaches. Our framework and pre-trained models are publicly available at https://github.com/G-Taxonomy-Workgroup/GPSE. For convenience, GPSE has also been integrated into the PyG library to facilitate downstream applications.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Universality and Approximation Rates of Graph Neural Networks with Random Features

    cs.LG 2026-07 accept novelty 6.0 of 10

    PENNs with random node features universally approximate measurable perm-invariant/equivariant graph functions in probability, with explicit approximation rates for C^k targets.

  2. HOPSE: Scalable Higher-Order Positional and Structural Encoder for Combinatorial Representations

    cs.LG 2025-05 conditional novelty 6.0 of 10

    HOPSE encodes higher-order topological data by applying graph positional and structural encoders to Hasse graph decompositions, matching or exceeding message-passing models on benchmarks with up to 7x faster training.

Pith tools