Related papers: Asymptotics for semi-discrete entropic optimal tra…
We give sufficient conditions on initial and target measures supported on the sphere $\S^n$ to ensure the solution to the optimal transport problem with the cost $|x-y|^2/2$ is a diffeomorphism.
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…
Entropic optimal transport (OT) and the Sinkhorn algorithm have made it practical for machine learning practitioners to perform the fundamental task of calculating transport distance between statistical distributions. In this work, we focus…
In this paper the asymptotic distributions are exactly solved for linearly independent solutions considering problems of the second order and for the coefficients of asymptotic destribution the recurent formulas are obtained. Further, using…
We consider the classical Merton problem of lifetime consumption-portfolio optimization problem with small proportional transaction costs. The first order term in the asymptotic expansion is explicitly calculated through a singular ergodic…
Consider a branching random walk evolving in a macroscopic time-inhomogeneous environment, that scales with the length $n$ of the process under study. We compute the first two terms of the asymptotic of the maximal displacement at time $n$.…
We reconsider the problem of optimal trading in the presence of linear and quadratic costs, for arbitrary linear costs but in the limit where quadratic costs are small. Using matched asymptotic expansion techniques, we find that the trading…
Optimal transport has emerged as a fundamental methodology with applications spanning multiple research areas in recent years. However, the convergence rate of the empirical estimator to its population counterpart suffers from the curse of…
We study stability of optimizers and convergence of Sinkhorn's algorithm for the entropic optimal transport problem. In the special case of the quadratic cost, our stability bounds imply that if one of the two entropic potentials is…
Recent results in the literature have provided connections between the so-called turnpike property, near optimality of closed-loop solutions, and strict dissipativity. Motivated by applications in economics, optimal control problems with…
We study the convergence rate of Sinkhorn's algorithm for solving entropy-regularized optimal transport problems when at least one of the probability measures, $\mu$, admits a density over $\mathbb{R}^d$. For a semi-concave cost function…
This paper studies the joint data and semantics lossy compression problem, i.e., an extension of the hidden lossy source coding problem that entails recovering both the hidden and observable sources. We aim to study the nonasymptotic and…
Traditional solvable optimal control theory predominantly focuses on quadratic costs due to their analytical tractability, yet they often fail to capture critical non-linearities inherent in real-world systems including water, energy,…
We consider an extension of the Monge-Kantorovitch optimal transportation problem. The mass is transported along a continuous semimartingale, and the cost of transportation depends on the drift and the diffusion coefficients of the…
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently gained popularity in machine learning and statistics, as it makes feasible the use of smoothed optimal transportation distances for data…
This paper investigates the asymptotic behaviour of solutions to certain infinite systems of coupled recurrence relations. In particular, we obtain a characterisation of those initial values which lead to a convergent solution, and for…
A semilinear reaction-diffusion two-point boundary value problem, whose second-order derivative is multiplied by a small positive parameter $\eps^2$, is considered. It can have multiple solutions. An asymptotic expansion is constructed for…
In the current book I suggest an off-road path to the subject of optimal transport. I tried to avoid prior knowledge of analysis, PDE theory and functional analysis, as much as possible. Thus I concentrate on discrete and semi-discrete…
In this paper we study the class of optimal entropy-transport problems introduced by Liero, Mielke and Savar\'e in Inventiones Mathematicae 211 in 2018. This class of unbalanced transport metrics allows for transport between measures of…
Efficient computation of the optimal transport distance between two distributions serves as an algorithm subroutine that empowers various applications. This paper develops a scalable first-order optimization-based method that computes…