Fetching the paper…
Reading the bibliography…
We study in this paper a variant of Wasserstein barycenter problem, which we refer to as tree-Wasserstein barycenter, by leveraging a specific class of ground metrics, namely tree metrics, for Wasserstein distance.
Diagonal equivalence to matrices with prescribed row and column sums
R. Sinkhorn · 1974
Earlier work this paper cites.
Term-weighting approaches in automatic text retrieval
G. Salton and C. Buckley · 1988
Earlier work this paper cites.
Phylogenetics
C. Semple and M. Steel · 2003
Earlier work this paper cites.
Hierarchical Dirichlet processes
Y.W. Teh, M.I. Jordan, M.J. Beal, and D.M. Blei · 2006
Earlier work this paper cites.
The nested dirichlet process
A. Rodriguez, D. B . Dunson, and A. E. Gelfand · 2008
Earlier work this paper cites.
Generating random correlation matrices based on vines and extended onion method
D. Lewandowski, D. Kurowicka, and H. Joe · 2009
Earlier work this paper cites.
Fast and robust earth mover’s distance
O. Pele and M. Werman · 2009
Earlier work this paper cites.
Wasserstein barycenter and its application to texture mixing
J. Rabin, G. Peyré, J. Delon, and M. Bernot · 2011
Earlier work this paper cites.
The phylogenetic kantorovich–rubinstein metric for environmental sequence samples
S. N. Evans and F. A. Matsen · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
M. Cuturi · 2013
Earlier work this paper cites.
Distributed representations of words and phrases and their compositionality
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean · 2013
Earlier work this paper cites.
Fast computation of Wasserstein barycenters
M. Cuturi and A. Doucet · 2014
Earlier work this paper cites.
The no-u-turn sampler: adaptively setting path lengths in hamiltonian monte carlo
M. D. Hoffman and A. Gelman · 2014
Earlier work this paper cites.
Path finding methods for linear programming: Solving linear programs in O ~ \widetilde{O} (sqrt(rank)) iterations and faster algorithms for maximum flow
Y. T. Lee and A. Sidford · 2014
Cited alongside, same era.
Bayesian nonparametric multilevel clustering with group-level contexts
V. Nguyen, D. Phung, X. Nguyen, S. Venkatesh, and H. Bui · 2014
Cited alongside, same era.
Iterative Bregman projections for regularized transportation problems
J. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré · 2015
Cited alongside, same era.
Sliced and Radon Wasserstein barycenters of measures
N. Bonneel, J. Rabin, G. Peyré, and H. Pfister · 2015
Cited alongside, same era.
From word embeddings to document distances
M. Kusner, Y. Sun, N. Kolkin, and K. Weinberger · 2015
Cited alongside, same era.
Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains
Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm
P. Dvurechensky, A. Gasnikov, and A. Kroshnin · 2018
Later among the works it cites.
Scalable Bayes via barycenter in Wasserstein space
S. Srivastava, C. Li, and D. Dunson · 2018
Later among the works it cites.
Wasserstein auto-encoders
I. Tolstikhin, O. Bousquet, S. Gelly, and B. Schoelkopf · 2018
Later among the works it cites.
Massively scalable sinkhorn distances via the Nyström method
J. Altschuler, F. Bach, A. Rudi, and J. Niles-Weed · 2019
Closest in time.
Sliced Wasserstein auto-encoders
S. Kolouri, P. E. Pope, C. E. Martin, and G. K. Rohde · 2019
Closest in time.
On the complexity of approximating Wasserstein barycenters
A. Kroshnin, N. Tupitsa, D. Dvinskikh, P. Dvurechenskii, A. Gasnikov, and C. Uribe · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Solomon, F. De Goes, G. Peyré, M. Cuturi, A. Butscher, A. Nguyen, T. Du, and L. Guibas · 2015
Cited alongside, same era.
Scalable nonparametric bayesian multilevel clustering
V. Huynh, D. Q. Phung, S. Venkatesh, X. Nguyen, M. D. Hoffman, and H. H. Bui · 2016
Cited alongside, same era.
Nonparametric multi-level clustering of human epilepsy seizures
D. F. Wulsin, S. T. Jensen, and B. Litt · 2016
Cited alongside, same era.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
J. Altschuler, J. Weed, and P. Rigollet · 2017
Cited alongside, same era.
Wasserstein generative adversarial networks
M. Arjovsky, S. Chintala, and L. Bottou · 2017
Cited alongside, same era.
Optimal transport for domain adaptation
N. Courty, R. Flamary, D. Tuia, and A. Rakotomamonjy · 2017
Cited alongside, same era.
Multilevel clustering via Wasserstein means
N. Ho, X. Nguyen, M. Yurochkin, H. Bui, V. Huynh, and D. Phung · 2017
Cited alongside, same era.
Fast tree variants of gromov-wasserstein
T. Le, N. Ho, and M. Yamada · 2019
Closest in time.
Tree-sliced variants of Wasserstein distances
T. Le, M. Yamada, K. Fukumizu, and M. Cuturi · 2019
Closest in time.
On the acceleration of the Sinkhorn and Greenkhorn algorithms for optimal transport
T. Lin, N. Ho, and M. I. Jordan · 2019
Closest in time.
Sliced-Wasserstein flows: Nonparametric generative modeling via optimal transport and diffusions
A. Liutkus, U. Simsekli, S. Majewski, A. Durmus, and F.-R. Stöter · 2019
Closest in time.
Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogramming
G. Schiebinger, J. Shu, M. Tabaka, B. Cleary, V. Subramanian, A. Solomon, J. Gould, S. Liu, S. Lin, P. Berube, et al · 2019
Closest in time.
Optimal transport-based polar interpolation of directional fields
J. Solomon and A. Vaxman · 2019
Closest in time.
Sliced Wasserstein generative models
J. Wu, Z. Huang, D. Acharya, W. Li, J. Thoma, D. P. Paudel, and L. V. Gool · 2019
Closest in time.