Graph Classification Gaussian Processes via Hodgelet Spectral Features

The problem of classifying graphs is ubiquitous in machine learning. While it is standard to apply graph neural networks for such tasks, Gaussian processes can also be used, by transforming graph features into the spectral domain, and using the resulting spectral features as input points. However, this approach only takes into account features on vertices, whereas some graph data also support features on edges. In this work, we present a Gaussian process-based classification algorithm that can utilise vertex and/or edges features to help classify graphs. Furthermore, we take advantage of the Hodge decomposition of vertex and edge features to increase the flexibility of the model, which can be beneficial on some tasks.

@article{alain2025_2410.10546,
  title={ Graph Classification Gaussian Processes via Hodgelet Spectral Features },
  author={ Mathieu Alain and So Takao and Xiaowen Dong and Bastian Rieck and Emmanuel Noutahi },
  journal={arXiv preprint arXiv:2410.10546},
  year={ 2025 }
}