The paper defines Wasserstein and Fused Gromov-Wasserstein distances for CW complexes by substituting the Hodge Laplacian into existing graph OT formulas.
Gaussian Processes on Cellular Complexes
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
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.