Topological Deep Learning

Topological deep learning (TDL)[1][2][3] represents a field at the intersection of topology and deep learning, offering approaches to analyze and learn from data structured in topological spaces. By leveraging the principles of topology, TDL offers an approach to understanding and processing data supported on topological spaces.[4][5][6]

## Motivation[edit]

Conventional deep learning often operates under the assumption that the data under examination reside in a linear vector space and can be effectively characterized using feature vectors. However, there is a growing recognition that this conventional perspective may be inadequate for describing various real-world datasets. For instance, molecules are more aptly represented as graphs rather than feature vectors. Similarly, three-dimensional objects, such as those encountered in computer graphics and geometry processing, are better represented as meshes. Additionally, data originating from social networks, where actors are interconnected in complex ways, defy simple vector-based descriptions. Consequently, there has been a surge in interest in integrating concepts from topology into traditional deep learning frameworks to gain more accurate structural representation of the underlying data.[1]

## An introduction to topological domains[edit]

One of the core concepts in topological deep learning is the domain upon which this data is defined and supported. In case of Euclidian data, such as images, this domain is a grid, upon which the pixel value of the image is supported. In a more general setting this domain might be a topological domain. Next, we introduce the most common topological domains that are encountered in a deep learning setting. These domains include, but not limited to, graphs, simplicial complexes, cell complexes, combinatorial complexes and hypergraphs.

Given a finite set S of abstract entities, a neighborhood function N {\displaystyle {\mathcal {N}}} on S is an assigment that attach to every point  x {\displaystyle x} in S a subset of S or a relation. Such a function can be induced by equipping S with an auxiliary structure. Edges provide one way of defining relations among the entities of S. More specifically, edges in a graph allow one to define the notion of neighborhood using, for instance, the one hop neighborhood notion. Edges however, limited in their modeling capacity as they can only be used to model binary relations among entities of S since every edge is connected typically to two entities. In many applications, it is desirable to permit relations that incorporate more than two entities. The idea of using relations that involve more than two entities is central to topological domains. Such higher-order relations allow for a broader range of neighborhood functions to be defined on S to capture multi-way interactions among entities of S.

Next we review the definitions, advantages, and disadvantages of some commonly studied higher-order networks, including (abstract) simplicial complexes, regular cell complexes, hypergraphs, and combinatorial complexes.

(a): A group S is made up of basic parts (vertices) without any connections.(b): A graph represents simple connections between its parts (vertices) that are elements of S.(c): A simplicial complex shows a way parts (relations) are connected to each other, but with strict rules about how they're connected.(d): Like simplicial complexes, a cell complex shows how parts (relations) are connected, but it's more flexible in how they're shaped (like 'cells').(f): A hypergraph shows any kind of connections between parts of S, but these connections aren't organized in any particular order.(e): A CC mixes elements from cell complexes (connections with order) and hypergraphs (varied connections), covering both kinds of setups.[1]

### Comparisons among topological domains[edit]

Each of the enumerated topological domains has its own characteristics, advantages, and limitations:

* Simplicial Complexes:
* Simplest form of higher-order domains.
* Extensions of graph-based models.
* Admit hierarchical structures, making them suitable for various applications.
* Hodge theory can be naturally defined on simplicial complexes.
* Require relations to be subsets of larger relations, imposing constraints on the structure.

* Cell Complexes:
* Generalize simplicial complexes.
* Provide more flexibility in defining higher-order relations.
* Each cell in a cell complex is homeomorphic to an open ball, attached together via attaching maps.
* Boundary cells of each cell in a cell complex are also cells in the complex.
* Represented combinatorially via incidence matrices.

* Hypergraphs
* Allow arbitrary set-type relations among entities.
* Relations are not imposed by other relations, providing more flexibility.
* Do not explicitly encode the dimension of cells or relations.
* Useful when relations in the data do not adhere to constraints imposed by other models like simplicial and cell complexes.

* Combinatorial Complexes [1] :
* Generalize and bridge the gaps between simplicial complexes, cell complexes, and hypergraphs.
* Allow for hierarchical structures and set-type relations.
* Combine features of other complexes while providing more flexibility in modeling relations.
* Can be represented combinatorially, similar to cell complexes.

### Hierarchical structure and set-type relations[edit]

The properties of simplicial complexes, cell complexes, and hypergraphs give rise to two main features of relations on higher-order domains, namely hierarchies of relations and set-type relations [1].

#### Rank function[edit]

A rank function on a higher-order domain X is an order-preserving function rk: X → Z, where rk(x) attaches a non-negative integer value to each relation x in X, preserving set inclusion in X. Cell and simplicial complexes are common examples of higher-order domains equipped with rank functions and therefore with hierarchies of relations[1].

#### Set-type relations[edit]

Relations in a higher-order domain are called set-type relations if the existence of a relation is not implied by another relation in the domain. Hypergraphs constitute examples of higher-order domains equipped with set-type relations. Given the modeling limitations of simplicial complexes, cell complexes, and hypergraphs, we develop the combinatorial complex, a higher-order domain that features both hierarchies of relations and set-type relations [1].

## Learning on Topological Spaces[edit]

Learning Tasks on topological domains can be broadly classified into three categories : cell classification, cell prediction and complex classification [1].

The learning tasks in TDL can be broadly classified into three categories:[1]

* Cell classification: Predict targets for each cell in a complex. Examples include triangular mesh segmentation, where the task is to predict the class of each face or edge in a given mesh.
* Complex classification: Predict targets for an entire complex. For example, predict the class of each input mesh.
* Cell prediction: Predict properties of cell-cell interactions in a complex, and in some cases, predict whether a cell exists in the complex. An example is the prediction of linkages among entities in hyperedges of a hypergraph.

In practice, to perform the aforementioned tasks, deep learning models designed for specific topological spaces must be constructed and implemented. These models, known as topological neural networks, are tailored to operate effectively within these spaces.

### Topological neural networks[edit]

Central to TDL are topological neural networks (TNNs), specialized architectures designed to operate on data structured in topological domains.[2][1] Unlike traditional neural networks tailored for grid-like structures, TNNs are adept at handling more intricate data representations, such as graphs, simplicial complexes, and cell complexes. By harnessing the inherent topology of the data, TNNs can capture both local and global relationships, enabling nuanced analysis and interpretation.

#### Message passing topological neural networks[edit]

In a general topological domain, higher-order message passing involves exchanging messages among entities and cells using a set of neighborhood functions.

Definition: Higher-Order Message Passing on a General Topological Domain

Higher order message passing is a deep learning model defined on a topological domain and relies on message passing information among entities in the underlying domain in order to perform a learning task [1].

Let  X {\displaystyle {\mathcal {X}}} be a topological domain. We define a set of neighborhood functions  N = { N 1 , … , N n } {\displaystyle {\mathcal {N}}=\\{{\mathcal {N}}_{1},\ldots ,{\mathcal {N}}_{n}\\}} on  X {\displaystyle {\mathcal {X}}} . Consider a cell  x {\displaystyle x} and let  y ∈ N k ( x ) {\displaystyle y\in {\mathcal {N}}_{k}(x)} for some  N k ∈ N {\displaystyle {\mathcal {N}}_{k}\in {\mathcal {N}}} . A message m x , y {\displaystyle m_{x,y}} between cells  x {\displaystyle x} and  y {\displaystyle y} is a computation dependent on these two cells or the data supported on them. Denote  N ( x ) {\displaystyle {\mathcal {N}}(x)} as the multi-set  { { N 1 ( x ) , … , N n ( x ) } } {\displaystyle \\{\\!\\!\\{{\mathcal {N}}_{1}(x),\ldots ,{\mathcal {N}}_{n}(x)\\}\\!\\!\\}} , and let  h x ( l ) {\displaystyle \mathbf {h} _{x}^{(l)}} represent some data supported on cell  x {\displaystyle x} at layer  l {\displaystyle l} . Higher-order message passing on  X {\displaystyle {\mathcal {X}}} [1][7], induced by  N {\displaystyle {\mathcal {N}}} , is defined by the following four update rules:

