Entropic selection for optimal transport on the line with distance cost

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Ley, Armand
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866914181721096192
author Ley, Armand
author_facet Ley, Armand
contents We study the small-regularisation limit of the entropic optimal transport problem on the line with distance cost. While convergence of entropic minimizers is well understood in the discrete setting and in the case where the cost is continuous and there is a unique optimal transport plan, the question of existence and characterization outside these settings remains largely open. We propose a natural candidate for the limiting object and establish its convergence under mutual singularity of the marginals. For arbitrary marginals, we moreover prove that every limit point of entropic minimizers obeys a structural condition known as weak multiplicativity. The construction of our candidate relies on a decomposition theorem for optimal transport plan that we believe is of independent interest. This article complements the previous work of Di Marino and Louet.
format Preprint
id arxiv_https___arxiv_org_abs_2512_05282
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Entropic selection for optimal transport on the line with distance cost
Ley, Armand
Optimization and Control
49Q22, 49J45, 60E15
We study the small-regularisation limit of the entropic optimal transport problem on the line with distance cost. While convergence of entropic minimizers is well understood in the discrete setting and in the case where the cost is continuous and there is a unique optimal transport plan, the question of existence and characterization outside these settings remains largely open. We propose a natural candidate for the limiting object and establish its convergence under mutual singularity of the marginals. For arbitrary marginals, we moreover prove that every limit point of entropic minimizers obeys a structural condition known as weak multiplicativity. The construction of our candidate relies on a decomposition theorem for optimal transport plan that we believe is of independent interest. This article complements the previous work of Di Marino and Louet.
title Entropic selection for optimal transport on the line with distance cost
topic Optimization and Control
49Q22, 49J45, 60E15
url https://arxiv.org/abs/2512.05282