cs.LGMay 16, 2025

Graph and Simplicial Complex Prediction Gaussian Process via the Hodgelet Representations

Authors: Mathieu Alain, So Takao, Xiaowen Dong, Bastian Rieck, Emmanuel Noutahi

Organizations: University College London · California Institute of Technology · University of Oxford · University of Fribourg · 

Abstract

Predicting labels for graph-structured data is crucial in many scientific applications. Recently, Gaussian processes with graph-level inputs have been proposed as flexible non-parametric models for classification tasks. In this work, we extend this framework to regression tasks and to simplicial complexes, enabling the modelling of attributes defined on edges and higher-order simplices. Drawing on Hodge theory, we construct representations based on the Hodge decomposition, allowing the model to distinguish between exact, co-exact, and harmonic signal components. We introduce Hodgelet representations as rich, learnable topological descriptors of simplicial complexes and show that our framework improves predictive performance across a range of applications. Our work broadens the applicability of Gaussian processes to prediction tasks at the graph and simplicial-complex levels.

Figures & tables

Appendix figures & tables19 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Topological Neural Tangent Kernel

    May 1, 2026Sanjukta KrishnagopalSpectral BiasHigher-Order GNNs

  2. TopoEmbedX: A General Framework for Representation Learning on Topological Domains

    Sep 29, 2026Florian Frantzen, Ibrahem AlJabea, Ines Henriques-Cadby +3Topological Representation LearningGraph Embedding

  3. Contraction and Hourglass Persistence for Learning on Graphs, Simplices, and Cells

    Apr 19, 2026Mattie Ji, Indradyumna Roy, Vikas GargGraph Neural NetworksGraph Representation Learning