paper-with-me

홈 › Papers

Consistent Geometric Deep Learning via Hilbert Bundles and Cellular Sheaves

2026-05-07 · Kartik Tandon, Julian Gould, Tanishq Bhatia, Francesca Dominici, Alejandro Ribeiro, Claudio Battiloro arxiv

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.

📄 PDF Abstract BibTeX arXiv:2605.06395

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs

2022-02-09 · Cristian Bodnar, Francesco Di Giovanni, Benjamin Paul Chamberlain, Pietro Liò 외

Cellular sheaves equip graphs with a "geometrical" structure by assigning vector spaces and linear maps to nodes and edges. Graph Neural Networks (GNNs) implicitly assume a graph with a trivial underlying sheaf. This cho…

Node ClassificationNode Classification on Non-Homophilic (Heterophilic) Graphs

Homogeneous vector bundles and $G$-equivariant convolutional neural networks

2021-05-12 · Jimmy Aronsson

$G$-equivariant convolutional neural networks (GCNNs) is a geometric deep learning model for data defined on a homogeneous $G$-space $\mathcal{M}$. GCNNs are designed to respect the global symmetry in $\mathcal{M}$, ther…

Aligning Cellular Sheaves with Classifier Attention for Interpretable Weakly-Supervised Pathology Localization

2026-05-24 · Devansh Lalwani, Swapnil Bhat, Maulik Shah arxiv

Weakly-supervised classification of whole-slide images with attention-based multiple instance learning (ABMIL) on top of foundation features now reaches near-saturation on Camelyon16 slide-level performance, but the corr…

Multiple Instance Learning

Sheaf Neural Networks on SPD Manifolds: Second-Order Geometric Representation Learning

2026-04-22 · Yuhan Peng, Junwen Dong, Yuzhi Zeng, Hao Li 외 arxiv

Graph neural networks face two fundamental challenges rooted in the linear structure of Euclidean vector spaces: (1) Current architectures represent geometry through vectors (directions, gradients), yet many tasks requir…

Representation Learning

Heterogeneous Sheaf Neural Networks

2024-09-12 · Luke Braithwaite, Iulia Duta, Pietro Liò

Heterogeneous graphs, with nodes and edges of different types, are commonly used to model relational structures in many real-world applications. Standard Graph Neural Networks (GNNs) struggle to process heterogeneous dat…