# ICML 2023 Topological Deep Learning Challenge : Design and Results

arXiv: https://arxiv.org/abs/2309.15188 · HTML: https://mlsanity.com/paper/2309.15188/

## Key facts

- Cited by 7 papers in the map (data through 14 Oct 2026).
- Builds on 20 of its 25 references that are in the map.
- First posted on arXiv 26 Sep 2023.

## Builds on (most cited first, 20 of 20)

- [Fast Graph Representation Learning with PyTorch Geometric](https://mlsanity.com/paper/1903.02428/) (2019)
- [Weisfeiler and Lehman Go Cellular: CW Networks](https://mlsanity.com/paper/2106.12575/) (2021)
- [UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks](https://mlsanity.com/paper/2105.00956/) (2021)
- [You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks](https://mlsanity.com/paper/2106.13264/) (2021)
- [Simplicial Neural Networks](https://mlsanity.com/paper/2010.03633/) (2020)
- [HNHN: Hypergraph Networks with Hyperedge Neurons](https://mlsanity.com/paper/2006.12278/) (2020)
- [Topological Deep Learning: Going Beyond Graph Data](https://mlsanity.com/paper/2206.00606/) (2022)
- [Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplacian](https://mlsanity.com/paper/1807.05044/) (2018)
- [Principled Simplicial Neural Networks for Trajectory Prediction](https://mlsanity.com/paper/2102.10058/) (2021)
- [Be More with Less: Hypergraph Attention Networks for Inductive Text Classification](https://mlsanity.com/paper/2011.00387/) (2020)
- [HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs](https://mlsanity.com/paper/2010.04558/) (2020)
- [Architectures of Topological Deep Learning: A Survey of Message-Passing Topological Neural Networks](https://mlsanity.com/paper/2304.10031/) (2023)
- [Simplicial Attention Networks](https://mlsanity.com/paper/2204.09455/) (2022)
- [Cell Attention Networks](https://mlsanity.com/paper/2209.08179/) (2022)
- [Convolutional Learning on Simplicial Complexes](https://mlsanity.com/paper/2301.11163/) (2023)
- [Simplicial Convolutional Filters](https://mlsanity.com/paper/2201.11720/) (2022)
- [Simplicial Complex Representation Learning](https://mlsanity.com/paper/2103.04046/) (2021)
- [Dist2Cycle: A Simplicial Neural Network for Homology Localization](https://mlsanity.com/paper/2110.15182/) (2021)
- [Message Passing Neural Networks for Hypergraphs](https://mlsanity.com/paper/2203.16995/) (2022)
- [Dynamic Hypergraph Convolutional Networks for Skeleton-Based Action Recognition](https://mlsanity.com/paper/2112.10570/) (2021)

## Built on by (most cited first, 7 of 7)

- [Position: Topological Deep Learning is the New Frontier for Relational Learning](https://mlsanity.com/paper/2402.08871/) (2024)
- [TopoX: A Suite of Python Packages for Machine Learning on Topological Domains](https://mlsanity.com/paper/2402.02441/) (2024)
- [Copresheaf Topological Neural Networks: A Generalized Deep Learning Framework](https://mlsanity.com/paper/2505.21251/) (2025)
- [ICML Topological Deep Learning Challenge 2024: Beyond the Graph Domain](https://mlsanity.com/paper/2409.05211/) (2024)
- [Demystifying Topological Message-Passing with Relational Structures: A Case Study on Oversquashing in Simplicial Message-Passing](https://mlsanity.com/paper/2506.06582/) (2025)
- [Learning Topology-Aware Representations via Test-Time Adaptation for Anomaly Segmentation](https://mlsanity.com/paper/2606.28268/) (2026)
- [Differentiable Lifting for Topological Neural Networks](https://mlsanity.com/paper/2608.01160/) (2026)

## Abstract (arXiv)

This paper presents the computational challenge on topological deep learning that was hosted within the ICML 2023 Workshop on Topology and Geometry in Machine Learning. The competition asked participants to provide open-source implementations of topological neural networks from the literature by contributing to the python packages TopoNetX (data processing) and TopoModelX (deep learning). The challenge attracted twenty-eight qualifying submissions in its two-month duration. This paper describes the design of the challenge and summarizes its main findings.
