HackerPapers

arXiv:2010.03633cs.LG

Simplicial Neural Networks

Stefania Ebli, Michaël Defferrard, Gard Spreemann

Abstract

We present simplicial neural networks (SNNs), a generalization of graph neural networks to data that live on a class of topological spaces called simplicial complexes. These are natural multi-dimensional extensions of graphs that encode not only pairwise relationships but also higher-order interactions between vertices - allowing us to consider richer data, including vector fields and $n$-fold collaboration networks. We define an appropriate notion of convolution that we leverage to construct the desired convolutional neural networks. We test the SNNs on the task of imputing missing data on coauthorship complexes.

arXiv comments
Journal reference
DOI
Subjects
cs.LGMachine Learning math.ATAlgebraic Topology stat.MLMachine Learning (Statistics)

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from Aug 2021 to Jun 2024.

Comments linking this paper, per year.

Discussed in comments2 threads

    • There's been a decent amount of work using simplicial complexes and related ideas to generalize graph neural networks, e.g. [0], [1]. If LLMs obey a similar geometry, it could be a promising direction for multimodal models and more principled RAGs with better inductive biases.…

      mjhayView on HNParent context

    • At least there is work on greatly generalizing convolutions. They're much more broadly applicable (in neural networks) to very differently structured data than they appear to be in their standard form. (The "in neural networks" qualifier is there because quite a bit of this has…

      gsprView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.