Simplicial Complex Representation Learning
arXiv:2103.04046
Abstract
Simplicial complexes form an important class of topological spaces that are frequently used in many application areas such as computer-aided design, computer graphics, and simulation. Representation learning on graphs, which are just 1-d simplicial complexes, has witnessed a great attention in recent years. However, there has not been enough effort to extend representation learning to higher dimensional simplicial objects due to the additional complexity these objects hold, especially when it comes to entire-simplicial complex representation learning. In this work, we propose a method for simplicial complex-level representation learning that embeds a simplicial complex to a universal embedding space in a way that complex-to-complex proximity is preserved. Our method uses our novel geometric message passing schemes to learn an entire simplicial complex representation in an end-to-end fashion. We demonstrate the proposed model on publicly available mesh dataset. To the best of our knowledge, this work presents the first method for learning simplicial complex-level representation.
MACHINE LEARNING ON GRAPHS, MLoG Workshop at WSDM'22
References in corpus (11)
- Semi-Supervised Classification with Graph Convolutional Networks
- Fast Graph Representation Learning with PyTorch Geometric
- graph2vec: Learning Distributed Representations of Graphs
- Simplicial Neural Networks
- Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks
- Simplex2Vec embeddings for community detection in simplicial complexes
- Principled Simplicial Neural Networks for Trajectory Prediction
- Simplicial 2-Complex Convolutional Neural Nets
- k-simplex2vec: a simplicial extension of node2vec
- Hausdorff metric between simplicial complexes
- Mesh Learning Using Persistent Homology on the Laplacian Eigenfunctions