no code implementations • 8 Sep 2024 • Guillermo Bernárdez, Lev Telyatnikov, Marco Montagna, Federica Baccini, Mathilde Papillon, Miquel Ferriol-Galmés, Mustafa Hajij, Theodore Papamarkou, Maria Sofia Bucarelli, Olga Zaghen, Johan Mathe, Audun Myers, Scott Mahan, Hansen Lillemark, Sharvaree Vadgama, Erik Bekkers, Tim Doster, Tegan Emerson, Henry Kvinge, Katrina Agate, Nesreen K Ahmed, Pengfei Bai, Michael Banf, Claudio Battiloro, Maxim Beketov, Paul Bogdan, Martin Carrasco, Andrea Cavallo, Yun Young Choi, George Dasoulas, Matouš Elphick, Giordan Escalona, Dominik Filipiak, Halley Fritze, Thomas Gebhart, Manel Gil-Sorribes, Salvish Goomanee, Victor Guallar, Liliya Imasheva, Andrei Irimia, Hongwei Jin, Graham Johnson, Nikos Kanakaris, Boshko Koloski, Veljko Kovač, Manuel Lecha, Minho Lee, Pierrick Leroy, Theodore Long, German Magai, Alvaro Martinez, Marissa Masden, Sebastian Mežnar, Bertran Miquel-Oliver, Alexis Molina, Alexander Nikitin, Marco Nurisso, Matt Piekenbrock, Yu Qin, Patryk Rygiel, Alessandro Salatiello, Max Schattauer, Pavel Snopov, Julian Suk, Valentina Sánchez, Mauricio Tec, Francesco Vaccarino, Jonas Verhellen, Frederic Wantiez, Alexander Weers, Patrik Zajec, Blaž Škrlj, Nina Miolane
This paper describes the 2nd edition of the ICML Topological Deep Learning Challenge that was hosted within the ICML 2024 ELLIS Workshop on Geometry-grounded Representation Learning and Generative Modeling (GRaM).
2 code implementations • 9 Jun 2024 • Lev Telyatnikov, Guillermo Bernardez, Marco Montagna, Pavlo Vasylenko, Ghada Zamzmi, Mustafa Hajij, Michael T Schaub, Nina Miolane, Simone Scardapane, Theodore Papamarkou
This work introduces TopoBenchmarkX, a modular open-source library designed to standardize benchmarking and accelerate research in Topological Deep Learning (TDL).
no code implementations • 23 May 2024 • Rubén Ballester, Pablo Hernández-García, Mathilde Papillon, Claudio Battiloro, Nina Miolane, Tolga Birdal, Carles Casacuberta, Sergio Escalera, Mustafa Hajij
Topological Deep Learning seeks to enhance the predictive performance of neural network models by harnessing topological structures in input data.
no code implementations • 14 Feb 2024 • Theodore Papamarkou, Tolga Birdal, Michael Bronstein, Gunnar Carlsson, Justin Curry, Yue Gao, Mustafa Hajij, Roland Kwitt, Pietro Liò, Paolo Di Lorenzo, Vasileios Maroulas, Nina Miolane, Farzana Nasrin, Karthikeyan Natesan Ramamurthy, Bastian Rieck, Simone Scardapane, Michael T. Schaub, Petar Veličković, Bei Wang, Yusu Wang, Guo-Wei Wei, Ghada Zamzmi
At the same time, this paper serves as an invitation to the scientific community to actively participate in TDL research to unlock the potential of this emerging field.
1 code implementation • 4 Feb 2024 • Mustafa Hajij, Mathilde Papillon, Florian Frantzen, Jens Agerberg, Ibrahem AlJabea, Ruben Ballester, Claudio Battiloro, Guillermo Bernárdez, Tolga Birdal, Aiden Brent, Peter Chin, Sergio Escalera, Simone Fiorellino, Odin Hoff Gardaa, Gurusankar Gopalakrishnan, Devendra Govil, Josef Hoppe, Maneel Reddy Karri, Jude Khouja, Manuel Lecha, Neal Livesay, Jan Meißner, Soham Mukherjee, Alexander Nikitin, Theodore Papamarkou, Jaro Prílepok, Karthikeyan Natesan Ramamurthy, Paul Rosen, Aldo Guzmán-Sáenz, Alessandro Salatiello, Shreyas N. Samaga, Simone Scardapane, Michael T. Schaub, Luca Scofano, Indro Spinelli, Lev Telyatnikov, Quang Truong, Robin Walters, Maosheng Yang, Olga Zaghen, Ghada Zamzmi, Ali Zia, Nina Miolane
We introduce TopoX, a Python software suite that provides reliable and user-friendly building blocks for computing and machine learning on topological domains that extend graphs: hypergraphs, simplicial, cellular, path and combinatorial complexes.
no code implementations • 19 Dec 2023 • Karthikeyan Natesan Ramamurthy, Aldo Guzmán-Sáenz, Mustafa Hajij
To overcome such limitations, we propose Topo-MLP, a purely MLP-based simplicial neural network algorithm to learn the representation of elements in a simplicial complex without explicitly relying on message passing.
no code implementations • 15 Dec 2023 • Mustafa Hajij, Ghada Zamzmi, Theodore Papamarkou, Aldo Guzmán-Sáenz, Tolga Birdal, Michael T. Schaub
In this context, cell complexes are often seen as a subclass of hypergraphs with additional algebraic structure that can be exploited, e. g., to develop a spectral theory.
1 code implementation • 26 Sep 2023 • 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án-Sáenz, 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äusner, Odin Hoff Gardaa, Abdelwahed Khamis, Manuel Lecha, German Magai, Tatiana Malygina, Rubén Ballester, Kalyan Nadimpalli, Alexander Nikitin, Abraham Rabinowitz, Alessandro Salatiello, Simone Scardapane, Luca Scofano, Suraj Singh, Jens Sjölund, Pavel Snopov, Indro Spinelli, Lev Telyatnikov, Lucia Testa, Maosheng Yang, Yixiao Yue, Olga Zaghen, Ali Zia, Nina Miolane
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.
4 code implementations • 20 Apr 2023 • Mathilde Papillon, Sophia Sanborn, Mustafa Hajij, Nina Miolane
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.
4 code implementations • 1 Jun 2022 • Mustafa Hajij, Ghada Zamzmi, Theodore Papamarkou, Nina Miolane, Aldo Guzmán-Sáenz, Karthikeyan Natesan Ramamurthy, Tolga Birdal, Tamal K. Dey, Soham Mukherjee, Shreyas N. Samaga, Neal Livesay, Robin Walters, Paul Rosen, Michael T. Schaub
Topological deep learning is a rapidly growing field that pertains to the development of deep learning models for data supported on topological domains such as simplicial complexes, cell complexes, and hypergraphs, which generalize many domains encountered in scientific computations.
no code implementations • 11 Oct 2021 • T. Mitchell Roddenberry, Michael T. Schaub, Mustafa Hajij
The processing of signals supported on non-Euclidean domains has attracted large interest recently.
no code implementations • 6 Oct 2021 • Mustafa Hajij, Ghada Zamzmi, Karthikeyan Natesan Ramamurthy, Aldo Guzman Saenz
The transition towards data-centric AI requires revisiting data notions from mathematical and implementational standpoints to obtain unified data-centric machine learning packages.
no code implementations • 9 Mar 2021 • Jose Ceniceros, Indu R. Churchill, Mohamed Elhamdadi, Mustafa Hajij
These enhancements include a singquandle cocycle invariant and several polynomial invariants of singular knots obtained from the singquandle structure.
Geometric Topology
no code implementations • 6 Mar 2021 • Mustafa Hajij, Ghada Zamzmi, Theodore Papamarkou, Vasileios Maroulas, Xuanting Cai
In this work, we propose a method for simplicial complex-level representation learning that embeds a simplicial complex to a universal embedding space in a way that complex-to-complex proximity is preserved.
no code implementations • 25 Feb 2021 • Mustafa Hajij, Ghada Zamzmi, Xuanting Cai
This article aims to study the topological invariant properties encoded in node graph representational embeddings by utilizing tools available in persistent homology.
no code implementations • 16 Feb 2021 • Mustafa Hajij, Kyle Istvan
Topological deep learning is a formalism that is aimed at introducing topological language to deep learning for the purpose of utilizing the minimal mathematical structures to formalize problems that arise in a generic deep learning problem.
no code implementations • 21 Jan 2021 • Mustafa Hajij, Ghada Zamzmi, Fawwaz Batayneh
Topological Data Analysis (TDA) has emerged recently as a robust tool to extract and compare the structure of datasets.
1 code implementation • 2 Dec 2020 • Mustafa Hajij, Ghada Zamzmi, Matthew Dawson, Greg Muller
The deep networks obtained via \textbf{AIDN} are \textit{algebraically-informed} in the sense that they satisfy the algebraic relations of the presentation of the algebraic structure that serves as the input to the algorithm.
no code implementations • NeurIPS Workshop TDA_and_Beyond 2020 • Mustafa Hajij, Kyle Istvan, Ghada Zamzmi
Cell complexes are topological spaces constructed from simple blocks called cells.
no code implementations • 31 Aug 2020 • Mustafa Hajij, Kyle Istvan
We utilize classical facts from topology to show that the classification problem in machine learning is always solvable under very mild conditions.
no code implementations • 10 May 2020 • Mustafa Hajij, Eyad Said, Robert Todd
We utilize the PageRank vector to generalize the $k$-means clustering algorithm to directed and undirected graphs.
no code implementations • 12 Feb 2020 • Mustafa Hajij, Elizabeth Munch, Paul Rosen
The PageRank of a graph is a scalar function defined on the node set of the graph which encodes nodes centrality information of the graph.
1 code implementation • 20 Dec 2019 • Jesse S F Levitt, Mustafa Hajij, Radmila Sazdanovic
We examine the structure and dimensionality of the Jones polynomial using manifold learning techniques.
no code implementations • 21 Apr 2019 • Yunhao Zhang, Haowen Liu, Paul Rosen, Mustafa Hajij
We use persistent homology along with the eigenfunctions of the Laplacian to study similarity amongst triangulated 2-manifolds.
no code implementations • 5 Nov 2018 • Omar Elbagalati, Mustafa Hajij
To date, pavement management software products and studies on optimizing the prioritization of pavement maintenance and rehabilitation (M&R) have been mainly focused on three parameters; the pre-treatment pavement condition, the rehabilitation cost, and the available budget.
no code implementations • 18 Oct 2018 • Mustafa Hajij, Paul Rosen
That is, in addition to our parallel algorithm for computing a Reeb graph, we describe a method for extracting the original manifold data from the Reeb graph structure.
3 code implementations • 3 Apr 2018 • Paul Rosen, Mustafa Hajij, Bei Wang
Node-link diagrams are a popular method for representing graphs that capture relationships between individuals, businesses, proteins, and telecommunication endpoints.
no code implementations • 18 Jan 2018 • Mustafa Hajij, Nataša Jonoska, Denys Kukushkin, Masahico Saito
The analysis shows some emerging star-like graph structures indicating that segments of a single gene can interleave, or even contain all of the segments from fifteen or more other genes in between its segments.
no code implementations • 11 Dec 2017 • Mustafa Hajij, Basem Assiri, Paul Rosen
The construction of Mapper has emerged in the last decade as a powerful and effective topological data analysis tool that approximates and generalizes other topological summaries, such as the Reeb graph, the contour tree, split, and joint trees.
no code implementations • 24 Oct 2017 • Alejandro Robles, Mustafa Hajij, Paul Rosen
We study the topological construction called Mapper in the context of simply connected domains, in particular on images.