# Error estimate for regularized optimal transport problems via Bregman divergence

arXiv: https://arxiv.org/abs/2309.11666 · HTML: https://mlsanity.com/paper/2309.11666/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Sep 2023.

## Built on by (most cited first, 1 of 1)

- [Sinkhorn Algorithm for Sequentially Composed Optimal Transports](https://mlsanity.com/paper/2412.03120/) (2024)

## Abstract (arXiv)

Regularization by the Shannon entropy enables us to efficiently and approximately solve optimal transport problems on a finite set. This paper is concerned with regularized optimal transport problems via Bregman divergence. We introduce the required properties for Bregman divergences, provide a non-asymptotic error estimate for the regularized problem, and show that the error estimate becomes faster than exponentially.