Geometric Consistent Learning (GCL)

Updated 8 July 2026

Geometric Consistent Learning (GCL) is a framework that uses Hilbert bundles and cellular sheaves to build CNNs on irregular, infinite-dimensional domains, ensuring consistent convergence across discretizations.
It employs a two-stage discretization process—first sampling the manifold into a Hilbert cellular sheaf and then truncating fibers for finite-rank HilbNets—guaranteeing resolution independence and transferability.
GCL offers practical benefits in applications like spatiotemporal forecasting by achieving stable geometric consistency, reducing model parameters, and demonstrating theoretical convergence in complex domains.

Geometric Consistent Learning (GCL), as instantiated in “Consistent Geometric Deep Learning via Hilbert Bundles and Cellular Sheaves” (Tandon et al., 7 May 2026), is a principled framework for building and analyzing convolutional neural networks that operate on signals living over irregular geometric domains and in fibers that may be infinite-dimensional Hilbert spaces. In this setting, geometric consistency means that, when a continuous geometric domain is discretized at different resolutions or resampled, the learned convolutional operators and network outputs converge to the same underlying continuous geometric operators and remain stable across samplings. The framework realizes this objective by defining convolutional filtering on Hilbert bundles through the connection Laplacian, sampling the manifold into a Hilbert Cellular Sheaf whose sheaf Laplacian converges to the connection Laplacian, and further discretizing fibers to obtain implementable architectures, called HilbNets, that converge to their continuous counterparts and transfer across samplings of the same geometry (Tandon et al., 7 May 2026).

1. Concept and scope

In this formulation, GCL addresses modern signals that are often infinite-dimensional—such as time series, probability distributions, or operators—and that live over irregular domains such as manifolds or networks. Classical geometric deep learning largely assumes finite-dimensional features per node and may not provide cross-sampling consistency guarantees. The Hilbert-bundle construction extends Laplacian-based convolution, heat flows, and consistency theory to settings in which “the signal at each point lives in its own Hilbert space,” while allowing arbitrary metric-compatible connections (Tandon et al., 7 May 2026).

A learning system is geometrically consistent if discretization and resampling do not alter the limiting operator being learned. The paper states this in two complementary ways. First, finer samplings produce outputs that approach those of the continuous model. Second, models trained on one sampling transfer to other samplings of the same geometry. This yields a notion of resolution independence and cross-sampling stability that is central to the framework.

The specific instantiation of GCL in this work has three parts. It defines convolutional filtering on Hilbert bundles via the connection Laplacian $\Delta^{\nabla}$ and the Borel functional calculus; it shows that a discretization of the base manifold induces a Hilbert Cellular Sheaf with a sheaf Laplacian $\Delta_{\mathcal{F}}$ that converges to $\Delta^{\nabla}$ as sampling density increases; and it further discretizes fibers to obtain implementable network sheaves, proving convergence and transferability for the resulting discretized HilbNets.

2. Continuous geometric model on Hilbert bundles

The continuous setting begins with a smooth, closed $m$ -dimensional Riemannian manifold $M$ with geodesic distance $d_M$ and normalized volume form $d\mu$ . A Hilbert bundle $\pi:E\to M$ assigns to each $x\in M$ a separable real Hilbert space $H_x \cong H$ , and smooth sections are written as $\Delta_{\mathcal{F}}$ 0. A connection $\Delta_{\mathcal{F}}$ 1 on $\Delta_{\mathcal{F}}$ 2 is a covariant derivative on sections that is compatible with the Hilbert structure, so that parallel transport along curves is unitary and differentiation satisfies the Leibniz rule (Tandon et al., 7 May 2026).

The basic differential operator is the rough Laplacian, or connection Laplacian,

$\Delta_{\mathcal{F}}$ 3

where $\Delta_{\mathcal{F}}$ 4 is the formal adjoint with respect to the Riemannian metric and the fiber inner products. In an orthonormal synchronous frame $\Delta_{\mathcal{F}}$ 5 at $\Delta_{\mathcal{F}}$ 6, the paper gives the coordinate expression

$\Delta_{\mathcal{F}}$ 7

