Simplicial complexes can be viewed as high dimensional generalizations of
graphs that explicitly encode multi-way ordered relations between vertices at
different resolutions, all at once. This concept is central towards detection
of higher dimensional topological features of data, features to which graphs,
encoding only pairwise relationships, remain oblivious. While attempts have
been made to extend Graph Neural Networks (GNNs) to a simplicial complex
setting, the methods do not inherently exploit, or reason about, the underlying
topological structure of the network. We propose a graph convolutional model
for learning functions parametrized by the $k$-homological features of
simplicial complexes. By spectrally manipulating their combinatorial
$k$-dimensional Hodge Laplacians, the proposed model enables learning
topological features of the underlying simplicial complexes, specifically, the
distance of each $k$-simplex from the nearest "optimal" $k$-th homology
generator, effectively providing an alternative to homology localization.

该论文提出了一种基于图卷积模型的方法，通过对组合 $k$- 维霍奇拉普拉斯算子的谱操作，实现对高维拓扑特征的学习，特别是距离每个 $k$- 单形形式化的最优 $k$- 阶同调生成器的距离，为同调定位提供了一种替代方法。