Fetching the paper…
Reading the bibliography…
We present new algorithms to compute the mean of a set of empirical probability measures under the optimal transport metric.
On estimation of a probability density function and mode
E. Parzen · 1962
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
R. Sinkhorn · 1967
Earlier work this paper cites.
Least squares quantization in pcm
S. Lloyd · 1982
Earlier work this paper cites.
Quantization and the method of k-means
D. Pollard · 1982
Earlier work this paper cites.
On the scaling of multidimensional matrices
J. Franklin and J. Lorenz · 1989
Earlier work this paper cites.
Existence and uniqueness of monotone measure-preserving maps
R. J. McCann · 1995
Earlier work this paper cites.
Introduction to Linear Optimization
D. Bertsimas and J. Tsitsiklis · 1997
Earlier work this paper cites.
A convexity principle for interacting gases
R. J. McCann · 1997
Earlier work this paper cites.
The earth mover’s distance, multi-dimensional scaling, and color-based image retrieval
Y. Rubner, L. Guibas, and C. Tomasi · 1997
Earlier work this paper cites.
A note on constrained k-means algorithms
M. K. Ng · 2000
Earlier work this paper cites.
Methods of Information Geometry
S.-I. Amari and H. Nagaoka · 2001
Earlier work this paper cites.
The centroid of the symmetrical kullback-leibler distance
R. Veldhuis · 2002
Cited alongside, same era.
Mirror descent and nonlinear projected subgradient methods for convex optimization
A. Beck and M. Teboulle · 2003
Cited alongside, same era.
Clustering with bregman divergences
A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh · 2005
Cited alongside, same era.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Cited alongside, same era.
A kernel method for the two-sample-problem
A. Gretton, K. M. Borgwardt, M. Rasch, B. Schoelkopf, and A. J. Smola · 2007
Cited alongside, same era.
A unified continuous optimization framework for center-based clustering methods
M. Teboulle · 2007
Cited alongside, same era.
Barycenters in the Wasserstein space
M. Agueh and G. Carlier · 2011
Later among the works it cites.
On information-maximization clustering: Tuning parameter selection and analytic solution
M. Sugiyama, M. Yamada, M. Kimura, and H. Hachiya · 2011
Later among the works it cites.
G. Zen and E. Ricci · 2011
Later among the works it cites.
Learning probability measures with respect to optimal transport metrics
G. Canas and L. Rosasco · 2012
Later among the works it cites.
A fast algorithm for matrix balancing
P. A. Knight and D. Ruiz · 2012
Later among the works it cites.
Wasserstein barycenter and its application to texture mixing
J. Rabin, G. Peyré, J. Delon, and M. Bernot · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Testing for homogeneity with kernel fisher discriminant analysis
Z. Harchaoui, F. Bach, and E. Moulines · 2008
Cited alongside, same era.
Fast and robust earth mover’s distances
O. Pele and M. Werman · 2009
Cited alongside, same era.
Optimal transport: old and new , volume 338
C. Villani · 2009
Cited alongside, same era.
Supersamples from kernel-herding
Y. Chen, M. Welling, and A. J. Smola · 2010
Cited alongside, same era.
f-divergence estimation and two-sample homogeneity test under semiparametric density-ratio models
T. Kanamori, T. Suzuki, and M. Sugiyama
Cited in the paper.
Statistical analysis of kernel-based least-squares density-ratio estimation
T. Kanamori, T. Suzuki, and M. Sugiyama
Cited in the paper.
Later among the works it cites.
Sinkhorn distances: Lightspeed computation of optimal transport
M. Cuturi · 2013
Closest in time.
Jeffreys centroids: A closed-form expression for positive histograms and a guaranteed tight approximation for frequency histograms
F. Nielsen · 2013
Closest in time.
A non-parametric ensemble transform method for bayesian inference
S. Reich · 2013
Closest in time.
Wasserstein propagation for semi-supervised learning
J. Solomon, R. Rustamov, G. Leonidas, and A. Butscher · 2014
Closest in time.