Hyperbolic Optimal Transport

• URL: http://arxiv.org/abs/2511.00244v1
• Date: Fri, 31 Oct 2025 20:34:09 GMT
• Title: Hyperbolic Optimal Transport
• Authors: Yan Bin Ng, Xianfeng Gu,
• Abstract summary: The optimal transport problem aims to find the most efficient mapping between two probability distributions under a given cost function.<n>Existing methods for computing optimal transport maps are primarily developed for Euclidean spaces and the sphere.<n>We propose a novel and efficient algorithm for computing the optimal transport map in hyperbolic space using a geometric variational technique.
• Score: 4.318555434063273
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The optimal transport (OT) problem aims to find the most efficient mapping between two probability distributions under a given cost function, and has diverse applications in many fields such as machine learning, computer vision and computer graphics. However, existing methods for computing optimal transport maps are primarily developed for Euclidean spaces and the sphere. In this paper, we explore the problem of computing the optimal transport map in hyperbolic space, which naturally arises in contexts involving hierarchical data, networks, and multi-genus Riemann surfaces. We propose a novel and efficient algorithm for computing the optimal transport map in hyperbolic space using a geometric variational technique by extending methods for Euclidean and spherical geometry to the hyperbolic setting. We also perform experiments on synthetic data and multi-genus surface models to validate the efficacy of the proposed method.

Related papers

• Geometric Operator Learning with Optimal Transport [77.16909146519227]
  We propose integrating optimal transport (OT) into operator learning for partial differential equations (PDEs) on complex geometries.<n>For 3D simulations focused on surfaces, our OT-based neural operator embeds the surface geometry into a 2D parameterized latent space.<n> Experiments with Reynolds-averaged Navier-Stokes equations (RANS) on the ShapeNet-Car and DrivAerNet-Car datasets show that our method achieves better accuracy and also reduces computational expenses.
  arXiv  Detail & Related papers  (2025-07-26T21:28:25Z)
• Follow the Energy, Find the Path: Riemannian Metrics from Energy-Based Models [63.331590876872944]
  We propose a method for deriving Riemannian metrics directly from pretrained Energy-Based Models.<n>These metrics define spatially varying distances, enabling the computation of geodesics.<n>We show that EBM-derived metrics consistently outperform established baselines.
  arXiv  Detail & Related papers  (2025-05-23T12:18:08Z)
• Minimax Rates of Estimation for Optimal Transport Map between Infinite-Dimensional Spaces [6.9060054915724]
  We investigate the estimation of an optimal transport map between probability measures on an infinite-dimensional space and reveal its minimax optimal rate.<n>Estimating the optimal transport map from samples finds several applications, such as simulating dynamics between probability measures and functional data analysis.
  arXiv  Detail & Related papers  (2025-05-19T13:00:29Z)
• Linear Spherical Sliced Optimal Transport: A Fast Metric for Comparing Spherical Data [11.432994366694862]
  linear optimal transport has been proposed to embed distributions into ( L2 ) spaces, where the ( L2 ) distance approximates the optimal transport distance. We introduce the Linear Spherical Sliced Optimal Transport framework, which embeds spherical distributions into ( L2 ) spaces while preserving their intrinsic geometry. We demonstrate its superior computational efficiency in applications such as cortical surface registration, 3D point cloud via flow gradient, and shape embedding.
  arXiv  Detail & Related papers  (2024-11-09T03:36:59Z)
• Optimal Transportation by Orthogonal Coupling Dynamics [0.0]
  We propose a novel framework to address the Monge-Kantorovich problem based on a projection type gradient descent scheme. The micro-dynamics is built on the notion of the conditional expectation, where the connection with the opinion dynamics is explored. We demonstrate that the devised dynamics recovers random maps with favourable computational performance.
  arXiv  Detail & Related papers  (2024-10-10T15:53:48Z)
• Dynamical Measure Transport and Neural PDE Solvers for Sampling [77.38204731939273]
  We tackle the task of sampling from a probability density as transporting a tractable density function to the target. We employ physics-informed neural networks (PINNs) to approximate the respective partial differential equations (PDEs) solutions. PINNs allow for simulation- and discretization-free optimization and can be trained very efficiently.
  arXiv  Detail & Related papers  (2024-07-10T17:39:50Z)
• A Computational Framework for Solving Wasserstein Lagrangian Flows [48.87656245464521]
  In general, the optimal density path is unknown, and solving these variational problems can be computationally challenging. We propose a novel deep learning based framework approaching all of these problems from a unified perspective. We showcase the versatility of the proposed framework by outperforming previous approaches for the single-cell trajectory inference.
  arXiv  Detail & Related papers  (2023-10-16T17:59:54Z)
• Generative modeling of time-dependent densities via optimal transport and projection pursuit [3.069335774032178]
  We propose a cheap alternative to popular deep learning algorithms for temporal modeling. Our method is highly competitive compared with state-of-the-art solvers.
  arXiv  Detail & Related papers  (2023-04-19T13:50:13Z)
• Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problem [68.07116119373565]
  The Gromov-Wasserstein Optimal Transport (GWOT) problem has attracted the special attention of the ML community.<n>We crash-test existing continuous GWOT approaches on different scenarios, carefully record and analyze the obtained results, and identify issues.<n>We propose a new continuous GWOT method which does not rely on discrete techniques and partially solves some of the problems of the competitors.
  arXiv  Detail & Related papers  (2023-03-10T15:21:12Z)
• InfoOT: Information Maximizing Optimal Transport [58.72713603244467]
  InfoOT is an information-theoretic extension of optimal transport. It maximizes the mutual information between domains while minimizing geometric distances. This formulation yields a new projection method that is robust to outliers and generalizes to unseen samples.
  arXiv  Detail & Related papers  (2022-10-06T18:55:41Z)
• Near-optimal estimation of smooth transport maps with kernel sums-of-squares [81.02564078640275]
  Under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. The object of interest for applications such as generative modeling is the underlying optimal transport map. We propose the first tractable algorithm for which the statistical $L2$ error on the maps nearly matches the existing minimax lower-bounds for smooth map estimation.
  arXiv  Detail & Related papers  (2021-12-03T13:45:36Z)
• Functional optimal transport: map estimation and domain adaptation for functional data [35.60475201744369]
  We introduce a formulation of optimal transport problem for distributions on function spaces. For numerous machine learning tasks, data can be naturally viewed as samples drawn from spaces of functions. We develop an efficient algorithm for finding the transport map between functional domains.
  arXiv  Detail & Related papers  (2021-02-07T19:29:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.