The operator extends to a closed, densely-defined operator on $\Delta_{\mathcal{F}}$ 8 and is self-adjoint there.

Convolutional filtering is then defined spectrally as

$\Delta_{\mathcal{F}}$ 9

with $\Delta^{\nabla}$ 0 a bounded Borel function. When $\Delta^{\nabla}$ 1 has discrete spectrum, this becomes

$\Delta^{\nabla}$ 2

The significance of the Borel functional calculus is that it yields bounded operators on $\Delta^{\nabla}$ 3 without requiring an eigen-expansion, so the formalism remains valid even when the spectrum is not discrete and the fibers are infinite-dimensional. The same operator generates bundle heat flow, $\Delta^{\nabla}$ 4, and the leading heat-kernel term involves parallel transport $\Delta^{\nabla}$ 5, making the connection geometrically explicit.

HilbNets are the neural architectures built on this operator. Given input sections $\Delta^{\nabla}$ 6, a filter bank $\Delta^{\nabla}$ 7 with $\Delta^{\nabla}$ 8, and a fiberwise Lipschitz nonlinearity $\Delta^{\nabla}$ 9, the layer recursion is

$m$ 0

Practical parameterizations of $m$ 1 include polynomials, rational approximations, and band-limited expansions. This suggests that the continuous theory is designed to support implementable approximations rather than remaining purely operator-theoretic.

3. From manifolds to Hilbert Cellular Sheaves

The first discretization stage samples the manifold and induces a Hilbert Cellular Sheaf on a geometric graph. Sample points $m$ 2 are drawn i.i.d. from the uniform distribution on $m$ 3, and a graph $m$ 4 with undirected edges $m$ 5 is built. The associated sheaf $m$ 6 has node stalks

$m$ 7

and edge stalks at geodesic midpoints,

$m$ 8

The restriction maps are weighted unitary transports,

$m$ 9

with

$M$ 0

Global sections, or $M$ 1-cochains, live in the direct sum

$M$ 2

The sheaf Laplacian is

$M$ 3

and acts nodewise as

$M$ 4

Its interpretation in the paper is that it measures local inconsistency across edges after parallel transport into a common edge stalk. In the scalar case, this reduces to a weighted graph Laplacian; in the bundle case, scalar weights are replaced by restriction operators.

The second discretization stage truncates the fibers. Fix an orthonormal basis $M$ 5 of $M$ 6 and the $M$ 7-dimensional subspace $M$ 8. A smooth bundle projection $M$ 9 produces a finite-rank network sheaf $d_M$ 0 with stalks $d_M$ 1 and block-matrix sheaf Laplacian

$d_M$ 2

The corresponding nodewise expression is

$d_M$ 3

where $d_M$ 4 is an edgewise transport in $d_M$ 5.

This two-stage sampling procedure is the implementability mechanism of the framework: manifold sampling produces a Hilbert sheaf, and fiber sampling produces a finite-rank network sheaf.

4. Convergence, consistency, and transferability

The central theoretical contribution is a convergence theory linking sampled sheaf operators and discretized architectures to their continuous Hilbert-bundle limits. The paper extends the sampled sheaf Laplacian to an operator on $d_M$ 6 by

$d_M$ 7

For $d_M$ 8 and any $d_M$ 9, with bandwidth $d\mu$ 0, $d\mu$ 1, the main pointwise statement is

$d\mu$ 2

For $d\mu$ 3, the paper also proves $d\mu$ 4 convergence in expectation:

$d\mu$ 5

The paper presents this as a generalization to arbitrary Hilbert bundles and cellular sheaves of the graph-Laplacian-to-Laplace–Beltrami convergence result associated with Belkin–Niyogi (Tandon et al., 7 May 2026).

Finite-rank discretization is also controlled. There exists a sequence of fiber dimensions $d\mu$ 6 such that, for $d\mu$ 7,

$d\mu$ 8

Thus both manifold refinement and fiber refinement participate in the consistency result.

The same logic extends from operators to networks. For bounded continuous filters $d\mu$ 9 and fiberwise Lipschitz $\pi:E\to M$ 0, the paper states convergence in architecture,

