We study the entropic regularization of the optimal transport problem in dimension 1 when the cost function is the distance c(x, y) = |y-x|. The selected plan at the limit is, among those which are optimal for the nonpenalized problem, the most diffuse one on the zones where it may have a density
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces in...
We propose a new concept for the regularization and discretization of transfer operators in dynamica...
This thesis deals with the optimal transport problem, in particular with regularity properties share...
We study the entropic regularization of the optimal transport problem in dimension 1 when the cost f...
International audienceWe study the entropic regularization of the optimal transport problem in dimen...
We analyze optimal transport problems with additional entropic cost evaluated along curves in the Wa...
In graph analysis, a classic task consists in computing similarity measures between (groups of) node...
Entropic regularization of optimal transport is appealing both from a numerical and theoretical pers...
We analyze optimal transport problems with additional entropic cost evaluated along curves in the Wa...
International audienceAlthough optimal transport (OT) problems admit closed form solutions in a very...
48 pages, 4 figuresWe study the existing algorithms that solve the multidimensional martingale optim...
This paper presents a unified framework for smooth convex regularization of discrete optimal transpo...
In this paper we study the dimension of some measures which are related to the classical Monge's opt...
We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and...
We investigate the approximation of the Monge problem (minimizing Ω |T (x) − x|dµ(x) among the vecto...
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces in...
We propose a new concept for the regularization and discretization of transfer operators in dynamica...
This thesis deals with the optimal transport problem, in particular with regularity properties share...
We study the entropic regularization of the optimal transport problem in dimension 1 when the cost f...
International audienceWe study the entropic regularization of the optimal transport problem in dimen...
We analyze optimal transport problems with additional entropic cost evaluated along curves in the Wa...
In graph analysis, a classic task consists in computing similarity measures between (groups of) node...
Entropic regularization of optimal transport is appealing both from a numerical and theoretical pers...
We analyze optimal transport problems with additional entropic cost evaluated along curves in the Wa...
International audienceAlthough optimal transport (OT) problems admit closed form solutions in a very...
48 pages, 4 figuresWe study the existing algorithms that solve the multidimensional martingale optim...
This paper presents a unified framework for smooth convex regularization of discrete optimal transpo...
In this paper we study the dimension of some measures which are related to the classical Monge's opt...
We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and...
We investigate the approximation of the Monge problem (minimizing Ω |T (x) − x|dµ(x) among the vecto...
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces in...
We propose a new concept for the regularization and discretization of transfer operators in dynamica...
This thesis deals with the optimal transport problem, in particular with regularity properties share...
DOI
Add to ORKG