Fetching the paper…
Reading the bibliography…
We study the stability of entropically regularized optimal transport with respect to the marginals.
I I -divergence geometry of probability distributions and minimization problems
I. Csiszár · 1975
Earlier work this paper cites.
Random fields and diffusion processes
H. Föllmer · 1988
Earlier work this paper cites.
On the scaling of multidimensional matrices
J. Franklin and J. Lorenz · 1989
Earlier work this paper cites.
Asymptotic analysis of the exponential penalty trajectory in linear programming
R. Cominetti and J. San Martín · 1994
Earlier work this paper cites.
Convergence of the iterative proportional fitting procedure
L. Rüschendorf · 1995
Earlier work this paper cites.
Real analysis
G. B. Folland · 1999
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Y. Rubner, C. Tomasi, and L. J. Guibas · 2000
Earlier work this paper cites.
Optimal control for absolutely continuous stochastic processes and the mass transportation problem
T. Mikami · 2002
Earlier work this paper cites.
Concentration inequalities and model selection
P. Massart · 2003
Earlier work this paper cites.
Monge’s problem with a quadratic cost by the zero-noise limit of h h -path processes
T. Mikami · 2004
Earlier work this paper cites.
Weighted Csiszár-Kullback-Pinsker inequalities and applications to transportation inequalities
F. Bolley and C. Villani · 2005
Earlier work this paper cites.
Optimal transport, old and new
C. Villani · 2009
Earlier work this paper cites.
Barycenters in the Wasserstein space
M. Agueh and G. Carlier · 2011
Earlier work this paper cites.
Stochastic Finance: An Introduction in Discrete Time
H. Föllmer and A. Schied · 2011
Earlier work this paper cites.
From the Schrödinger problem to the Monge-Kantorovich problem
C. Léonard · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
M. Cuturi · 2013
Earlier work this paper cites.
A survey of the Schrödinger problem and some of its connections with optimal transport
C. Léonard · 2014
Earlier work this paper cites.
Entropic and displacement interpolation: a computational approach using the Hilbert metric
Y. Chen, T. Georgiou, and M. Pavon · 2016
Cited alongside, same era.
On the relation between optimal transport and Schrödinger bridges: a stochastic control viewpoint
Y. Chen, T. T. Georgiou, and M. Pavon · 2016
Cited alongside, same era.
Stochastic optimization for large-scale optimal transport
A. Genevay, M. Cuturi, G. Peyré, and F. Bach · 2016
Cited alongside, same era.
Wasserstein generative adversarial networks
M. Arjovsky, S. Chintala, and L. Bottou · 2017
Cited alongside, same era.
Monge-Kantorovich depth, quantiles, ranks and signs
V. Chernozhukov, A. Galichon, M. Hallin, and M. Henry · 2017
Cited alongside, same era.
On Wasserstein two-sample testing and related families of nonparametric tests
A. Ramdas, N. García Trillos, and M. Cuturi · 2017
The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations
R. J. Berman · 2020
Later among the works it cites.
A differential approach to the multi-marginal Schrödinger system
G. Carlier and M. Laborde · 2020
Later among the works it cites.
An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm
S. Di Marino and A. Gerolin · 2020
Later among the works it cites.
Optimal transport losses and Sinkhorn algorithm with general convex regularization
S. Di Marino and A. Gerolin · 2020
Later among the works it cites.
A non-exponential extension of Sanov’s theorem via convex duality
D. Lacker · 2020
Later among the works it cites.
Entropic-Wasserstein barycenters: PDE characterization, regularity, and CLT
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Gromov-Wasserstein alignment of word embedding spaces
D. Alvarez-Melis and T. Jaakkola · 2018
Cited alongside, same era.
Towards optimal running times for optimal transport
J. Blanchet, A. Jambulapati, C. Kent, and A. Sidford · 2018
Cited alongside, same era.
Smooth and sparse optimal transport
M. Blondel, V. Seguy, and A. Rolet · 2018
Cited alongside, same era.
Quadratically regularized optimal transport on graphs
M. Essid and J. Solomon · 2018
Cited alongside, same era.
Learning generative models with Sinkhorn divergences
A. Genevay, G. Peyré, and M. Cuturi · 2018
Cited alongside, same era.
An explicit analysis of the entropic penalty in linear programming
J. Weed · 2018
Cited alongside, same era.
G. Carlier, K. Eichinger, and A. Kroshnin · 2021
Closest in time.
A formula for the time derivative of the entropic cost and applications
G. Conforti and L. Tamanini · 2021
Closest in time.
Differentiable particle filtering via entropy-regularized optimal transport
A. Corenflos, J. Thornton, G. Deligiannidis, and A. Doucet · 2021
Closest in time.
Quantitative uniform stability of the iterative proportional fitting procedure
G. Deligiannidis, V. De Bortoli, and A. Doucet · 2021
Closest in time.
Second order differentiation formula on RCD ∗ ( K , N ) {\mathrm{RCD}}^{*}(K,N) spaces
N. Gigli and L. Tamanini · 2021
Closest in time.
A gradient descent perspective on Sinkhorn
F. Léger · 2021
Closest in time.
Quadratically regularized optimal transport
D. A. Lorenz, P. Manns, and C. Meyer · 2021
Closest in time.
Introduction to Entropic Optimal Transport
M. Nutz · 2021
Closest in time.
Asymptotics for semidiscrete entropic optimal transport
J. M. Altschuler, J. Niles-Weed, and A. J. Stromme · 2022
Closest in time.
On the linear convergence of the multi-marginal Sinkhorn algorithm
G. Carlier · 2022
Closest in time.
Stability of Schrödinger potentials and convergence of Sinkhorn’s algorithm
M. Nutz and J. Wiesel · 2022
Closest in time.