Papers › E(n) Equivariant Topological Neural Networks

E(n) Equivariant Topological Neural Networks

24 May 2024arXiv:2405.15429archive 2025-07-28

Claudio Battiloro, Ege Karaismailoğlu, Mauricio Tec, George Dasoulas, Michelle Audirac, Francesca Dominici

Graph neural networks excel at modeling pairwise interactions, but they cannot flexibly accommodate higher-order interactions and features. Topological deep learning (TDL) has emerged recently as a promising tool for addressing this issue. TDL enables the principled modeling of arbitrary multi-way, hierarchical higher-order interactions by operating on combinatorial topological spaces, such as simplicial or cell complexes, instead of graphs. However, little is known about how to leverage geometric features such as positions and velocities for TDL. This paper introduces E(n)-Equivariant Topological Neural Networks (ETNNs), which are E(n)-equivariant message-passing networks operating on combinatorial complexes, formal objects unifying graphs, hypergraphs, simplicial, path, and cell complexes. ETNNs incorporate geometric node features while respecting rotation, reflection, and translation equivariance. Moreover, being TDL models, ETNNs are natively ready for settings with heterogeneous interactions. We provide a theoretical analysis to show the improved expressiveness of ETNNs over architectures for geometric graphs. We also show how E(n)-equivariant variants of TDL models can be directly derived from our framework. The broad applicability of ETNNs is demonstrated through two tasks of vastly different scales: i) molecular property prediction on the QM9 benchmark and ii) land-use regression for hyper-local estimation of air pollution with multi-resolution irregular geospatial data. The results indicate that ETNNs are an effective tool for learning from diverse types of richly structured data, as they match or surpass SotA equivariant TDL models with a significantly smaller computational burden, thus highlighting the benefits of a principled geometric inductive bias. Our implementation of ETNNs can be found at https://github.com/NSAPH-Projects/topological-equivariant-networks.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2405.15429")

Code

Syntology Ran 9 of 11 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 9 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

NSAPH-Projects/topological-equivariant-networks officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 9 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

9ran
2unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from NSAPH-Projects/topological-equivariant-networks. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

calc_mean_mad NSAPH-Projects/topological-equivariant-networks/utils.py official repository ran MIT (permissive) · a1227f576949ad3f · report
compute_hausdorff_distances NSAPH-Projects/topological-equivariant-networks/etnn/invariants.py official repository ran MIT (permissive) · 57888a47e0dc9589 · report
compute_max_pairwise_distances NSAPH-Projects/topological-equivariant-networks/etnn/invariants.py official repository ran fingerprinted MIT (permissive) · b63d8870ecac980e · report
get_lifters NSAPH-Projects/topological-equivariant-networks/etnn/lifter.py official repository ran MIT (permissive) · 095519b2ea015a4c · report
get_num_features_dict NSAPH-Projects/topological-equivariant-networks/etnn/lifter.py official repository ran MIT (permissive) · 5aa9ccb45cdca158 · report
load_checkpoint NSAPH-Projects/topological-equivariant-networks/utils.py official repository ran MIT (permissive) · 1a7099daf45e7846 · report
parse_ranking_logic NSAPH-Projects/topological-equivariant-networks/etnn/lifter.py official repository ran fingerprinted MIT (permissive) · 4c01824d6832c892 · report
scatter_add NSAPH-Projects/topological-equivariant-networks/etnn/utils.py official repository ran MIT (permissive) · 7cce375add6e219b · report
scatter_mean NSAPH-Projects/topological-equivariant-networks/etnn/utils.py official repository ran MIT (permissive) · 0a286a7c0173d4d3 · report
compute_invariants NSAPH-Projects/topological-equivariant-networks/etnn/invariants.py official repository unverified MIT (permissive) · cf7d03bc54c0c8cc · report
scatter_min NSAPH-Projects/topological-equivariant-networks/etnn/utils.py official repository unverified MIT (permissive) · 8ba1b974ba287d64 · report

Tasks

Inductive BiasMolecular Property PredictionProperty Prediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections