Directed Semi-Simplicial Learning with Applications to Brain Activity Decoding
Abstract
Graph Neural Networks (GNNs) excel at learning from pairwise interactions but often overlook multi-way and hierarchical relationships. Topological Deep Learning (TDL) addresses this limitation by leveraging combinatorial topological spaces, such as simplicial or cell complexes. However, existing TDL models are restricted to undirected settings and fail to capture the higher-order directed patterns prevalent in many complex systems, e.g., brain networks, where such interactions are both abundant and functionally significant. To fill this gap, we introduce Semi-Simplicial Neural Networks (SSNs), a principled class of TDL models that operate on semi-simplicial sets, combinatorial structures that encode directed higher-order motifs and their directional relationships. To enhance scalability, we propose Routing-SSNs, which dynamically select the most informative relations in a learnable manner. We theoretically characterize SSNs by proving they are strictly more expressive than standard graph and TDL models, and they are able to recover several topological descriptors. Building on previous evidence that such descriptors are critical for characterizing brain activity, we then introduce a new rigorous framework for brain dynamics representation learning centered on SSNs. Empirically, we test SSNs on 4 distinct tasks across 13 datasets, spanning from brain dynamics to node classification, showing competitive performance. Notably, SSNs consistently achieve state-of-the-art performance on brain dynamics classification tasks, outperforming the second-best model by up to 27\ =-1
Benchmark Results
Tested on 1 dataset
Tables show presented results in global context (best 3 papers + GCN + MLP).
Heterophily Benchmark
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Dir-Poly | 0.9451
±0.0022 | |
| 2 | D-CDE | 0.9387
±0.0041 | |
| 3 | LargeScaleNet | 0.9358
±0.0024 | |
| 4 | SSN | 0.9352
±0.0028 | This paper |
| 7 | Polynormer | 0.9255
±0.0037 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) Improvement within reported uncertainty; not highlighted. |
| 24 | Dir-GNN | 0.9123
±0.0032 | This paper |
| 26 | GraphSAGE | 0.9106
±0.0027 | prev best: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) |
| 39 | MPSNN | 0.8876
±0.0063 | This paper |
| 64 | SAGE | 0.8574
±0.0067 | |
| 135 | MLP | 0.6665
±0.0047 |
