REVIEW 4 cited by
Architectures of Topological Deep Learning: A Survey of Message-Passing Topological Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The natural world is full of complex systems characterized by intricate relations between their components: from social interactions between individuals in a social network to electrostatic interactions between atoms in a protein. Topological Deep Learning (TDL) provides a comprehensive framework to process and extract knowledge from data associated with these systems, such as predicting the social community to which an individual belongs or predicting whether a protein can be a reasonable target for drug development. TDL has demonstrated theoretical and practical advantages that hold the promise of breaking ground in the applied sciences and beyond. However, the rapid growth of the TDL literature for relational systems has also led to a lack of unification in notation and language across message-passing Topological Neural Network (TNN) architectures. This presents a real obstacle for building upon existing works and for deploying message-passing TNNs to new real-world problems. To address this issue, we provide an accessible introduction to TDL for relational systems, and compare the recently published message-passing TNNs using a unified mathematical and graphical notation. Through an intuitive and critical review of the emerging field of TDL, we extract valuable insights into current challenges and exciting opportunities for future development.
Forward citations
Cited by 4 Pith papers
-
Cosmology with Topological Deep Learning
Topological neural networks using tetrahedra, clusters and hyperedges built from halo catalogs lower inference error on Omega_m by 22% and on sigma_8 by up to 60% versus graph neural networks on Quijote.
-
Heat Kernel Goes Topological
TopoHKS defines a weighted combinatorial-complex Laplacian and heat kernel descriptor, claiming maximal expressive power; the supporting uniqueness theorem is incorrect.
-
CellCLAT: Preserving Topology and Trimming Redundancy in Self-Supervised Cellular Contrastive Learning
CellCLAT applies parameter-perturbation contrastive learning to cellular complexes and adaptively trims 2-cells to improve downstream graph classification.
-
Relational inductive biases on attention mechanisms
Attention mechanisms are classified by their relational inductive bias: self-attention assumes a complete graph, masked attention a total order, strided attention p-previous connections, encoder-decoder a bipartite gr...
Discussion (0). Continue with ORCID to comment.