Stability and Sample Complexity of Divergence Regularized Optimal Transport

[author] Pal, SoumikS. (2019). On the difference between entropic cost and the optimal transport cost. arXiv:1905.12206

Original

1905

Earlier work this paper cites.

[author] Léonard, ChristianC. (2012). From the Schrödinger problem to the Monge-Kantorovich problem. J. Funct. Anal. 262 1879–1920

1920

Earlier work this paper cites.

[author] Lorenz, Dirk A.D. A., Manns, PaulP. and Meyer, ChristianC. (2021). Quadratically regularized optimal transport. Appl. Math. Optim. 83 1919–1949

1949

Earlier work this paper cites.

[author] Sinkhorn, RichardR. and Knopp, PaulP. (1967). Concerning nonnegative matrices and doubly stochastic matrices. Pacific J. Math. 21 343–348

1967

Earlier work this paper cites.

[author] Dudley, R. M.R. M. (1968). The speed of mean Glivenko-Cantelli convergence. Ann. Math. Statist. 40 40–50

1968

Earlier work this paper cites.

[author] Csiszár, I.I. (1975). I I -divergence geometry of probability distributions and minimization problems. Ann. Probab. 3 146–158

1975

Earlier work this paper cites.

[author] Rudin, WalterW. (1976). Principles of Mathematical Analysis, third ed. International Series in Pure and Applied Mathematics. McGraw-Hill Book Co., New York-Auckland-Düsseldorf

1976

Earlier work this paper cites.

[author] Franklin, JoelJ. and Lorenz, JensJ. (1989). On the scaling of multidimensional matrices. Linear Algebra Appl. 114/115 717–735

1989

Earlier work this paper cites.

[author] Cominetti, R.R. and San Martín, J.J. (1994). Asymptotic analysis of the exponential penalty trajectory in linear programming. Math. Program. 67 169–187

1994

Earlier work this paper cites.

[author] Müller, AlfredA. (1997). Integral probability metrics and their generating classes of functions. Adv. in Appl. Probab. 29 429–443

1997

Earlier work this paper cites.

[author] Folland, Gerald BG. B. (1999). Real Analysis: Modern Techniques and Their Applications 40. John Wiley & Sons

1999

Earlier work this paper cites.

[author] Graf, SiegfriedS. and Luschgy, HaraldH. (2000). Foundations of Quantization for Probability Distributions. Lecture Notes in Mathematics 1730. Springer-Verlag, Berlin

2000

Earlier work this paper cites.

[author] Bolley, FrançoisF. and Villani, CédricC. (2005). Weighted Csiszár-Kullback-Pinsker inequalities and applications to transportation inequalities. Ann. Fac. Sci. Toulouse Math. (6) 14 331–352

2005

Earlier work this paper cites.

[author] Folland, Gerald BG. B. (2005). Higher-order derivatives and Taylor’s formula in several variables. Preprint 1–4

2005

Earlier work this paper cites.

[author] Di Marino, SimoneS. and Gerolin, AugustoA. (2020). Optimal transport losses and Sinkhorn algorithm with general convex regularization. arXiv:2007.00976

Original

2007

Earlier work this paper cites.

[author] Rockafellar, R TyrrellR. T. and Wets, Roger J-BR. J.-B. (2009). Variational Analysis 317. Springer Science & Business Media

2009

Earlier work this paper cites.

[author] McCann, Robert J.R. J., Pass, BrendanB. and Warren, MicahM. (2012). Rectifiability of optimal transportation plans. Canad. J. Math. 64 924–934

2012

Earlier work this paper cites.

[author] Sriperumbudur, Bharath K.B. K., Fukumizu, KenjiK., Gretton, ArthurA., Schölkopf, BernhardB. and Lanckriet, Gert R. G.G. R. G. (2012). On the empirical estimation of integral probability metrics. Electron. J. Stat. 6 1550–1599

2012

Earlier work this paper cites.

[author] Cuturi, MarcoM. (2013). Sinkhorn distances: Lightspeed computation of optimal transport. Advances in neural information processing systems 26

2013

Earlier work this paper cites.

[author] Fournier, NicolasN. and Guillin, ArnaudA. (2015). On the rate of convergence in Wasserstein distance of the empirical measure. Probab. Theory Related Fields 162 707–738

2015

Cited alongside, same era.

[author] Carlier, GuillaumeG., Duval, VincentV., Peyré, GabrielG. and Schmitzer, BernhardB. (2017). Convergence of entropic schemes for optimal transport and gradient flows. SIAM J. Math. Anal. 49 1385–1418

2017

Cited alongside, same era.

[author] Seguy, VivienV., Damodaran, Bharath BhushanB. B., Flamary, RémiR., Courty, NicolasN., Rolet, AntoineA. and Blondel, MathieuM. (2017). Large-scale optimal transport and mapping estimation. arXiv:1711.02283

Original

2017

Cited alongside, same era.

[author] Blanchet, JoseJ., Jambulapati, ArunA., Kent, CarsonC. and Sidford, AaronA. (2018). Towards optimal running times for optimal transport. arXiv:1810.07717

Original

2018

Cited alongside, same era.

[author] Deligiannidis, GeorgeG., De Bortoli, ValentinV. and Doucet, ArnaudA. (2021). Quantitative uniform stability of the iterative proportional fitting procedure. arXiv:2108.08129

Original

2021

Later among the works it cites.

[author] Eckstein, StephanS. and Kupper, MichaelM. (2021). Computation of optimal transport and related hedging problems via penalization and neural networks. Appl. Math. Optim. 83 639–667

2021

Later among the works it cites.

[author] Gigli, NicolaN. and Tamanini, LucaL. (2021). Second order differentiation formula on RCD* ( K , N ) (K,N) spaces. J. Eur. Math. Soc. (JEMS) 23 1727–1795

2021

Later among the works it cites.

[author] Manole, TudorT. and Niles-Weed, JonathanJ. (2021). Sharp convergence rates for empirical optimal transport with smooth costs. arXiv:2106.13181

Original

2021

Later among the works it cites.