mlsanityData to 7 Oct 2026

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

arXiv 2610.12247 ↗First posted 8 Oct 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 37 references that are in the map. First posted on arXiv 8 Oct 2026.

Builds on

11 of 37 references.

References · 11

  1. 2017Inductive Representation Learning on Large Graphscited by 6,284
  2. 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
  3. 2018Pitfalls of Graph Neural Network Evaluationcited by 994
  4. 2023Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performancecited by 143
  5. 2022Topological Deep Learning: Going Beyond Graph Datacited by 92
  6. 2023Architectures of Topological Deep Learning: A Survey of Message-Passing Topological Neural Networkscited by 43
  7. 2023Convolutional Learning on Simplicial Complexescited by 26
  8. 2023Topo-MLP : A Simplicial Network Without Message Passingcited by 7
  9. 2025HOPSE: Scalable Higher-Order Positional and Structural Encoder for Combinatorial Representationscited by 5
  10. 2026Have Graph -- Will Lift? The Case for Higher-Order Benchmarkscited by 2
  11. 2026Implicit Regularization of Mini-Batch Training in Graph Neural Networkscited by 1

Built on by

Not cited yet.