Positional Encoding meets Persistent Homology on Graphs
Reading time: 2 minute
...
📝 Original Info
- Title: Positional Encoding meets Persistent Homology on Graphs
- ArXiv ID: 2506.05814
- Date: 2025-06-06
- Authors: - 원저자: (논문에 명시되지 않음, 추정: Aalto University, QuML Lab) - 공동 저자: (논문에 명시되지 않음) ※ 실제 저자 명단과 소속은 논문 원문을 확인하시기 바랍니다.
📝 Abstract
The local inductive bias of message-passing graph neural networks (GNNs) hampers their ability to exploit key structural information (e.g., connectivity and cycles). Positional encoding (PE) and Persistent Homology (PH) have emerged as two promising approaches to mitigate this issue. PE schemes endow GNNs with location-aware features, while PH methods enhance GNNs with multiresolution topological features. However, a rigorous theoretical characterization of the relative merits and shortcomings of PE and PH has remained elusive. We bridge this gap by establishing that neither paradigm is more expressive than the other, providing novel constructions where one approach fails but the other succeeds. Our insights inform the design of a novel learnable method, PiPE (Persistence-informed Positional Encoding), which is provably more expressive than both PH and PE. PiPE demonstrates strong performance across a variety of tasks (e.g., molecule property prediction, graph classification, and out-of-distribution generalization), thereby advancing the frontiers of graph representation learning. Code is available at https://github.com/Aalto-QuML/PIPE.💡 Deep Analysis
📄 Full Content
Reference
This content is AI-processed based on open access ArXiv data.