REVIEW 8 cited by
Convolutional Learning on Simplicial Complexes
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
Signed reviews
read the original abstract
We propose a simplicial complex convolutional neural network (SCCNN) to learn data representations on simplicial complexes. It performs convolutions based on the multi-hop simplicial adjacencies via common faces and cofaces independently and captures the inter-simplicial couplings, generalizing state-of-the-art. Upon studying symmetries of the simplicial domain and the data space, it is shown to be permutation and orientation equivariant, thus, incorporating such inductive biases. Based on the Hodge theory, we perform a spectral analysis to understand how SCCNNs regulate data in different frequencies, showing that the convolutions via faces and cofaces operate in two orthogonal data spaces. Lastly, we study the stability of SCCNNs to domain deformations and examine the effects of various factors. Empirical results show the benefits of higher-order convolutions and inter-simplicial couplings in simplex prediction and trajectory prediction.
Forward citations
Cited by 8 Pith papers
-
Geometry-Induced Hodge Stars on Rips and Dowker--Rips Complexes
A weighted Hodge Laplacian on Rips-type complexes with volume- or witness-based diagonal weights preserves Betti numbers and yields geometry-sensitive spectra.
-
Topological Adaptive Least Mean Squares Algorithms over Simplicial Complexes
Topo-LMS brings classical least-mean-squares adaptive filtering to edge signals over simplicial complexes, with stability conditions, closed-form steady-state error, and optimal sampling strategies.
-
HOPSE: Scalable Higher-Order Positional and Structural Encoder for Combinatorial Representations
HOPSE encodes higher-order topological data by applying graph positional and structural encoders to Hasse graph decompositions, matching or exceeding message-passing models on benchmarks with up to 7x faster training.
-
Quantum Simplicial Neural Networks
Quantum Simplicial Networks, variational quantum circuits acting on simplicial complexes, outperform classical simplicial neural networks on two synthetic classification benchmarks, per the authors.
-
Cellular sheaf Laplacians on the set of simplices of symmetric simplicial set induced by hypergraph
Cellular sheaf Laplacians are generalized to symmetric simplicial sets induced by hypergraphs, with a Hodge theorem connecting their kernels to sheaf cohomology.
-
Heat Kernel Goes Topological
TopoHKS defines a weighted combinatorial-complex Laplacian and heat kernel descriptor, claiming maximal expressive power; the supporting uniqueness theorem is incorrect.
-
CellCLAT: Preserving Topology and Trimming Redundancy in Self-Supervised Cellular Contrastive Learning
CellCLAT applies parameter-perturbation contrastive learning to cellular complexes and adaptively trims 2-cells to improve downstream graph classification.
-
Topological Signal Processing and Learning: Recent Advances and Future Challenges
A survey of topological signal processing and learning that uses Hodge theory to unify recent advances in processing signals on simplicial and cell complexes.
Discussion (0). Continue with ORCID to comment.