Binarized Simplicial Convolutional Neural Networks
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks have a limitation of solely processing features on graph nodes, neglecting data on high-dimensional structures such as edges and triangles. Simplicial Convolutional Neural Networks (SCNN) represent higher-order structures using simplicial complexes to break this limitation albeit still lacking time efficiency. In this paper, we propose a novel neural network architecture on simplicial complexes named Binarized Simplicial Convolutional Neural Networks (Bi-SCNN) based on the combination of simplicial convolution with a binary-sign forward propagation strategy. The usage of the Hodge Laplacian on a binary-sign forward propagation enables Bi-SCNN to efficiently and effectively represent simplicial features that have higher-order structures than traditional graph node representations. Compared to the previous Simplicial Convolutional Neural Networks, the reduced model complexity of Bi-SCNN shortens the execution time without sacrificing the prediction performance and is less prone to the over-smoothing effect. Experimenting with real-world citation and ocean-drifter data confirmed that our proposed Bi-SCNN is efficient and accurate.
Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). Builds on 29 of its 45 references that are in the map. First posted on arXiv 7 May 2024.
Builds on
29 of 45 references.
References · 29
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,318
- 2017Graph Attention Networkscited by 8,888
- 2017Inductive Representation Learning on Large Graphscited by 6,303
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,422
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,086
- 2019Simplifying Graph Convolutional Networkscited by 1,474
- 2017Spatio-Temporal Graph Convolutional Networks: A Deep Learning Framework for Traffic Forecastingcited by 1,130
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
- 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 411
- 2020Towards Deeper Graph Neural Networkscited by 296
- 2019Understanding Straight-Through Estimator in Training Activation Quantized Neural Netscited by 228
- 2021Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networkscited by 220
17 more
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 165
- 2018Construction of the Literature Graph in Semantic Scholarcited by 118
- 2020Simplicial Neural Networkscited by 107
- 2019Topological Signal Processing over Simplicial Complexescited by 95
- 2018Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplaciancited by 84
- 2022Simplicial Attention Networkscited by 41
- 2021Simplicial Convolutional Neural Networkscited by 40
- 2023Graph Signal Processing: History, Development, Impact, and Outlookcited by 39
- 2018Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Spacecited by 37
- 2020Bi-GCN: Binary Graph Convolutional Networkcited by 28
- 2022Simplicial Attention Neural Networkscited by 21
- 2022Simplicial Convolutional Filterscited by 18
- 2021Dist2Cycle: A Simplicial Neural Network for Homology Localizationcited by 16
- 2021AdaSTE: An Adaptive Straight-Through Estimator to Train Binary Neural Networkscited by 11
- 2022Adaptive Sign Algorithm for Graph Signal Processingcited by 11
- 2023Sequential Monte Carlo Graph Convolutional Network for Dynamic Brain Connectivitycited by 6
- 2022ProtoCLIP: Prototypical Contrastive Language Image Pretrainingcited by 5
Built on by
Citing papers per year: 2024: 2; 2025: 1.
3 papers.
- 2025Directed Semi-Simplicial Learning with Applications to Brain Activity Decoding23 May 2025
- 2024LLM Online Spatial-temporal Signal Reconstruction Under Noise24 Nov 2024
- 2024Graph Signal Adaptive Message Passing23 Oct 2024