Graph and Simplicial Complex Prediction Gaussian Process via the Hodgelet Representations

Predicting the labels of graph-structured data is crucial in scientific applications and is often achieved using graph neural networks (GNNs). However, when data is scarce, GNNs suffer from overfitting, leading to poor performance. Recently, Gaussian processes (GPs) with graph-level inputs have been proposed as an alternative. In this work, we extend the Gaussian process framework to simplicial complexes (SCs), enabling the handling of edge-level attributes and attributes supported on higher-order simplices. We further augment the resulting SC representations by considering their Hodge decompositions, allowing us to account for homological information, such as the number of holes, in the SC. We demonstrate that our framework enhances the predictions across various applications, paving the way for GPs to be more widely used for graph and SC-level predictions.

@article{alain2025_2505.10877,
  title={ Graph and Simplicial Complex Prediction Gaussian Process via the Hodgelet Representations },
  author={ Mathieu Alain and So Takao and Xiaowen Dong and Bastian Rieck and Emmanuel Noutahi },
  journal={arXiv preprint arXiv:2505.10877},
  year={ 2025 }
}