arXiv Machine Learning

1-Lipschitz Neural Networks on Hadamard Manifolds

arXiv:2607. 19335v1 Announce Type: cross Abstract: Controlling the Lipschitz constant of a neural network is a standard way to promote robustness and stability.

arXiv AI
Jul 22

Riemannian Deep Learning:Modules, Networks, and Geometries

arXiv:2607. 19305v1 Announce Type: cross Abstract: 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.

By Chen Ziheng
arXiv AI
Jul 24

Riemannian Deep Learning: Modules, Networks, and Geometries

arXiv:2607. 19305v2 Announce Type: replace-cross Abstract: 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.

By Chen Ziheng
arXiv Machine Learning
Jun 9

Generalization in Nonlinear Least Squares via Learned Feature Geometry

arXiv:2606. 08799v1 Announce Type: cross Abstract: We study the generalization of ridge-regularized nonlinear least-squares models via on-average algorithmic stability, deriving error bounds for local minimizers in terms of a data-dependent effective dimension that reflects the geometry of the gradient model at the trained parameters, through the empirical Jacobian Gram matrix and a residual--curvature term.

By Ayub Kharel, Ilja Kuzborski, Patrick Rebeschini, Yasin Abbasi-Yadkori
arXiv Machine Learning
Jun 25

Towards Robust EEG Decoding Based on Riemannian Self-Attention

arXiv:2606. 25456v1 Announce Type: new Abstract: Brain-Computer Interface (BCI) based on electroencephalography (EEG) enables direct interaction between the brain and external environments and has significant applications in assistive technologies, medical rehabilitation, and entertainment.

By Shaocheng Jin, Tao Zhou, Rui Wang, Ziheng Chen, Xiaoqing Luo, Xiaojun Wu, Josef Kittler
arXiv Machine Learning
Jun 30

Non-Euclidean Gradient Descent Operates at the Edge of Stability

arXiv:2603. 05002v3 Announce Type: replace Abstract: The Edge of Stability (EoS) is a phenomenon where the sharpness (largest eigenvalue) of the Hessian approaches and then hovers near the stability threshold $2/\eta$ during gradient descent (GD) with step size $\eta$.

By Rustem Islamov, Michael Crawshaw, Jeremy Cohen, Robert Gower
arXiv Machine Learning
Sep 4

A Closed-Form Formula for Consistent Lipschitz Regression on Metric Spaces with Sparse Neural Network Realizations

arXiv:2609. 03129v1 Announce Type: cross Abstract: Several classical machine-learning methods, such as KRRs and SVRs, are both computationally and analytically tractable since their estimators either admit closed-form expressions or are obtained by minimizing convex training objectives; neither feature is generally available for deep neural networks.

By Ruiyang Hong, Hrad Ghoukasian, Anastasis Kratsios
arXiv Machine Learning
Aug 18

Iso-Riemannian Optimization on Learned Data Manifolds

arXiv:2510. 21033v3 Announce Type: replace-cross Abstract: We develop a theory of iso-Riemannian optimization for problems constrained to learned data manifolds, a setting in which classical Riemannian optimization - and Riemannian gradient descent in particular - can be poorly suited.

By Willem Diepeveen, Melanie Weber
arXiv Machine Learning
Sep 15

Riemannian ascent--descent for nonconvex nonconcave minimax landscapes: convergence to basin saddle points and applications to distributionally robust optimization

The paper introduces a new convergence framework for solving distributionally robust optimization problems formulated as nonconvex, nonconcave minimax problems over a Euclidean space and a Riemannian manifold. It defines a "basin saddle point"—a locally defined Nash equilibrium—and proves that a Riemannian gradient ascent–descent algorithm converges to such points under a local Łojasiewicz growth condition. The authors apply this theory to a statistical risk DRO problem over Gaussian measures, deriving explicit convergence rates and constants in terms of data dimension, loss moments, and reference covariance.

By Rishabh Dixit, Pranav Upadrashta, Alex Cloninger
arXiv Machine Learning
Sep 7

Nested Inductive Bias Framework for SPD Manifold Learning

The paper introduces a Nested Inductive Bias framework that uses a two‑stage diffeomorphic composition to pull back non‑Euclidean target geometries onto symmetric positive definite (SPD) manifolds. This approach allows the construction of curvature‑aligned Riemannian classifiers that respect both matrix constraints and the intrinsic relational geometry of data. Empirical results on kinematic, signal processing, and synthetic benchmarks show that class separability degrades when metric curvature does not match the data distribution, and the authors also propose the Rational Conformal Metric (RCM) for robust vectorized architectures.

By Tushar Das