arXiv Machine Learning August 18, 2026 By Willem Diepeveen, Melanie Weber

Iso-Riemannian Optimization on Learned Data Manifolds

Read the original on arXiv Machine Learning →

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.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 27

Energy Manifold Natural Gradient Descent: Riemannian Optimization for Neural PDE Solvers

arXiv:2607. 22004v1 Announce Type: new Abstract: Energy natural gradient descent (ENGD) aligns parameter updates with the curvature of an underlying function-space energy, but existing formulations assume an unconstrained Euclidean parameter domain.

By Zhangyong Liang, Huanhuan Gao

benchmarks

arXiv Machine Learning

Jul 21

Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective

arXiv:2209. 15130v3 Announce Type: replace-cross Abstract: We study a general matrix optimization problem with a fixed-rank positive semidefinite (PSD) constraint.

By Yuetian Luo, Nicolas Garcia Trillos

arXiv Machine Learning

Aug 4

Smooth Reparameterizations of Functions on Simplicial Product Spaces: Applications to Probabilistic Tensor Decomposition and Functional Data Registration

arXiv:2608. 02576v1 Announce Type: new Abstract: We consider optimization problems defined on product spaces of simplices.

By Shashwat Kumar, Arafat Rahman, Anuj Srivastava, P. -A. Absil

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

Jul 2

Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates

arXiv:2503. 24075v4 Announce Type: replace-cross Abstract: Low-rank optimization problems with sparse simplex constraints involve variables that must satisfy nonnegativity, sparsity, and sum-to-1 conditions, making their optimization particularly challenging due to the interplay between low-rank structures and constraints.

By Flavia Esposito, Andersen Ang

efficiency

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

Related stories

Energy Manifold Natural Gradient Descent: Riemannian Optimization for Neural PDE Solvers

Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective

Smooth Reparameterizations of Functions on Simplicial Product Spaces: Applications to Probabilistic Tensor Decomposition and Functional Data Registration

Riemannian Deep Learning: Modules, Networks, and Geometries

Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates

Riemannian Deep Learning:Modules, Networks, and Geometries