Skip to content

Batch Before You Lift: Scalable Topological Deep Learning on Large Graphs

Oct 2026 · 0 citations · 35 references
Computer Science

TL;DR

Cluster-TNN is introduced, a domain-agnostic framework that avoids this bottleneck by lifting locally instead, and enables the first training of multiple different higher-order Topological Neural Networks on large datasets such as Reddit and OGBN Products.

Abstract

Topological Deep Learning extends graph-based learning to higher-order domains, such as hypergraphs, cellular, and simplicial complexes. These domains are typically constructed from patterns in an input graph through a process of graph lifting. Full-domain training constructs and stores the complete lifted representation before model execution. On large and dense datasets like Reddit (233k nodes and 57.3M edges), this global materialization becomes a severe computational bottleneck, often rendering training infeasible. To address this limitation, we introduce Cluster-TNN, a domain-agnostic framework that avoids this bottleneck by lifting locally instead. After partitioning the input graph during preprocessing, at runtime Cluster-TNN dynamically samples groups of node clusters, reconstructs their induced subgraphs to form mini-batches, and applies the chosen lifting within each mini-batch. Retaining all edges among sampled nodes preserves the connectivity needed to construct higher-order structures across clusters, producing topological mini-batches that existing Topological Neural Networks can process directly. Across 21 matched comparisons with full-graph execution, Cluster-TNN reduces peak GPU memory in every configuration, by 83.2% on average while maintaining competitive predictive performance. Notably, such a reduction enables, to our knowledge, the first training of multiple different higher-order Topological Neural Networks on large datasets such as Reddit and OGBN Products. These results establish Cluster-TNN as a general strategy for scaling Topological Deep Learning beyond the limitations of global domain construction.

View source

Similar papers

#machine learning Preprint Sep 2026

TopoEmbedX: A General Framework for Representation Learning on Topological Domains

Topological structures such as simplicial complexes, hypergraphs, and cell complexes extend standard graph models by modeling higher-order relationships. These structures appear in many modern datasets and require specialized methods for generating meaningful embeddings. In this paper, we introduce TopoEmbedX, a unifie...

Florian Frantzen, Ibrahem AlJabea, I. Henriques-Cadby et al. · 0 citations
Preprint Aug 2026

Two-level domain-decomposition AdaGrad method for scalable training of graph neural networks

The proposed DD-AG2m alternates between AG2m optimization on the original (global) graph and AG2m optimization on the partitioned graphs, and introduces a two-level variant that performs global optimization steps on a coarse graph obtained by randomly subsampling nodes within each subdomain.

Laurynas Varnas, Julien Herrmann, Alexander Heinlein et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Global to Local: Topology-Preserving Adaptive Graph Pooling via Granular-Ball

Graph pooling aims to compress the graph, including both node embeddings and their underlying topological patterns, into a more compact representation. Previous works focus primarily on the overly fine-grained representation of nodes, progressively coarsening the graph by removing nodes or merging them into clusters, t...

Sen Zhao, Gao-Jie Xu, Shu-Yin Xia et al. · 0 citations
#machine learning Preprint Sep 2026

Topology-induced Operators Reveal Complementary Graph Representations without Training

This work shows that informative embeddings can be derived without complicated model design and gradient-based training, and suggests that informative graph embeddings can arise from carefully chosen topological transformations before any learning operation is applied.

Meng Qin, Jin-Qiang Cui, Hong-Wei Zheng et al. · 0 citations
#machine learning Preprint Oct 2026

EDiS: Edge Disjoint Subgraph Sparsification Framework for Graph Neural Networks

Sparse GNN training reduces computation, but deciding which edges to keep can be costly. Reusing one sparse graph is cheap, but locks training to a fixed topology, while varying it across epochs can require repeated sampling or recomputation. We introduce EDiS (Edge-Disjoint Subgraph sparsification framework), which se...

S. Navuluru, Siddhartha Shankar Das, Franck Dernoncourt et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

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