REVIEW 3 cited by
Gaussian Processes on Cellular 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
read the original abstract
In recent years, there has been considerable interest in developing machine learning models on graphs to account for topological inductive biases. In particular, recent attention has been given to Gaussian processes on such structures since they can additionally account for uncertainty. However, graphs are limited to modelling relations between two vertices. In this paper, we go beyond this dyadic setting and consider polyadic relations that include interactions between vertices, edges and one of their generalisations, known as cells. Specifically, we propose Gaussian processes on cellular complexes, a generalisation of graphs that captures interactions between these higher-order cells. One of our key contributions is the derivation of two novel kernels, one that generalises the graph Mat\'ern kernel and one that additionally mixes information of different cell types.
Forward citations
Cited by 3 Pith papers
-
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.
-
Families of Optimal Transport Kernels for Cell Complexes
The paper defines Wasserstein and Fused Gromov-Wasserstein distances for CW complexes by substituting the Hodge Laplacian into existing graph OT formulas.
-
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.