$\pi:E\to M$ 1

It also proves transferability across independent samplings:

$\pi:E\to M$ 2

This is the formal statement of cross-sampling consistency. In the terminology of the paper, implementable HilbNets converge to the underlying continuous architectures and remain transferable across different samplings of the same bundle.

5. Architectures, algorithms, and implementation pipeline

The practical pipeline proceeds in four stages. First, one samples $\pi:E\to M$ 3 or uses given sensors or points. Second, one builds a graph $\pi:E\to M$ 4 with edges by $\pi:E\to M$ 5-ball or $\pi:E\to M$ 6-NN under geodesic distance, or a task-specific metric, and sets kernel weights $\pi:E\to M$ 7. Third, for each edge $\pi:E\to M$ 8 one chooses a geodesic $\pi:E\to M$ 9 and midpoint $x\in M$ 0 and computes or learns parallel transports $x\in M$ 1 and $x\in M$ 2. Fourth, one assembles the restriction maps and the sheaf Laplacian $x\in M$ 3 in the Hilbert case or $x\in M$ 4 in the finite-rank case (Tandon et al., 7 May 2026).

Implementable filtering avoids eigendecomposition through polynomial approximations:

$x\in M$ 5

where $x\in M$ 6 is $x\in M$ 7 or $x\in M$ 8. The paper also states that Chebyshev polynomials and Lanczos/CG-based filtering apply. For sparse $x\in M$ 9-NN graphs, polynomial filtering costs $H_x \cong H$ 0 per layer.

The framework allows several signal models. For time series, fibers may be $H_x \cong H$ 1 or $H_x \cong H$ 2 after truncation, with $H_x \cong H$ 3 applied coordinatewise in a fiber basis. For distributions, fibers may be $H_x \cong H$ 4 via quantile embeddings. For operators or fields, fibers may be subspaces of $H_x \cong H$ 5, with transports learned or computed from domain priors. Transport regularization can be imposed by optimizing over an admissible class $H_x \cong H$ 6, such as orthogonal or circulant transports, using a kernel on fibers.

A concise summary of the architecture and pipeline is useful:

Component	Construction	Role
Continuous operator	$H_x \cong H$ 7 on a Hilbert bundle	Defines convolution by $H_x \cong H$ 8
Spatial discretization	Hilbert Cellular Sheaf $H_x \cong H$ 9	Approximates geometry and connection
Fiber discretization	Network sheaf $\Delta_{\mathcal{F}}$ 00	Makes computation finite-rank
Filtering	Polynomial or related approximation	Avoids eigendecomposition
Network	HilbNet recursion with fiberwise $\Delta_{\mathcal{F}}$ 01	Learns bundle-valued predictors

This suggests that GCL is not a single loss term but an end-to-end discretization principle: continuous geometry, sampled sheaf geometry, finite-rank implementation, and architecture-level stability are treated as a single pipeline.

6. Empirical validation and observed behavior

The empirical evaluation in the paper includes both synthetic and real-world tasks. In the synthetic transport recovery experiment, the setting is a statistical bundle over centered Gaussians on $\Delta_{\mathcal{F}}$ 02 with Otto–Wasserstein metric, finite-rank computational fibers of dimension $\Delta_{\mathcal{F}}$ 03, and Levi–Civita transports known in closed form. The reported result is that a free $\Delta_{\mathcal{F}}$ 04 transport parametrization via Householder products recovers the Levi–Civita transport to numerical precision, approximately $\Delta_{\mathcal{F}}$ 05, while circulant and frozen-identity transport classes converge to analytical Frobenius-projection plateaus within approximately $\Delta_{\mathcal{F}}$ 06 (Tandon et al., 7 May 2026).

