Skip to content

Riemannian Neural Hamiltonian Flows: Geodesic Symplectic Transport and Interpretability

Sep 2026 · 0 citations · 44 references
Computer Science

TL;DR

Riemannian Neural Hamiltonian Flows are introduced, which combine the fixed kinetic energy of a Riemannian manifold, a learned scalar potential, and an explicit geodesic leapfrog integrator to explain how the learned Hamiltonian can be made interpretable.

Abstract

Hamiltonian normalizing flows are attractive generative models because their phase-space maps are invertible and volume preserving, but most neural constructions are formulated in Euclidean space. We introduce Riemannian Neural Hamiltonian Flows, which combine the fixed kinetic energy of a Riemannian manifold, a learned scalar potential, and an explicit geodesic leapfrog integrator. Our analysis explains how the learned Hamiltonian can be made interpretable. Every normalizable potential defines an implicit profile, and the position marginal initially accelerates along the relative score between that profile and the base. The matched potential is the interpretable specialization for which the implicit profile is the target. In the isotropic Gaussian case, the mechanism corresponds to a phase-space rotation. A local harmonic analysis extends this result around each mode of a general target on a manifold. The gap between the learned and the matched potential is the sum of a residual memory of the base and a bias of the model, and the two potentials agree when the position base has been transferred to the momentum. This can be achieved when the former is broader than the target. Numerical experiments on Euclidean, hyperbolic, and spherical spaces show competitive sample quality and numerical cost against a Riemannian continuous normalizing flow, and confirm the interpretability of the learned potential.

View source

Similar papers

Preprint Oct 2026

Curvature, Scaling, and Complexity in Riemannian Projection-Free Optimization

Projection-free methods replace projections by linear minimization oracles, making their convergence fundamentally sensitive to the geometry of the feasible region. We develop a geometric framework for this dependence in Riemannian Frank--Wolfe optimization. A power-type double-geodesic modulus quantifies the intrinsic...

B. T. Nguyen · 0 citations
#machine learning Preprint Oct 2026

Hamiltonian Metric Learning and Energy-Based Training: A Dissipative Geometric Framework for Optimization

Optimization in machine learning is usually expressed through iterative rules that update model parameters using information from the loss landscape. In this work, we study an alternative viewpoint in which parameter optimization is treated as the evolution of a dissipative dynamical system. The model parameters are re...

Sparsh Chakraborty, M. Alamgir, M. Nishanth et al. · 0 citations
#machine learning Preprint Oct 2026

Light Entropic Optimal Transport on Riemannian Manifolds

Entropic Optimal Transport (EOT) has become a practical framework for learning stochastic couplings between complex distributions, with applications in generative modeling and domain adaptation. However, most EOT solvers are designed for Euclidean spaces, while manifold extensions remain limited and often rely on costl...

Xavier Aramayo-Carrasco, Petr Mokrov, Alexander Korotin · 0 citations
Open access Sep 2026

Riemannian vs. Lorentzian Geometry: A Multilevel Comparison

We present a comparative exposition of Riemannian and Lorentzian geometries, organized through successive levels of increasing structure. Beginning with scalar products on vector spaces, we proceed through smooth manifolds, left-invariant metrics on Lie groups, homogeneous spaces and contact metric geometry. At each le...

Giovanni Calvaruso, Maria Letizia Russo · 0 citations
Preprint Oct 2026

Intrinsic Rigidity of Bar-and-Joint Frameworks on Riemannian Manifolds

We develop an intrinsic rigidity theory for bar-and-joint frameworks whose vertices are constrained to a Riemannian manifold and whose edges are given by minimizing geodesic arcs. Such frameworks are called rigid if they cannot be deformed beyond the ambient isometries, while preserving the geodesic edge lengths. For a...

Matthias Adrian-Himmelmann · 0 citations
Preprint Aug 2026

Centered Weak Discrete Riemannian Gradients: A Unified Framework for Riemannian Optimization

We introduce the centered weak discrete Riemannian gradient (c-wDRG) framework for the unified analysis of optimization methods on Riemannian manifolds. The framework uses a center point to represent the relevant logarithmic differences in a common tangent space and covers Riemannian steepest descent, proximal point, p...

De-Run Zhou, Mahito Sugiyama · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

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