Sample Complexity of Sinkhorn divergences

On the transfer of masses (in Russian)

L. Kantorovich · 1942

Earlier work this paper cites.

Lebesgue spaces of differentiable functions

A. Calderón · 1961

Earlier work this paper cites.

The speed of mean glivenko-cantelli convergence

R. Dudley · 1969

Earlier work this paper cites.

Rademacher and gaussian complexities: Risk bounds and structural results

P. L. Bartlett and S. Mendelson · 2002

Earlier work this paper cites.

Approximate bayesian computation in population genetics

M. A. Beaumont, W. Zhang, and D. J. Balding · 2002

Earlier work this paper cites.

Gradient flows in metric spaces and in the space of probability measures

L. Ambrosio, N. Gigli, and G. Savaré · 2006

Earlier work this paper cites.

A kernel method for the two-sample-problem

A. Gretton, K. Borgwardt, M. Rasch, B. Schölkopf, and A. Smola · 2006

Earlier work this paper cites.

On the empirical estimation of integral probability metrics

B. Sriperumbudur, K. Fukumizu, A. Gretton, B. Schoelkopf, and G. Lanckriet · 2012

Earlier work this paper cites.

Sinkhorn distances: Lightspeed computation of optimal transport

M. Cuturi · 2013

Cited alongside, same era.

Domain adaptation with regularized optimal transport

N. Courty, R. Flamary, and D. Tuia · 2014

Cited alongside, same era.

Learning with a Wasserstein loss

C. Frogner, C. Zhang, H. Mobahi, M. Araya, and T. Poggio · 2015

Cited alongside, same era.

From word embeddings to document distances

M. Kusner, Y. Sun, N. Kolkin, and K. Q. Weinberger · 2015

Cited alongside, same era.

Generative moment matching networks

Y. Li, K. Swersky, and R. Zemel · 2015

Cited alongside, same era.

Entropic and displacement interpolation: a computational approach using the hilbert metric

Y. Chen, T. Georgiou, and M. Pavon · 2016

Cited alongside, same era.

Central limit theorems for sinkhorn divergence between probability distributions on finite spaces and statistical applications

Original

J. Bigot, E. Cazelles, and N. Papadakis · 2017

Later among the works it cites.

Convergence of entropic schemes for optimal transport and gradient flows

G. Carlier, V. Duval, G. Peyré, and B. Schmitzer · 2017

Later among the works it cites.

MMD GAN: Towards deeper understanding of moment matching network

Original

C.-L. Li, W.-C. Chang, Y. Cheng, Y. Yang, and B. Póczos · 2017

Later among the works it cites.

On wasserstein two-sample testing and related families of nonparametric tests

A. Ramdas, N. G. Trillos, and M. Cuturi · 2017

Later among the works it cites.

Sharp asymptotic and finite-sample rates of convergence of empirical measures in wasserstein distance

Original

J. Weed and F. Bach · 2017