1. m x , y = α N k ( h x ( l ) , h y ( l ) ) {\displaystyle m_{x,y}=\alpha _{{\mathcal {N}}_{k}}(\mathbf {h} _{x}^{(l)},\mathbf {h} _{y}^{(l)})}
2. m x k = ⨁ y ∈ N k ( x ) m x , y {\displaystyle m_{x}^{k}=\bigoplus _{y\in {\mathcal {N}}_{k}(x)}m_{x,y}} , where  ⨁ {\displaystyle \bigoplus } is the intra-neighborhood aggregation function.
3. m x = ⨂ N k ∈ N m x k {\displaystyle m_{x}=\bigotimes _{{\mathcal {N}}_{k}\in {\mathcal {N}}}m_{x}^{k}} , where  ⨂ {\displaystyle \bigotimes } is the inter-neighborhood aggregation function.
4. h x ( l + 1 ) = β ( h x ( l ) , m x ) {\displaystyle \mathbf {h} _{x}^{(l+1)}=\beta (\mathbf {h} _{x}^{(l)},m_{x})} , where  α N k , β {\displaystyle \alpha _{{\mathcal {N}}_{k}},\beta } are differentiable functions.

Some remarks on Definition~\ref{homp-definition} are as follows.

First, Equation 1 describes how messages are computed between cells  x {\displaystyle x} and  y {\displaystyle y} . The message  m x , y {\displaystyle m_{x,y}} is influenced by both the data  h x ( l ) {\displaystyle \mathbf {h} _{x}^{(l)}} and  h y ( l ) {\displaystyle \mathbf {h} _{y}^{(l)}} associated with cells  x {\displaystyle x} and  y {\displaystyle y} , respectively. Additionally, it incorporates characteristics specific to the cells themselves, such as orientation in the case of cell complexes. This allows for a richer representation of spatial relationships compared to traditional graph-based message passing frameworks.

Second, Equation 2 defines how messages from neighboring cells are aggregated within each neighborhood. The function  ⨁ {\displaystyle \bigoplus } aggregates these messages, allowing information to be exchanged effectively between adjacent cells within the same neighborhood.

Third, Equation 3 outlines the process of combining messages from different neighborhoods. The function  ⨂ {\displaystyle \bigotimes } aggregates messages across various neighborhoods, facilitating communication between cells that may not be directly connected but share common neighborhood relationships.

Fourth, Equation 4 specifies how the aggregated messages influence the state of a cell in the next layer. Here, the function  β {\displaystyle \beta } updates the state of cell  x {\displaystyle x} based on its current state  h x ( l ) {\displaystyle \mathbf {h} _{x}^{(l)}} and the aggregated message  m x {\displaystyle m_{x}} obtained from neighboring cells.

#### Non-Message Passing Topological neural networks[edit]

While the majority of TNNs follow the message passing paradigm. A few models have been suggested that do not fall this model. For instance, in [8] leverages geometric information from simplicial complexes embedded in multidimensional spaces using node coordinates. This offers interpretability and geometric consistency without relying on message passing. Furthermore, in [9] a contrastive loss-based method was suggested to learn the simplicial representation.

## Applications[edit]

TNN is rapidly finding new applications in across various fields including data compression,[10] thereby enhancing the expressive capacity of graph neural networks,[11] action recognition,[12] and trajectory prediction.[13]

## References[edit]

### Notes[edit]

