Fetching the paper…
Reading the bibliography…
We propose a new method to estimate Wasserstein distances and optimal transport plans between two probability distributions from samples in high dimension.
The one-sided barrier problem for Gaussian noise
D. Slepian · 1962
Earlier work this paper cites.
The speed of mean Glivenko-Cantelli convergence
R. M. Dudley · 1969
Earlier work this paper cites.
Gaussian random processes, and measures of solid angles in Hilbert space
V. N. Sudakov · 1971
Earlier work this paper cites.
The uniform convergence of frequencies of the appearance of events to their probabilities
V. N. Vapnik and A. J. Červonenkis · 1971
Earlier work this paper cites.
Regularité des trajectoires des fonctions aléatoires gaussiennes
X. Fernique · 1975
Earlier work this paper cites.
Central limit theorems for empirical measures
R. M. Dudley · 1978
Earlier work this paper cites.
Least squares quantization in PCM
S. P. Lloyd · 1982
Earlier work this paper cites.
Quantization and the method of k-means
D. Pollard · 1982
Earlier work this paper cites.
Learnability and the Vapnik-Chervonenkis dimension
A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth · 1989
Earlier work this paper cites.
On the method of bounded differences
C. McDiarmid · 1989
Earlier work this paper cites.
Expressing combinatorial optimization problems by linear programs
M. Yannakakis · 1991
Earlier work this paper cites.
Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
J. E. Cohen and U. G. Rothblum · 1993
Earlier work this paper cites.
Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values
P. Paatero and U. Tapper · 1994
Earlier work this paper cites.
Asymptotics for transportation cost in high dimensions
V. Dobrić and J. E. Yukich · 1995
Earlier work this paper cites.
A probabilistic theory of pattern recognition , volume 31 of Applications of Mathematics (New York)
L. Devroye, L. Györfi, and G. Lugosi · 1996
Earlier work this paper cites.
Integral probability metrics and their generating classes of functions
A. Müller · 1997
Earlier work this paper cites.
Foundations of quantization for probability distributions , volume 1730 of Lecture Notes in Mathematics
S. Graf and H. Luschgy · 2000
Earlier work this paper cites.
A note on constrained k-means algorithms
M. K. Ng · 2000
Earlier work this paper cites.
Spatial tessellations: concepts and applications of Voronoi diagrams
A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu · 2000
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.
Algorithms for non-negative matrix factorization
D. D. Lee and H. S. Seung · 2001
Earlier work this paper cites.
Topics in Optimal Transportation
C. Villani · 2003
Earlier work this paper cites.
Document clustering using nonnegative matrix factorization
F. Shahnaz, M. W. Berry, V. P. Pauca, and R. J. Plemmons · 2004
Earlier work this paper cites.
Improving molecular cancer class discovery through sparse non-negative matrix factorization
Y. Gao and G. Church · 2005
Earlier work this paper cites.
Non-negative tensor factorization with applications to statistics and computer vision
A. Shashua and T. Hazan · 2005
Earlier work this paper cites.
On minimum Kantorovich distance estimators
F. Bassetti, A. Bodini, and E. Regazzini · 2006
Earlier work this paper cites.
Stability of $k$-means clustering
A. Rakhlin and A. Caponnetto · 2006
Earlier work this paper cites.
Matrix completion with noise
E. J. Candès and Y. Plan · 2009
Cited alongside, same era.
Optimal transport , volume 338 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]
C. Villani · 2009
Cited alongside, same era.
Robust subspace segmentation by low-rank representation
G. Liu, Z. Lin, and Y. Yu · 2010
Cited alongside, same era.
K K -dimensional coding schemes in Hilbert spaces
A. Maurer and M. Pontil · 2010
Cited alongside, same era.
Barycenters in the Wasserstein space
M. Agueh and G. Carlier · 2011
Cited alongside, same era.
Displacement interpolation using Lagrangian mass transport
N. Bonneel, M. Van De Panne, S. Paris, and W. Heidrich · 2011
Cited alongside, same era.
Convex color image segmentation with optimal transport distances
J. Rabin and N. Papadakis · 2015
Later among the works it cites.
Optimal transport for applied mathematicians , volume 87 of Progress in Nonlinear Differential Equations and their Applications
F. Santambrogio · 2015
Later among the works it cites.
Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains
J. Solomon, F. de Goes, G. Peyré, M. Cuturi, A. Butscher, A. Nguyen, T. Du, and L. Guibas · 2015
Later among the works it cites.
WASP: Scalable Bayes via barycenters of subset posteriors
S. Srivastava, V. Cevher, Q. Dinh, and D. Dunson · 2015
Later among the works it cites.
Wasserstein barycentric coordinates: Histogram regression using optimal transport
N. Bonneel, G. Peyré, and M. Cuturi · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An optimal transport approach to robust reconstruction and simplification of 2d shapes
F. de Goes, D. Cohen-Steiner, P. Alliez, and M. Desbrun · 2011
Cited alongside, same era.
Domain adaptation via transfer component analysis
S. J. Pan, I. W. Tsang, J. T. Kwok, and Q. Yang · 2011
Cited alongside, same era.
Computing a nonnegative matrix factorization – provably
S. Arora, R. Ge, R. Kannan, and A. Moitra · 2012
Cited alongside, same era.
Learning probability measures with respect to optimal transport metrics
G. Canas and L. Rosasco · 2012
Cited alongside, same era.
Blue noise through optimal transport
F. de Goes, K. Breeden, V. Ostromoukhov, and M. Desbrun · 2012
Cited alongside, same era.
Geodesic flow kernel for unsupervised domain adaptation
B. Gong, Y. Shi, F. Sha, and K. Grauman · 2012
Cited alongside, same era.
L. Chizat, G. Peyré, B. Schmitzer, and F.-X. Vialard · 2016
Later among the works it cites.
A smoothed dual approach for variational Wasserstein problems
M. Cuturi and G. Peyré · 2016
Later among the works it cites.
Distributionally robust stochastic optimization with Wasserstein distance
R. Gao and A. J. Kleywegt · 2016
Later among the works it cites.
Stochastic optimization for large-scale optimal transport
A. Genevay, M. Cuturi, G. Peyré, and F. Bach · 2016
Later among the works it cites.
Mathematical foundations of infinite-dimensional statistical models
E. Giné and R. Nickl · 2016
Later among the works it cites.
A single-cell resolution map of mouse hematopoietic stem and progenitor cell differentiation
S. Nestorowa, F. K. Hamey, B. P. Sala, E. Diamanti, M. Shepherd, E. Laurenti, N. K. Wilson, D. G. Kent, and B. Göttgens · 2016
Later among the works it cites.
Fast dictionary learning with a smoothed Wasserstein loss
A. Rolet, M. Cuturi, and G. Peyré · 2016
Later among the works it cites.
Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
B. Schmitzer · 2016
Later among the works it cites.
High-dimensional probability
R. Vershynin · 2016
Later among the works it cites.
Revealing the vectors of cellular identity with single-cell genomics
A. Wagner, A. Regev, and N. Yosef · 2016
Later among the works it cites.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
J. Altschuler, J. Weed, and P. Rigollet · 2017
Later among the works it cites.
Optimal transport for domain adaptation
N. Courty, R. Flamary, D. Tuia, and A. Rakotomamonjy · 2017
Later among the works it cites.
Sinkhorn-autodiff: Tractable Wasserstein learning of generative models
A. Genevay, G. Peyré, and M. Cuturi · 2017
Later among the works it cites.
Correcting batch effects in single-cell rna sequencing data by matching mutual nearest neighbours
L. Haghverdi, A. T. Lun, M. D. Morgan, and J. C. Marioni · 2017
Later among the works it cites.
Reconstruction of developmental landscapes by optimal-transport analysis of single-cell gene expression sheds light on cellular reprogramming
G. Schiebinger, J. Shu, M. Tabaka, B. Cleary, V. Subramanian, A. Solomon, S. Liu, S. Lin, P. Berube, L. Lee, J. Chen, J. Brumbaugh, P. Rigollet, K. Hochedlinger, R. Jaenisch, A. Regev, and E. Lander · 2017
Later among the works it cites.
Inference for empirical wasserstein distances on finite spaces
M. Sommerfeld and A. Munk · 2017
Later among the works it cites.
Parallel streaming Wasserstein barycenters
M. Staib, S. Claici, J. M. Solomon, and S. Jegelka · 2017
Later among the works it cites.
J. Weed and F. Bach · 2017
Later among the works it cites.
Integrating single-cell transcriptomic data across different conditions, technologies, and species
A. Butler, P. Hoffman, P. Smibert, E. Papalexi, and R. Satija · 2018
Closest in time.
Stochastic Wasserstein barycenters
S. Claici, E. Chien, and J. Solomon · 2018
Closest in time.
Characterizing the replicability of cell types defined by single cell rna-sequencing data using metaneighbor
M. Crow, A. Paul, S. Ballouz, Z. J. Huang, and J. Gillis · 2018
Closest in time.
Batch effects in single-cell rna-sequencing data are corrected by matching mutual nearest neighbors
L. Haghverdi, A. T. Lun, M. D. Morgan, and J. C. Marioni · 2018
Closest in time.