Pith. sign in

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

arxiv 2311.01198 v2 pith:Z4BPKNXC submitted 2023-11-02 cs.LG stat.ML

classification cs.LGstat.ML
keywords gaussiangraphsprocessesaccountadditionallybeencellscellular
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Quantum Simplicial Neural Networks

    cs.NE 2025-01 conditional novelty 6.0 of 10

    Quantum Simplicial Networks, variational quantum circuits acting on simplicial complexes, outperform classical simplicial neural networks on two synthetic classification benchmarks, per the authors.

  2. Families of Optimal Transport Kernels for Cell Complexes

    cs.LG 2025-07 reject novelty 4.0 of 10

    The paper defines Wasserstein and Fused Gromov-Wasserstein distances for CW complexes by substituting the Hodge Laplacian into existing graph OT formulas.

  3. Topological Signal Processing and Learning: Recent Advances and Future Challenges

    eess.SP 2024-12 accept novelty 2.0 of 10

    A survey of topological signal processing and learning that uses Hodge theory to unify recent advances in processing signals on simplicial and cell complexes.

Pith tools