1. ^ a b c d e f g h i j k l Hajij, M.; Zamzmi, G.; Papamarkou, T.; Miolane, N.; Guzmán-Sáenz, A.; Ramamurthy, K. N.; Schaub, M. T. (2022), Topological deep learning: Going beyond graph data, arXiv:2206.00606
2. ^ a b Papillon, M.; Sanborn, S.; Hajij, M.; Miolane, N. (2023). "Architectures of topological deep learning: A survey on topological neural networks". arXiv:2304.10031.
3. ^ Ebli, S.; Defferrard, M.; Spreemann, G. (2020), Simplicial neural networks, arXiv:2010.03633
4. ^ Battiloro, C.; Testa, L.; Giusti, L.; Sardellitti, S.; Di Lorenzo, P.; Barbarossa, S. (2023), Generalized simplicial attention neural networks, arXiv:2309.02138
5. ^ Yang, M.; Isufi, E. (2023), Convolutional learning on simplicial complexes, arXiv:2301.11163
6. ^ Chen, Y.; Gel, Y. R.; Poor, H. V. (2022), "BScNets: Block simplicial complex neural networks", Proceedings of the AAAI Conference on Artificial Intelligence, 36 (6): 6333–6341
7. ^ Hajij, M.; Istvan, K.; Zamzmi, G. (2020), Cell complex neural networks, arXiv:2010.00743
8. ^ Maggs, K.; Hacker, C.; Rieck, B. (2023), Simplicial Representation Learning with Neural $ k $-forms, arXiv:2312.08515
9. ^ Ramamurthy, K. N.; Guzmán-Sáenz, A.; Hajij, M. (2023), Topo-mlp: A simplicial network without message passing, pp. 1–5
10. ^ Battiloro, C.; Di Lorenzo, P.; Ribeiro, A. (September 2023), Parametric dictionary learning for topological signal representation, IEEE, pp. 1958–1962
11. ^ Bodnar, C.; Frasca, F.; Wang, Y.; Otter, N.; Montufar, G. F.; Lio, P.; Bronstein, M. (July 2021), Weisfeiler and lehman go topological: Message passing simplicial networks, PMLR
12. ^ Wang, C.; Ma, N.; Wu, Z.; Zhang, J.; Yao, Y. (August 2022), Survey of Hypergraph Neural Networks and Its Application to Action Recognition, Springer Nature Switzerland, pp. 387–398
13. ^ Roddenberry, T. M.; Glaze, N.; Segarra, S. (July 2021), Principled simplicial neural networks for trajectory prediction, PMLR, pp. 9020–9029

### Bibliography[edit]

* Hajij, M.; Zamzmi, G.; Papamarkou, T.; Miolane, N.; Guzmán-Sáenz, A.; Ramamurthy, K. N.; Schaub, M. T. (2022). "Topological deep learning: Going beyond graph data". arXiv:2206.00606.

* Papillon, M.; Sanborn, S.; Hajij, M.; Miolane, N. (2023). "Architectures of topological deep learning: A survey on topological neural networks". arXiv:2304.10031.

* Hajij, M.; Papillon, M.; Frantzen, F.; Agerberg, J.; AlJabea, I.; Ballester, R.; Miolane, N. (2024). "TopoX: a suite of Python packages for machine learning on topological domains". arXiv:2402.02441.

* Ebli, S.; Defferrard, M.; Spreemann, G. (2020). "Simplicial neural networks". arXiv:2010.03633.

* Hajij, M.; Istvan, K.; Zamzmi, G. (2020). "Cell complex neural networks". arXiv:2010.00743.

* Battiloro, C.; Testa, L.; Giusti, L.; Sardellitti, S.; Di Lorenzo, P.; Barbarossa, S. (2023), Generalized simplicial attention neural networks, arXiv:2309.02138

* Yang, M.; Isufi, E. (2023), Convolutional learning on simplicial complexes, arXiv:2301.11163

* Chen, Y.; Gel, Y. R.; Poor, H. V. (2022), "BScNets: Block simplicial complex neural networks", Proceedings of the AAAI Conference on Artificial Intelligence, 36 (6): 6333–6341

* Ramamurthy, K. N.; Guzmán-Sáenz, A.; Hajij, M. (2023), Topo-mlp: A simplicial network without message passing

* Maggs, K.; Hacker, C.; Rieck, B. (2023), Simplicial Representation Learning with Neural $ k $-forms, arXiv:2312.08515