Topological deep learning (TDL) [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] is a research field that extends deep learning to handle complex, non-Euclidean data structures. Traditional deep learning models, such as convolutional neural networks (CNNs) and recurrent neural networks (RNNs), excel in processing data on regular grids and sequences. However, scientific and real-world data often exhibit more intricate data domains encountered in scientific computations , including point clouds , meshes , time series , scalar fields graphs , or general topological spaces like simplicial complexes and CW complexes .[ 7] TDL addresses this by incorporating topological concepts to process data with higher-order relationships, such as interactions among multiple entities and complex hierarchies. This approach leverages structures like simplicial complexes and hypergraphs to capture global dependencies and qualitative spatial properties, offering a more nuanced representation of data. TDL also encompasses methods from computational and algebraic topology that permit studying properties of neural networks and their training process, such as their predictive performance or generalization properties.[ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14]
The mathematical foundations of TDL are algebraic topology , differential topology , and geometric topology . Therefore, TDL can be generalized for data on differentiable manifolds , knots , links, tangles, curves, etc.
^ 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 [cs.LG ].
^ Ebli, S.; Defferrard, M.; Spreemann, G. (2020), Simplicial neural networks , arXiv :2010.03633
^ 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, arXiv :2112.06826 , doi :10.1609/aaai.v36i6.20583
^ Uray, Martin; Giunti, Barbara; Kerber, Michael; Huber, Stefan (2024-10-01). "Topological Data Analysis in smart manufacturing: State of the art and future directions" . Journal of Manufacturing Systems . 76 : 75– 91. arXiv :2310.09319 . doi :10.1016/j.jmsy.2024.07.006 . ISSN 0278-6125 .
^ Cite error: The named reference :8
was invoked but never defined (see the help page ).
^ Bianchini, Monica; Scarselli, Franco (2014). "On the Complexity of Neural Network Classifiers: A Comparison Between Shallow and Deep Architectures" . IEEE Transactions on Neural Networks and Learning Systems . 25 (8): 1553– 1565. doi :10.1109/TNNLS.2013.2293637 . ISSN 2162-237X . PMID 25050951 .
^ Naitzat, Gregory; Zhitnikov, Andrey; Lim, Lek-Heng (2020). "Topology of Deep Neural Networks" (PDF) . Journal of Machine Learning Research . 21 (1): 184:7503–184:7542. ISSN 1532-4435 .
^ Birdal, Tolga; Lou, Aaron; Guibas, Leonidas J; Simsekli, Umut (2021). "Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks" . Advances in Neural Information Processing Systems . 34 . Curran Associates, Inc.: 6776– 6789. arXiv :2111.13171 .
^ Ballester, Rubén; Clemente, Xavier Arnal; Casacuberta, Carles; Madadi, Meysam; Corneanu, Ciprian A.; Escalera, Sergio (2024). "Predicting the generalization gap in neural networks using topological data analysis" . Neurocomputing . 596 : 127787. arXiv :2203.12330 . doi :10.1016/j.neucom.2024.127787 .
^ Rieck, Bastian; Togninalli, Matteo; Bock, Christian; Moor, Michael; Horn, Max; Gumbsch, Thomas; Borgwardt, Karsten (2018-09-27). "Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology" . International Conference on Learning Representations . 8 : 6215– 6239. arXiv :1812.09764 . doi :10.3929/ethz-b-000327207 . ISBN 978-1-7138-7273-3 .
^ Dupuis, Benjamin; Deligiannidis, George; Simsekli, Umut (2023-07-03). "Generalization Bounds using Data-Dependent Fractal Dimensions" . Proceedings of the 40th International Conference on Machine Learning . PMLR: 8922– 8968.