Skip to content

1-Lipschitz Neural Networks on Hadamard Manifolds

Jul 2026 · arXiv.org · Vol abs/2607.19335 · 0 citations · 63 references
Mathematics Computer Science

TL;DR

This work constructs and analyzes a class of 1-Lipschitz neural networks on Hadamard manifolds, and shows improved results from the nonexpansive denoiser over static, data-only, and Log-Euclidean denoising baselines, and empirically test its convergence properties.

Abstract

Controlling the Lipschitz constant of a neural network is a standard way to promote robustness and stability. Most existing constraining strategies are designed for Euclidean spaces. In this work, we construct and analyze a class of 1-Lipschitz neural networks on Hadamard manifolds. Our layers are of gradient-descent type, $1$-Lipschitz, and quasi-$\alpha$-firmly nonexpansive. The core building blocks of the proposed architecture are Busemann functions, and we exploit the properties of Busemann gradient flows to design $1$-Lipschitz geometry-preserving layers. We provide explicit constructions and examples for hyperbolic manifolds and the manifold of symmetric positive definite (SPD) matrices. We test the proposed architecture in two numerical experiments: robust classification on the Poincar\'e disk and masked-Wishart covariance reconstruction. On the Poincar\'e disk, the proposed networks yield robust classifiers under hyperbolic perturbations. On the SPD manifold, we train SPD-valued denoisers and adopt them as a Plug-and-Play prior for a masked-Wishart covariance reconstruction problem. We show improved results from the nonexpansive denoiser over static, data-only, and Log-Euclidean denoising baselines, and empirically test its convergence properties.

View source

Similar papers

Sep 2026

The Geometric Whitney Problem and Approximations by Neural Networks on Manifolds

Abstract Why do neural networks overcome the curse of dimensionality? A common justification is that real-life high-dimensional data typically lie close to low-dimensional manifolds, and that neural networks can exploit this structure efficiently – overcoming the curse of dimensionality for their parameter counts. Howe...

Jakob Konstantin Hecker · 0 citations
Preprint Sep 2026

Projected Gradient Method on Hadamard Manifolds

We study constrained smooth optimization problems on Hadamard manifolds with closed geodesically convex feasible sets. We analyze two projected gradient schemes: one with a constant stepsize and another with a backtracking line search. The constant-stepsize scheme is analyzed under the assumption that the objective fun...

O. P. Ferreira, M. L. N. Gonçalves, Á. M. González et al. · 0 citations
Jul 2026

On the robustness of noisy solutions in non-convex neural networks

Using a finite energy message-passing algorithm, it is demonstrated numerically that thermal noise enables effective generalization in the regime of constraint densities where both recovering the teacher and finding a zero temperature solution are computationally hard.

Enrico M. Malatesta, A. Passalacqua, Riccardo Zecchina · 0 citations
Preprint Aug 2026

Fixed and Adaptive Topological DeepONets: Functional Measurements on Hausdorff Locally Convex Spaces

The Topological DeepONet framework is built on, replacing point samples by continuous linear functionals drawn from the continuous dual of a Hausdorff locally convex space, whose topology is generated by a point-separating family of seminorms rather than a single norm, and develops fixed and adaptive functional measure...

Khemraj Shukla, G. Karniadakis · 0 citations
Preprint Aug 2026

Is Grokking a Loss of Normal Hyperbolicity of the Interpolation Manifold?

A recent line of work recasts the post-memorization phase of grokking as constrained optimization: once a network interpolates the training set, weight decay drives a slow drift along the zero-loss manifold toward lower norm. In the language of dynamical systems, this is a fast-slow system in which the interpolation ma...

Suvinava Basak · 0 citations

Riemannian Deep Learning: Modules, Networks, and Geometries

Deep neural networks on manifold-valued representations have attracted growing interest, but many basic components remain tied to specific manifolds, rely on Euclidean approximations, or require costly and numerically fragile geometric operations. This thesis develops a unified framework for Riemannian deep learning fr...

Ziheng Chen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.