Fetching the paper…
Reading the bibliography…
We consider the task of aligning two sets of points in high dimension, which has many applications in natural language processing and computer vision.
Earth mover’s distance minimization for unsupervised bilingual lexicon induction
Zhang, M., Liu, Y., Luan, H., and Sun, M. (2017b) · 1945
Earlier work this paper cites.
The hungarian method for the assignment problem
Kuhn, H. W. (1955) · 1955
Earlier work this paper cites.
An algorithm for quadratic programming
Frank, M. and Wolfe, P. (1956) · 1956
Earlier work this paper cites.
A generalized solution of the orthogonal procrustes problem
Schönemann, P. H. (1966) · 1966
Earlier work this paper cites.
The speed of mean glivenko-cantelli convergence
Dudley, R. (1969) · 1969
Earlier work this paper cites.
Adversarial training for unsupervised bilingual lexicon induction
Zhang, M., Liu, Y., Luan, H., and Sun, M. (2017a) · 1970
Earlier work this paper cites.
The design and analysis of computer algorithms
Aho, A. V. and Hopcroft, J. E. (1974) · 1974
Earlier work this paper cites.
Linear time algorithm for isomorphism of planar graphs (preliminary report)
Hopcroft, J. E. and Wong, J.-K. (1974) · 1974
Earlier work this paper cites.
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography
Fischler, M. A. and Bolles, R. C. (1987) · 1987
Earlier work this paper cites.
Procrustes methods in the statistical analysis of shape
Goodall, C. (1991) · 1991
Earlier work this paper cites.
Method for registration of 3-d shapes
Besl, P. J. and McKay, N. D. (1992) · 1992
Earlier work this paper cites.
Shape and motion from image streams under orthography: a factorization method
Tomasi, C. and Kanade, T. (1992) · 1992
Earlier work this paper cites.
A linear programming approach for the weighted graph matching problem
Almohamad, H. and Duffuaa, S. O. (1993) · 1993
Earlier work this paper cites.
Active shape models-their training and application
Cootes, T. F., Taylor, C. J., Cooper, D. H., and Graham, J. (1995) · 1995
Earlier work this paper cites.
Compiling bilingual lexicon entries from a non-parallel english-chinese corpus
Fung, P. (1995) · 1995
Earlier work this paper cites.
Identifying word translations in non-parallel texts
Rapp, R. (1995) · 1995
Earlier work this paper cites.
A graduated assignment algorithm for graph matching
Gold, S. and Rangarajan, A. (1996) · 1996
Earlier work this paper cites.
Sheep, goats, lambs and wolves: A statistical analysis of speaker performance in the nist 1998 speaker recognition evaluation
Doddington, G., Liggett, W., Martin, A., Przybocki, M., and Reynolds, D. (1998) · 1998
Earlier work this paper cites.
A metric for distributions with applications to image databases
Rubner, Y., Tomasi, C., and Guibas, L. J. (1998) · 1998
Earlier work this paper cites.
Computers and intractability
Garey, M. R. and Johnson, D. S. (2002) · 2002
Earlier work this paper cites.
Thirty years of graph matching in pattern recognition
Conte, D., Foggia, P., Sansone, C., and Vento, M. (2004) · 2004
Cited alongside, same era.
Improving timbre similarity: How high is the sky
Pachet, F. and Aucouturier, J.-J. (2004) · 2004
Cited alongside, same era.
A spectral technique for correspondence problems using pairwise constraints
Leordeanu, M. and Hebert, M. (2005) · 2005
Cited alongside, same era.
On the use of gromov-hausdorff distances for shape comparison
Mémoli, F. (2007) · 2007
Cited alongside, same era.
A scale-free distribution of false positives for a large class of audio similarity measures
Aucouturier, J.-J. and Pachet, F. (2008) · 2008
Cited alongside, same era.
Sift flow: Dense correspondence across different scenes
Liu, C., Yuen, J., Torralba, A., Sivic, J., and Freeman, W. T. (2008) · 2008
A distribution-based model to learn bilingual word embeddings
Cao, H., Zhao, T., Zhang, S., and Meng, Y. (2016) · 2016
Later among the works it cites.
Wasserstein discriminant analysis
Flamary, R., Cuturi, M., Courty, N., and Rakotomamonjy, A. (2016) · 2016
Later among the works it cites.
Graph matching: Relax at your own risk
Lyzinski, V., Fishkind, D. E., Fiori, M., Vogelstein, J. T., Priebe, C. E., and Sapiro, G. (2016) · 2016
Later among the works it cites.
Amplitude and phase variation of point processes
Panaretos, V. M., Zemel, Y., et al. (2016) · 2016
Later among the works it cites.
Fast dictionary learning with a smoothed wasserstein loss
Rolet, A., Cuturi, M., and Peyré, G. (2016) · 2016
Later among the works it cites.
Entropic metric alignment for correspondence problems
Solomon, J., Peyré, G., Kim, V. G., and Sra, S. (2016) · 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…
Cited alongside, same era.
Optimization algorithms on matrix manifolds
Absil, P.-A., Mahony, R., and Sepulchre, R. (2009) · 2009
Cited alongside, same era.
A path following algorithm for the graph matching problem
Zaslavskiy, M., Bach, F., and Vert, J.-P. (2009) · 2009
Cited alongside, same era.
Accurate image search using the contextual dissimilarity measure
Jegou, H., Schmid, C., Harzallah, H., and Verbeek, J. (2010) · 2010
Cited alongside, same era.
Hubs in space: Popular nearest neighbors in high-dimensional data
Radovanović, M., Nanopoulos, A., and Ivanović, M. (2010) · 2010
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M. (2013) · 2013
Cited alongside, same era.
Exploiting similarities among languages for machine translation
Mikolov, T., Le, Q. V., and Sutskever, I. (2013) · 2013
Cited alongside, same era.
Near-linear time approximation algorithms for optimal transport via sinkhorn iteration
Altschuler, J., Weed, J., and Rigollet, P. (2017) · 2017
Later among the works it cites.
Learning bilingual word embeddings with (almost) no bilingual data
Artetxe, M., Labaka, G., and Agirre, E. (2017) · 2017
Later among the works it cites.
Inference in generative models using the wasserstein distance
Bernton, E., Jacob, P. E., Gerber, M., and Robert, C. P. (2017) · 2017
Later among the works it cites.
Unsupervised learning by predicting noise
Bojanowski, P. and Joulin, A. (2017) · 2017
Later among the works it cites.
Word translation without parallel data
Conneau, A., Lample, G., Ranzato, M., Denoyer, L., and Jégou, H. (2017) · 2017
Later among the works it cites.
Computational Optimal Transport
Peyré, G. and Cuturi, M. (2017) · 2017
Later among the works it cites.
Offline bilingual word vectors, orthogonal transformations and the inverted softmax
Smith, S. L., Turban, D. H., Hamblin, S., and Hammerla, N. Y. (2017) · 2017
Later among the works it cites.
Empirical optimal transport on countable metric spaces: Distributional limits and statistical applications
Tameling, C., Sommerfeld, M., and Munk, A. (2017) · 2017
Later among the works it cites.
Weed, J. and Bach, F. (2017) · 2017
Later among the works it cites.
Fréchet means and procrustes analysis in wasserstein space
Zemel, Y. and Panaretos, V. M. (2017) · 2017
Later among the works it cites.
Learning generative models with sinkhorn divergences
Genevay, A., Peyré, G., and Cuturi, M. (2018) · 2018
Closest in time.
An iterative closest point method for unsupervised word translation
Hoshen, Y. and Wolf, L. (2018) · 2018
Closest in time.
Optimal transport: Fast probabilistic approximation with exact solvers
Sommerfeld, M., Schrieber, J., and Munk, A. (2018) · 2018
Closest in time.