arXiv:2611.23543v1 Announce Type: new
Abstract: Geometric convolutions on Riemannian manifolds depend on the geometry of the underlying domain, making stability under metric perturbations a fundamental question in geometric deep learning. This paper studies this question for parallel transport convolution through methods from differential geometry and analysis. On a fixed compact manifold, we establish that, for a continuous input signal and a continuous reference kernel supported in a sufficiently small normal neighborhood, the convolution output depends continuously in $L^2$ on the Riemannian metric in the $C^2$-topology, under the specified localization and transport-path conventions. The analysis develops perturbation estimates for geodesics, parallel transport, Jacobi fields, and exponential maps, and uses these estimates to compare the transported kernels. A central difficulty is the cut locus, which obstructs uniform comparison of the transport construction over the entire manifold. We address this difficulty by combining uniform estimates away from the cut locus with integral bounds on neighborhoods of arbitrarily small volume, while also controlling the change in the Riemannian volume measure. The resulting qualitative stability theorem connects perturbation theory for Riemannian geometric constructions with the analysis of spatial convolution operators in geometric deep learning.
Trending
- HiSA: Sparsifying the Hidden Dimension of RoPE Attention in LLMs
- Realized versus Population Reliability: Anytime-Valid Self-Consistency Certification under Correlated Reasoning
- Learning from Context: Leave-One-Out Prediction in Jump Diffusions
- Represented but misread: Post-training changes how language models read out what they represent
- Mamba Flow Matching Neural Processes: Linear-Time Inference for Irregularly Observed Spatial Fields
- Cost-Aware Agentic Feature Optimization System for Fleet-Scale Ranking Models
- TRCF: Temporal-Reference Complementary Forecasting for Irregular Multivariate Time Series
- [2611.26515] Simple Private Noisy SGD is Minimax-Optimal under Population Strong Convexity
