Pith. sign in

REVIEW 1 cited by

Simplicial Complex Representation Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2103.04046 v6 pith:M3GL4I67 submitted 2021-03-06 cs.LG cs.CGcs.CVmath.ATstat.ML

classification cs.LGcs.CGcs.CVmath.ATstat.ML
keywords simplicialrepresentationlearningcomplexmethodcomplex-levelcomplexesobjects
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Differentiable Lifting for Topological Neural Networks

    cs.LG 2026-08 conditional novelty 6.0 of 10

    A differentiable lifting framework that samples and accepts candidate higher-order cells end-to-end outperforms static liftings on multiple TNN benchmarks.

Pith tools