# Algorithms for Euclidean-regularised Optimal Transport

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

## Key facts

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

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

- [Decentralized and Equitable Optimal Transport](https://mlsanity.com/paper/2403.04259/) (2024)

## Abstract (arXiv)

This paper addresses the Optimal Transport problem, which is regularized by the square of Euclidean ℓ2-norm. It offers theoretical guarantees regarding the iteration complexities of the Sinkhorn--Knopp algorithm, Accelerated Gradient Descent, Accelerated Alternating Minimisation, and Coordinate Linear Variance Reduction algorithms. Furthermore, the paper compares the practical efficiency of these methods and their counterparts when applied to the entropy-regularized Optimal Transport problem. This comparison is conducted through numerical experiments carried out on the MNIST dataset.