pith. sign in

arxiv: 2012.06010 · v1 · pith:B4II57XAnew · submitted 2020-12-10 · 🧮 math.AT

Simplicial 2-Complex Convolutional Neural Nets

classification 🧮 math.AT
keywords neuralsimplicialcomplexesconvolutionalgraphhypergraphnetworkstructures
0
0 comments X
read the original abstract

Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in general do not account for higher order relations between their hyperedges. Simplicial complexes offer a middle ground, with a rich theory to draw on. We develop a convolutional neural network layer on simplicial 2-complexes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Learning Dynamic Stability Landscapes in Synchronization Networks

    cs.LG 2026-05 unverdicted novelty 7.0

    Introduces graph-to-image prediction of per-node dynamic stability landscapes in oscillator networks from topology, releases two 10k-graph datasets, and shows GNN-CNN models achieve good accuracy with cross-size gener...