ICML 2023 Topological Deep Learning Challenge : Design and Results

• URL: http://arxiv.org/abs/2309.15188v4
• Date: Thu, 18 Jan 2024 17:21:42 GMT
• Title: ICML 2023 Topological Deep Learning Challenge : Design and Results
• Authors: Mathilde Papillon, Mustafa Hajij, Helen Jenne, Johan Mathe, Audun Myers, Theodore Papamarkou, Tolga Birdal, Tamal Dey, Tim Doster, Tegan Emerson, Gurusankar Gopalakrishnan, Devendra Govil, Aldo Guzm\'an-S\'aenz, Henry Kvinge, Neal Livesay, Soham Mukherjee, Shreyas N. Samaga, Karthikeyan Natesan Ramamurthy, Maneel Reddy Karri, Paul Rosen, Sophia Sanborn, Robin Walters, Jens Agerberg, Sadrodin Barikbin, Claudio Battiloro, Gleb Bazhenov, Guillermo Bernardez, Aiden Brent, Sergio Escalera, Simone Fiorellino, Dmitrii Gavrilev, Mohammed Hassanin, Paul H\"ausner, Odin Hoff Gardaa, Abdelwahed Khamis, Manuel Lecha, German Magai, Tatiana Malygina, Rub\'en Ballester, Kalyan Nadimpalli, Alexander Nikitin, Abraham Rabinowitz, Alessandro Salatiello, Simone Scardapane, Luca Scofano, Suraj Singh, Jens Sj\"olund, Pavel Snopov, Indro Spinelli, Lev Telyatnikov, Lucia Testa, Maosheng Yang, Yixiao Yue, Olga Zaghen, Ali Zia, Nina Miolane
• Abstract summary: The competition asked participants to provide open-source implementations of topological neural networks from the literature. 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.
• Score: 83.5003281210199
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• ICML Topological Deep Learning Challenge 2024: Beyond the Graph Domain [82.10943542681696]
  The challenge focused on the problem of representing data in different discrete topological domains. The challenge received 52 submissions satisfying all the requirements. This paper introduces the main scope of the challenge, and summarizes the main results and findings.
  arXiv  Detail & Related papers  (2024-09-08T19:59:53Z)
• Overview of AI-Debater 2023: The Challenges of Argument Generation Tasks [62.443665295250035]
  We present the results of the AI-Debater 2023 Challenge held by the Chinese Conference on Affect Computing (CCAC 2023) In total, 32 competing teams register for the challenge, from which we received 11 successful submissions.
  arXiv  Detail & Related papers  (2024-07-20T10:13:54Z)
• Human Understanding AI Paper Challenge 2024 -- Dataset Design [0.0]
  In 2024, we will hold a research paper competition (the third Human Understanding AI Paper Challenge) for the research and development of artificial intelligence technologies to understand human daily life. This document introduces the datasets that will be provided to participants in the competition, and summarizes the issues to consider in data processing and learning model development.
  arXiv  Detail & Related papers  (2024-03-25T07:48:34Z)
• The Robust Semantic Segmentation UNCV2023 Challenge Results [99.97867942388486]
  This paper outlines the winning solutions employed in addressing the MUAD uncertainty quantification challenge held at ICCV 2023. The challenge was centered around semantic segmentation in urban environments, with a particular focus on natural adversarial scenarios. The report presents the results of 19 submitted entries, with numerous techniques drawing inspiration from cutting-edge uncertainty quantification methodologies.
  arXiv  Detail & Related papers  (2023-09-27T08:20:03Z)
• Homological Neural Networks: A Sparse Architecture for Multivariate Complexity [0.0]
  We develop a novel deep neural network unit characterized by a sparse higher-order graphical architecture built over the homological structure of underlying data. Results demonstrate the advantages of this novel design which can tie or overcome the results of state-of-the-art machine learning and deep learning models using only a fraction of parameters.
  arXiv  Detail & Related papers  (2023-06-27T09:46:16Z)
• A Method to Predict Semantic Relations on Artificial Intelligence Papers [0.0]
  We present a solution to predicting the emergence of links in large evolving networks based on a new family of deep learning approaches, namely Graph Neural Networks. The results of the challenge show that our solution is competitive even if we had to impose severe restrictions to obtain a computationally efficient and parsimonious model. Preliminary experiments presented in this paper suggest the model is learning two related, but different patterns: the absorption of a node by a sub-graph and union of more dense sub-graphs.
  arXiv  Detail & Related papers  (2022-01-24T18:27:17Z)
• Interpreting Deep Knowledge Tracing Model on EdNet Dataset [67.81797777936868]
  In this work, we perform the similar tasks but on a large and newly available dataset, called EdNet. The preliminary experiment results show the effectiveness of the interpreting techniques.
  arXiv  Detail & Related papers  (2021-10-31T07:18:59Z)
• Opportunities and Challenges of Deep Learning Methods for Electrocardiogram Data: A Systematic Review [62.490310870300746]
  The electrocardiogram (ECG) is one of the most commonly used diagnostic tools in medicine and healthcare. Deep learning methods have achieved promising results on predictive healthcare tasks using ECG signals. This paper presents a systematic review of deep learning methods for ECG data from both modeling and application perspectives.
  arXiv  Detail & Related papers  (2019-12-28T02:44:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.