This work introduces Topoformer, a lightweight and scalable framework for graph representation learning that encodes topological structure into attention-friendly sequences by decomposing a graph into a short, ordered sequence of topological tokens by slicing over node or edge filtrations.
Abstract
We introduce Topoformer, a lightweight and scalable framework for graph representation learning that encodes topological structure into attention-friendly sequences. At the core of our method is Topo-Scan, a novel module that decomposes a graph into a short, ordered sequence of topological tokens by slicing over node or edge filtrations. These sequences capture multi-scale structural patterns, from local motifs to global organization, and are processed by a Transformer to produce expressive graph-level embeddings. Unlike traditional persistent homology pipelines, Topo-Scan is parallelizable, avoids costly diagram computations, and integrates seamlessly with standard deep learning architectures. We provide theoretical guarantees on the stability of our topological encodings and demonstrate state-of-the-art performance across graph classification and molecular property prediction benchmarks. Our results show that Topoformer matches or exceeds strong GNN and topology-based baselines while offering predictable and efficient compute. This work opens a new path for parallelizable and unifying approaches to graph representation learning that integrate topological inductive biases into attention frameworks.
This work proposes $\partial$lift (DiffLift), a general framework for learning graph liftings to hypergraphs and cellular- and simplicial complexes in an end-to-end fashion and shows that $\partial$lift outperforms existing lifting methods on multiple benchmarks for graph and node classification across different TNN ar...
J. L. Franco, Gabriel Duarte, Alexander Nikitin et al.· 2 citations
Experiments on synthetic and real-world datasets show that GraphK outperforms existing methods, accurately learns graph structures, and generates synthetic graphs without explicit definitions.
Resul Tugay, Eren Olug, Elif Ak et al.· 0 citations
Graph Autoencoder Uncovering Descriptive Information (GAUDI), an unsupervised graph deep learning framework designed to capture both local details and global structure, is introduced, providing new insights into emergent phenomena across diverse scientific domains.
Text-attributed graphs are widely used across domains, offering rich opportunities for zero-shot learning via graph-text alignment. However, existing methods struggle with tasks requiring fine-grained pattern recognition, particularly on heterophilic graphs. Through empirical and theoretical analysis, we identify an ov...
Heng Zhang, Jin Huang· Proceedings of the 32nd ACM...· 0 citations
Learning a stable yet highly discriminative representation space that can simultaneously recognize known categories and discover novel ones from limited labeled data is fundamental to Generalized Category Discovery (GCD) on graphs. Recently, Neural Collapse (NC) theory has emerged as a powerful geometric principle for...
Xu Xi, Zhong Zhang, Hongliang Wang et al.· Proceedings of the 32nd ACM...· 0 citations
A Spectral-Aware Feature Alignment module to unify feature dimensionality and align cross-domain semantics in a community-aware manner and a Graph Diffusion Tokenized Transformer that constructs hybrid token sequences from local and global structural contexts for Transformer encoding, and applies diffusion-based refine...
Mo Li, Zhaosong Zhao, Linlin Ding et al.· Annual International ACM SIG...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.