Fetching the paper…
Reading the bibliography…
We prove several fundamental statistical bounds for entropic OT with the squared Euclidean cost between subgaussian probability measures in arbitrary dimension.
The speed of mean Glivenko-Cantelli convergence
Dudley, R. M. (1969) · 1969
Earlier work this paper cites.
Near-linear time approximation algorithms for optimal transport via sinkhorn iteration
Altschuler, J., Weed, J., and Rigollet, P. (2017) · 1971
Earlier work this paper cites.
I-divergence geometry of probability distributions and minimization problems
Csiszár, I. (1975) · 1975
Earlier work this paper cites.
The jackknife estimate of variance
Efron, B. and Stein, C. (1981) · 1981
Earlier work this paper cites.
Tensor methods in statistics
McCullagh, P. (1987) · 1987
Earlier work this paper cites.
A multivariate Faà di Bruno formula with applications
Constantine, G. M. and Savits, T. H. (1996) · 1996
Earlier work this paper cites.
Weak convergence and empirical processes
van der Vaart, A. W. and Wellner, J. A. (1996) · 1996
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Rubner, Y., Tomasi, C., and Guibas, L. J. (2000) · 2000
Earlier work this paper cites.
Optimal transport: old and new
Villani, C. (2008) · 2008
Earlier work this paper cites.
Nonnegative matrix factorization with earth mover’s distance metric for image analysis
Sandler, R. and Lindenbaum, M. (2011) · 2011
Earlier work this paper cites.
Concentration inequalities: A nonasymptotic theory of independence
Boucheron, S., Lugosi, G., and Massart, P. (2013) · 2013
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M. (2013) · 2013
Earlier work this paper cites.
A novel earth mover’s distance methodology for image matching with Gaussian mixture models
Li, P., Wang, Q., and Zhang, L. (2013) · 2013
Earlier work this paper cites.
Domain adaptation with regularized optimal transport
Courty, N., Flamary, R., and Tuia, D. (2014) · 2014
Cited alongside, same era.
Probability in high dimension
van Handel, R. (2014) · 2014
Cited alongside, same era.
Deep learning and the information bottleneck principle
Tishby, N. and Zaslavsky, N. (2015) · 2015
Cited alongside, same era.
Stochastic optimization for large-scale optimal transport
Genevay, A., Cuturi, M., Peyré, G., and Bach, F. (2016) · 2016
Cited alongside, same era.
Mathematical foundations of infinite-dimensional statistical models
Giné, E. and Nickl, R. (2016) · 2016
Cited alongside, same era.
Wasserstein training of restricted boltzmann machines
Montavon, G., Müller, K.-R., and Cuturi, M. (2016) · 2016
Cited alongside, same era.
Unsupervised alignment of embeddings with Wasserstein procrustes
Grave, E., Joulin, A., and Berthet, Q. (2018) · 2018
Later among the works it cites.
Empirical regularized optimal transport: Statistical theory and applications
Klatt, M., Tameling, C., and Munk, A. (2018) · 2018
Later among the works it cites.
Entropic optimal transport is maximum-likelihood deconvolution
Rigollet, P. and Weed, J. (2018) · 2018
Later among the works it cites.
Inference for empirical Wasserstein distances on finite spaces
Sommerfeld, M. and Munk, A. (2018) · 2018
Later among the works it cites.
High-dimensional probability: An introduction with applications in data science
Vershynin, R. (2018) · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Bigot, J., Cazelles, E., and Papadakis, N. (2017) · 2017
Cited alongside, same era.
Optimal transport for domain adaptation
Courty, N., Flamary, R., Tuia, D., and Rakotomamonjy, A. (2017) · 2017
Cited alongside, same era.
Learning generative models with sinkhorn divergences
Genevay, A., Peyré, G., and Cuturi, M. (2017) · 2017
Cited alongside, same era.
Optimal mass transport: Signal processing and machine-learning applications
Kolouri, S., Park, S. R., Thorpe, M., Slepcev, D., and Rohde, G. K. (2017) · 2017
Cited alongside, same era.
Gromov-Wasserstein alignment of word embedding spaces
Alvarez-Melis, D. and Jaakkola, T. S. (2018) · 2018
Cited alongside, same era.
Bercu, B. and Bigot, J. (2018) · 2018
Cited alongside, same era.
Sharper rates for estimating differential entropy under gaussian convolutions
Weed, J. (2018) · 2018
Later among the works it cites.
Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
Weed, J. and Bach, F. (2018) · 2018
Later among the works it cites.
Central limit theorems for empirical transportation cost in general dimension
Del Barrio, E. and Loubes, J. M. (2019) · 2019
Closest in time.
Interpolating between optimal transport and MMD using Sinkhorn divergences
Feydy, J., Séjourné, T., Vialard, F.-X., Amari, S.-I., Trouvé, A., and Peyré, G. (2019) · 2019
Closest in time.
Sample complexity of sinkhorn divergences
Genevay, A., Chizat, L., Bach, F., , Cuturi, M., and Peyré, G. (2019) · 2019
Closest in time.
Computational optimal transport
Peyré, G., Cuturi, M., et al. (2019) · 2019
Closest in time.
Reconstruction of developmental landscapes by optimal-transport analysis of single-cell gene expression sheds light on cellular reprogramming
Schiebinger, G., Shu, J., Tabaka, M., Cleary, B., Subramanian, V., Solomon, A., Liu, S., Lin, S., Berube, P., Lee, L., et al. (2019) · 2019
Closest in time.