A Riemannian Approach to Ground Metric Learning for Optimal Transport

Pratik Jawanpuria, Dai Shi, Bamdev Mishra, Junbin Gao
9/16/2024
cs.LGcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Optimal transport (OT) theory has attracted much attention in machine learning and signal processing applications. OT defines a notion of distance between probability distributions of source and target data points. A crucial factor that influences OT-based distances is the ground metric of the embedding space in which the source and target data points lie. In this work, we propose to learn a suitable latent ground metric parameterized by a symmetric positive definite matrix. We use the rich Riemannian geometry of symmetric positive definite matrices to jointly learn the OT distance along with the ground metric. Empirical results illustrate the efficacy of the learned metric in OT-based domain adaptation.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{jawanpuria2024riemannian,
  title  = {A Riemannian Approach to Ground Metric Learning for Optimal Transport},
  author = {Pratik Jawanpuria and Dai Shi and Bamdev Mishra and Junbin Gao},
  year   = {2024},
  eprint = {2409.10085},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.10085v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.10085.svg)](https://codeofpaper.com/paper/2409.10085)

Discussion