Topological Deep Learning
Also known as: TDL, Topological Neural Networks, Higher-Order Deep Learning, Topolojik Derin Öğrenme
Topological Deep Learning (TDL) is a framework that extends deep learning beyond graphs to higher-order topological domains such as simplicial complexes, cell complexes, and hypergraphs. Formalized by Hajij et al. (2023), TDL provides a unified mathematical language for defining message-passing schemes across cells of different ranks, enabling neural networks to model multi-way interactions that pairwise graph edges cannot capture. It is relevant to researchers working with relational, geometric, or biological data exhibiting group-level dependencies.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use TDL when your data contains genuine multi-way interactions that pairwise edges cannot represent, such as co-authorship groups, higher-order biological pathways, or triangulated geometric meshes. It assumes you can define a meaningful lifting from raw data to a topological complex. Avoid TDL when data is purely dyadic and lifting introduces artificial structure, or when computational budget is tight since higher-order complexes grow exponentially in the number of cells. Simpler alternatives include graph neural networks for pairwise data or hypergraph neural networks when only one level of higher-order interaction is needed.
Strengths & limitations
- Captures multi-way interactions that graph-based models structurally cannot represent.
- Provides a unified, mathematically rigorous framework spanning simplicial, cell, and hypergraph complexes.
- Strictly generalizes graph neural networks as a special case at rank 0-1.
- Enables principled incorporation of topological priors from persistent homology or the Mapper algorithm.
- The number of higher-order cells can grow exponentially with complex size, making memory and computation expensive.
- The choice of lifting map is not canonical and can substantially affect downstream performance.
- Theoretical expressivity results (analogues of Weisfeiler-Leman tests) are still an active research area.
- Software ecosystems and benchmark datasets are far less mature than those for graph neural networks.
Frequently asked
How does TDL differ from a hypergraph neural network?
Hypergraph neural networks operate on a single type of higher-order object (hyperedges) without a graded rank structure. TDL generalizes this by defining cells at multiple ranks (0-nodes, 1-edges, 2-faces, etc.) with explicit boundary and co-boundary operators connecting adjacent ranks, enabling messages to flow across the full topological hierarchy rather than only within one level.
Can TDL be applied to standard graph datasets?
Yes. A graph is a 1-dimensional simplicial complex, so any TDL model that restricts messages to rank-0 and rank-1 cells recovers a standard graph neural network. Practitioners often apply a clique-lifting or Rips-complex construction to extend a graph dataset to a higher-order complex, though this adds computational cost and may not always improve accuracy.
Is there a universal lifting map from raw data to a topological complex?
No universal prescription exists. Common choices include Vietoris-Rips or Cech complexes for point clouds, clique complexes for graphs, and task-specific hyperedge definitions for relational data. The lifting is a design decision that encodes domain knowledge, and its effect on model performance can be as large as the architecture choice itself.
Sources
- Hajij, M., et al. (2023). Topological deep learning: Going beyond graph data. arXiv preprint. link ↗
How to cite this page
ScholarGate. (2026, June 2). Topological Deep Learning. ScholarGate. https://scholargate.app/en/topology/topological-deep-learning
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Graph Neural Network (Network Analysis)Network analysis↔ compare
- Mapper AlgorithmTopology↔ compare
- Persistent HomologyTopology↔ compare