用希尔伯特丛构建无限维信号的卷积网络,统一几何深度学习框架。
Consistent Geometric Deep Learning via Hilbert Bundles and Cellular Sheaves

- 以希尔伯特丛的联络拉普拉斯算子作卷积核,构造新型神经网络 HilbNets。
- 采样后模型在密度增加时收敛于原始连续架构,保证学习一致性。
- 适用于流形上每点为无限维空间的复杂信号,适合几何学习研究者。
现代深度学习架构越来越多地处理天然无限维的信号,如时间序列、概率分布或算子,且定义在不规则域上。然而,这类场景缺乏统一的学习理论。为此,本文提出一种针对流形上可能无限维信号的新型卷积学习框架:使用与希尔伯特丛相关的联络拉普拉斯算子作为卷积算子,并推导出滤波器与神经网络,称为 HilbNets。通过两阶段采样过程实现可计算性:首先证明采样诱导出希尔伯特细胞层(Hilbert Cellular Sheaf),其层拉普拉斯算子在采样密度增加时以概率收敛于原始联络拉普拉斯算子;此结果推广了 Belkin & Niyogi 的经典图拉普拉斯收敛定理至无限维束情形。其次,对信号离散化后证明 HilbNets 能收敛到连续架构,并可在不同采样间迁移,提供学习一致性保障。最后,在合成与真实世界任务中验证框架有效性。整体成果将经典基于拉普拉斯的几何学习框架拓展至每点信号位于独立希尔伯特空间的场景。
原文摘要 · Abstract (English)
Modern deep learning architectures increasingly contend with sophisticated signals that are natively infinite-dimensional, such as time series, probability distributions, or operators, and are defined over irregular domains. Yet, a unified learning theory for these settings has been lacking. To start addressing this gap, we introduce a novel convolutional learning framework for possibly infinite-dimensional signals supported on a manifold. Namely, we use the connection Laplacian associated with a Hilbert bundle as a convolutional operator, and we derive filters and neural networks, dubbed as \textit{HilbNets}. We make HilbNets and, more generally, the convolution operation, implementable via a two-stage sampling procedure. First, we show that sampling the manifold induces a Hilbert Cellular Sheaf, a generalized graph structure with Hilbert feature spaces and edge-wise coupling rules, and we prove that its sheaf Laplacian converges in probability to the underlying connection Laplacian as the sampling density increases. Notably, this result is a generalization to the infinite-dimensional bundle setting of the Belkin \& Niyogi \cite{BELKIN20081289} convergence result for the graph Laplacian to the manifold Laplacian, a theoretical cornerstone of geometric learning methods. Second, we discretize the signals and prove that the discretized (implementable) HilbNets converge to the underlying continuous architectures and are transferable across different samplings of the same bundle, providing consistency for learning. Finally, we validate our framework on synthetic and real-world tasks. Overall, our results broaden the scope of geometric learning as a whole by lifting classical Laplacian-based frameworks to settings where the signal at each point lives in its own Hilbert space.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。