paper-with-me

Papers

A Riemannian Approach to Low-Rank Optimal Transport

2026-06-10 · Pratik Jawanpuria, Bamdev Mishra arxiv

Low-rank optimal transport (OT) mitigates the quadratic scaling of classical solvers, yet existing approaches rely heavily on first-order mirror-descent updates that require careful hyperparameter tuning and ignore the optimization landscape's curvature. To address these limitations, we propose a unified Riemannian geometric framework for low-rank OT, modeling balanced and unbalanced rank-$r$ positive factored couplings as novel smooth embedded submanifolds of the positive orthant. By equipping these manifolds with the Fisher-Rao product metric, we derive tractable formulations for Riemannian projectors, retractions, and Hessian-vector products. Our cost-agnostic framework seamlessly extends to linear OT, Gromov-Wasserstein (GW), fused GW, and their unbalanced counterparts. For balanced OT, our geometric ingredients are computed via efficient conjugate-gradient and iterative Bregman updates. For the unbalanced OT, our operations elegantly reduce to closed-form scalings, completely eliminating inner iterative loops. In both regimes, per-iteration complexity scales linearly with dataset size, and we provide a rank-sufficiency certificate for global optimality verification. Extensive experiments across a range of problem sizes demonstrate that our regularization-free first- and second-order solvers achieve faster convergence and superior performance over existing state-of-the-art low-rank OT solvers.

📄 PDF Abstract BibTeX arXiv:2606.12120

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Riemannian block SPD coupling manifold and its application to optimal transport

2022-01-30 · Andi Han, Bamdev Mishra, Pratik Jawanpuria, Junbin Gao

In this work, we study the optimal transport (OT) problem between symmetric positive definite (SPD) matrix-valued measures. We formulate the above as a generalized optimal transport problem where the cost, the marginals,…

Riemannian optimization

Coupling Matrix Manifolds and Their Applications in Optimal Transport

2019-11-15 · Dai Shi, Junbin Gao, Xia Hong, S. T. Boris Choy 외

Optimal transport (OT) is a powerful tool for measuring the distance between two defined probability distributions. In this paper, we develop a new manifold named the coupling matrix manifold (CMM), where each point on C…

Riemannian optimization

Zeroth-order Riemannian Averaging Stochastic Approximation Algorithms

2023-09-25 · Jiaxiang Li, Krishnakumar Balasubramanian, Shiqian Ma

We present Zeroth-order Riemannian Averaging Stochastic Approximation (\texttt{Zo-RASA}) algorithms for stochastic optimization on Riemannian manifolds. We show that \texttt{Zo-RASA} achieves optimal sample complexities …

Stochastic Optimization

Contour Manifolds and Optimal Transport

2013-09-09 · Bernhard Schmitzer, Christoph Schnörr

Describing shapes by suitable measures in object segmentation, as proposed in [24], allows to combine the advantages of the representations as parametrized contours and indicator functions. The pseudo-Riemannian structur…

SegmentationSemantic Segmentation

Riemannian Neural Optimal Transport

2026-02-03 · Alessandro Micheli, Yueqi Cao, Anthea Monod, Samir Bhatt arxiv

Computational optimal transport (OT) offers a principled framework for generative modeling. Neural OT methods, which use neural networks to learn an OT map (or potential) from data in an amortized way, can be evaluated o…