让下一篇重要论文，不再错过。

原文摘要

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.