Sinkhorn algorithms and linear programming solvers for optimal partial transport problems

Yikun Bai
7/9/2024
math.OCcs.LG

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

In this note, we generalize the classical optimal partial transport (OPT) problem by modifying the mass destruction/creation term to function-based terms, introducing what we term ``generalized optimal partial transport'' problems. We then discuss the dual formulation of these problems and the associated Sinkhorn solver. Finally, we explore how these new OPT problems relate to classical optimal transport (OT) problems and introduce a linear programming solver tailored for these generalized scenarios.

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. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

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

Cite this paper

@article{bai2024sinkhorn,
  title  = {Sinkhorn algorithms and linear programming solvers for optimal partial transport problems},
  author = {Yikun Bai},
  year   = {2024},
  eprint = {2407.06481},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.06481v1}
}

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/2407.06481.svg)](https://codeofpaper.com/paper/2407.06481)

Discussion