Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures
概率测度间熵正则最优传输随机算法的渐近分布与收敛速率
This paper is devoted to the stochastic approximation of entropically regularized Wasserstein distances between two probability measures, also known as Sinkhorn divergences. The semi-dual formulation of such regularized optimal transportation problems can be rewritten as a nonstrongly concave optimisation problem. It allows to implement a Robbins–Monro stochastic algorithm to estimate the Sinkhorn divergence using a sequence of data sampled from one of the two distributions.…