On spatiotemporal traffic forecasting with METR-LA and PEMS-BAY, each node carries a time-series fiber of dimension $\Delta_{\mathcal{F}}$ 07, and HilbNets use polynomial filters of order $\Delta_{\mathcal{F}}$ 08. The transport classes are frozen identity, circulant, and free $\Delta_{\mathcal{F}}$ 09. The paper reports MAE, RMSE, and MAPE for horizons $\Delta_{\mathcal{F}}$ 10, and states three qualitative outcomes: learning non-trivial transports consistently improves over frozen identity at all horizons; free $\Delta_{\mathcal{F}}$ 11 achieves best overall accuracy on METR-LA; and circulant transports remain competitive while using approximately $\Delta_{\mathcal{F}}$ 12 fewer transport parameters. The same experiments are reported to outperform FC-LSTM baselines with far fewer parameters.

The empirical discussion in the paper is explicitly tied back to the theoretical claims. The two-stage discretization is described as yielding implementable architectures; polynomial filtering avoids eigendecompositions; structured transport classes encode domain priors such as time-stationarity; and the observed stability across sampling refinements is presented as consistent with the convergence and transferability theorems. A plausible implication is that the theory is intended not merely as asymptotic justification, but as a design criterion for architecture choice and transport parameterization.

The expression “Geometric Consistent Learning” is not used uniformly across recent arXiv literature. Some works use GCL as a broad principle of preserving geometry under learning, while others use the acronym for different method names. The following examples illustrate the diversity of usage.

Usage of GCL	Domain	Paper
Geometric consistency via Hilbert bundles and sheaves	Geometric deep learning	(Tandon et al., 7 May 2026)
Semantic Geometry Preservation in continual VLM learning	Continual learning	(He et al., 12 Mar 2026)
Geometric Set Consistency as a concrete method	Self-supervised 2D/3D vision	(Chen et al., 2022)
Group-wise Contrastive Learning	LiDAR registration	(Liu et al., 2023)
Geometry Contrastive Learning	Heterogeneous graphs	(Zhu et al., 2022)

Several neighboring directions align with the same underlying idea that geometry should remain stable under training. “Semantic Geometry Preservation for Continual Learning” constrains cross-modal semantic geometry in pretrained vision-LLMs and explicitly links its method to the GCL principle (He et al., 12 Mar 2026). “Self-Supervised Image Representation Learning with Geometric Set Consistency” treats 3D-derived geometric consistency sets as pseudo-consistency labels for 2D representation learning and states that GSC is conceptually a direct instantiation of the broader GCL paradigm (Chen et al., 2022). “DCL: Differential Contrastive Learning for Geometry-Aware Depth Synthesis” presents GCL as the principle of enforcing invariance of geometric properties across domains during translation or adaptation (Shen et al., 2021). In multi-view stereo, GC-MVSNet and GC MVSNet plus plus enforce multi-view, multi-scale geometric consistency during learning rather than only as post-processing (Vats et al., 2023, Vats et al., 6 May 2025). In continual generalized category discovery, GOAL uses a fixed Equiangular Tight Frame classifier to impose a consistent geometric structure throughout learning, and its description states that, although the paper does not introduce the term GCL, it operationalizes the same core idea (Han et al., 23 Feb 2026).

This suggests that the acronym GCL is not standardized, but the recurring theme is stable geometry under discretization, adaptation, or task progression. Within that landscape, the Hilbert-bundle formulation is distinguished by its operator-theoretic scope, its explicit use of Hilbert Cellular Sheaves, and its convergence results for both sampled Laplacians and full neural architectures (Tandon et al., 7 May 2026).

The framework also has explicit assumptions and limitations. The main convergence theorems assume that $\Delta_{\mathcal{F}}$ 13 is closed, sampling is i.i.d. from the uniform measure, sections lie in $\Delta_{\mathcal{F}}$ 14 or $\Delta_{\mathcal{F}}$ 15, and transports are metric-compatible and unitary. The paper notes that real-world networks may be non-uniformly sampled and non-compact; computing or learning parallel transports can be challenging; and the block-matrix $\Delta_{\mathcal{F}}$ 16 scales with $\Delta_{\mathcal{F}}$ 17, so large fibers or graphs may require sparsification or multi-scale methods. Open questions listed in the paper include extending convergence rates, handling non-uniform sampling and boundary effects, adaptive transport learning with theoretical guarantees, and deeper connections to transformer architectures via learned sheaf transports and position-dependent bundles (Tandon et al., 7 May 2026).