arXiv Machine Learning

Learning Normal Coordinates on Riemannian Manifolds with Flow Charts

The paper introduces flow charts, a conditional invertible neural network designed to approximate normal coordinates on Riemannian manifolds, enabling fast Euclidean approximations of exponential and logarithmic maps. It presents a novel nonnegative loss function that is zero exactly when the chart is normal, and demonstrates that flow charts match or surpass specialized neural geodesic interpolators across sixteen synthetic and data‑derived geometries. When pretrained, flow charts achieve a median 60–70× speedup over numerical baselines while maintaining comparable logarithmic map estimation error and improving numerical geodesic solver accuracy.

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 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 Machine Learning
Jun 18

Riemannian MeanFlow for One-Step Generation on Manifolds

arXiv:2603. 10718v3 Announce Type: replace Abstract: Flow Matching enables simulation-free training of generative models on Riemannian manifolds, yet sampling typically still relies on numerically integrating a probability-flow ODE.

By Zichen Zhong, Haoliang Sun, Yukun Zhao, Yongshun Gong, Yilong Yin
arXiv AI
Jun 9

Riemannian-Manifold Steering: Geometry-Aware Generative Autoencoders for Label-Free Steering

arXiv:2605. 24942v2 Announce Type: replace-cross Abstract: Steering a language model - intervening on its internal activations to change downstream behaviour - has recently expanded beyond linear interpolation to nonlinear methods such as angular and kernelized steering, which define intervention transformations without learning an explicit geometry over paths in activation space.

By Narmeen Oozeer, Shivam Raval, Philip Quirke, Manikandan Ravikiran, Jeff Phillips, Shriyash Upadhyay, Amirali Abdullah
arXiv Machine Learning
5d ago

A Likely Geometry of Generative Models

arXiv:2510.26266v3 Announce Type: replace Abstract: The geometry of generative models serves as the basis for interpolation, model inspection, and more. Unfortunately, most generative models lack a p...

By Frederik M\"obius Rygaard, Shen Zhu, Yinzhu Jin, S{\o}ren Hauberg, Tom Fletcher
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
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
Oct 2

RW-Flow: One-Step Generation on Compact Manifolds via Wasserstein Gradient Flows

RW-Flow presents a new one‑step generative framework for data on compact manifolds, leveraging Wasserstein gradient flows. The authors derive a necessary and sufficient identifiability condition for velocity fields on compact, connected Riemannian manifolds, showing that a symmetric, Lipschitz‑continuous cost function yields identifiability iff its Gibbs kernel is nondegenerate. Experiments on geospatial events, protein and RNA torsion angles, and discretized manifolds demonstrate that RW‑Flow surpasses existing one‑step methods across most benchmark settings.

By Ualibyek Nurgulan, Seungwoo Yoo, Prin Phunyaphibarn, Minhyuk Sung