The DOI matches its Crossref record; 210 of the 210 references it cites were found in a registry or an index.
Computational Optimal Transport
Abstract
The goal of Optimal Transport (OT) is to define geometric tools that are useful to compare probability distributions. Their use dates back to 1781. Recent years have witnessed a new revolution in the spread of OT, thanks to the emergence of approximate solvers that can scale to sizes and dimensions that are relevant to data sciences. Thanks to this newfound scalability, OT is being increasingly used to unlock various problems in imaging sciences (such as color or texture processing), computer vision and graphics (for shape manipulation) or machine learning (for regression, classification and density fitting). This monograph reviews OT with a bias toward numerical methods and their applications in data sciences, and sheds lights on the theoretical properties of OT that make it particularly useful for some of these applications. Computational Optimal Transport presents an overview of the main theoretical insights that support the practical effectiveness of OT before explaining how to turn these insights into fast computational schemes. Written for readers at all levels, the authors provide descriptions of foundational theory at two-levels. Generally accessible to all readers, more advanced readers can read the specially identified more general mathematical expositions of optimal transport tailored for discrete measures. Furthermore, several chapters deal with the interplay between continuous and discrete measures, and are thus targeting a more mathematically-inclined audience. This monograph will be a valuable reference for researchers and students wishing to get a thorough understanding of Computational Optimal Transport, a mathematical gem at the interface of probability, analysis and optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems
Abadi, M., Agarwal, A., Barham, P., Brevdo, E., Chen, Z., Citro, C., Corrado, G. S., Davis, A., Dean, J., Devin, M., et al. (2016) · arXiv · doi:10.48550/arxiv.1603.04467 · Cited by 9,408
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
Lazebnik, S., Schmid, C., & Ponce, J. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06) · doi:10.1109/cvpr.2006.68 · Cited by 7,916
(2017) · International Conference on Machine Learning · Cited by 6,382
Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope
Oliva, A., & Torralba, A. (2001) · International Journal of Computer Vision · doi:10.1023/a:1011139631724 · Cited by 6,319
The Earth Mover's Distance as a Metric for Image Retrieval
Rubner, Y., Tomasi, C., & Guibas, L. J. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026543900054 · Cited by 4,568
Topics in Optimal Transportation
Villani, C. (2003) · Graduate Studies in Mathematics · doi:10.1090/gsm/058 · Cited by 4,412
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Distance Metric Learning for Large Margin Nearest Neighbor Classification
Weinberger, K. Q., & Saul, L. K. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1577078 · Cited by 4,044
(2012) · MPG.PuRe (Max Planck Society) · doi:10.5555/2188385.2188410 · Cited by 3,603
Monotone Operators and the Proximal Point Algorithm
Rockafellar, R. T. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314056 · Cited by 3,559
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2017) · CMS Books in Mathematics · doi:10.1007/978-3-319-48311-5 · Cited by 3,307
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
Point Set Registration: Coherent Point Drift
Myronenko, A., & Song, X. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.46 · Cited by 2,762
A Wavelet Tour of Signal Processing : The Sparse Way
Mallat, S., & Gabriel Peyré, A. (2008) · Cited by 2,734
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Sinkhorn Distances: Lightspeed Computation of Optimal TransportPreprint
Cuturi, M. (2013) · Cited by 2,385
Self-citation(2008) · doi:10.1007/978-3-7643-8722-8 · Cited by 2,220
A Kernel Method for the Two-Sample-Problem
Gretton, A., Borgwardt, K. M., Rasch, M., Schölkopf, B., & Smola, A. J. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0069 · Cited by 2,167
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation
Griewank, A., & Walther, A. (1987) · Cited by 2,161
Domain Adaptation for Large-Scale Sentiment Classification: A Deep Learning Approach
Glorot, X., Bordes, A., & Bengio, Y. (2011) · HAL · Cited by 2,020
Splitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972
From Word Embeddings To Document Distances
Kusner, M. J., Sun, Y., Kolkin, N., & Weinberger, K. Q. (2015) · PolyPublie (École Polytechnique de Montréal) · Cited by 1,695
Metric Structures for Riemannian and Non-Riemannian Spaces
(2007) · Modern Birkhäuser Classics · doi:10.1007/978-0-8176-4583-0 · Cited by 1,694
Polar factorization and monotone rearrangement of vector‐valued functions
Brenier, Y. (1991) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160440402 · Cited by 1,641
A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
Benamou, J.-D., & Brenier, Y. (2000) · Numerische Mathematik · doi:10.1007/s002110050002 · Cited by 1,609
The Distribution of a Product from Several Sources to Numerous Localities
Hitchcock, F. L. (1941) · Journal of Mathematics and Physics · doi:10.1002/sapm1941201224 · Cited by 1,609
Static Analysis of Shape in TensorFlow Programs
The Theano Development Team, Al‐Rfou, R., Alain, G., Almahairi, A., Angermueller, C., Bahdanau, D., Ballas, N., Bastien, F., Bayer, J., Belikov, A., et al. (2016) · arXiv (Cornell University) · doi:10.4230/lipics.ecoop.2020.15 · Cited by 1,589
Reproducing Kernel Hilbert Spaces in Probability and Statistics
Berlinet, A., & Thomas-Agnan, C. (2004) · Springer eBooks · doi:10.1007/978-1-4419-9096-9 · Cited by 1,558
Deming, W. E., & Stephan, F. F. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731829 · Cited by 1,537
THE GEOMETRY OF DISSIPATIVE EVOLUTION EQUATIONS: THE POROUS MEDIUM EQUATION
Otto, F. (2001) · Communications in Partial Differential Equations · doi:10.1081/pde-100002243 · Cited by 1,490
The pyramid match kernel: discriminative classification with sets of image features
Grauman, K., & Darrell, T. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.239 · Cited by 1,481
KERNEL METHODS IN MACHINE LEARNING
Hofmann, T., Schölkopf, B., & Smola, A. J. (2008) · Cited by 1,408
Information-type measures of difference of probability distributions and indirect observation
Csiszár, I. (1967) · Studia Scientiarum Mathematicarum Hungarica · Cited by 1,332
A General Class of Coefficients of Divergence of One Distribution from Another
Ali, S. M., & Silvey, S. D. (1966) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1966.tb00626.x · Cited by 1,205
On Choosing and Bounding Probability Metrics
Gibbs, A. L., & Su, F. E. (2002) · International Statistical Review · doi:10.1111/j.1751-5823.2002.tb00178.x · Cited by 1,163
A new metric for probability distributions
Endres, D. M., & Schindelin, J. E. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813506 · Cited by 1,163
Glowinski, R., & Marroco, A. (1975) · Revue française d'automatique, informatique, recherche opérationnelle. Analyse numérique · doi:10.1051/m2an/197509r200411 · Cited by 1,105
A graduated assignment algorithm for graph matching
Gold, S., & Rangarajan, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.491619 · Cited by 1,090
Mirror descent and nonlinear projected subgradient methods for convex optimization
Beck, A., & Teboulle, M. (2003) · Operations Research Letters · doi:10.1016/s0167-6377(02)00231-6 · Cited by 1,060
A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
Sinkhorn, R. (1964) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177703591 · Cited by 1,032
Network Optimization: Continuous and Discrete Models
Bertsekas, D. P. (1998) · Cited by 1,027
Optimal Transport for Domain Adaptation
Courty, N., Flamary, R., Tuia, D., & Rakotomamonjy, A. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2615921 · Cited by 989
Power Diagrams: Properties, Algorithms and Applications
Aurenhammer, F. (1987) · SIAM Journal on Computing · doi:10.1137/0216006 · Cited by 832
Schiebinger, G., Shu, J., Tabaka, M., Cleary, B., Subramanian, V., Solomon, A., Gould, J., Liu, S., Lin, S., Berube, P., et al. (2019) · Cell · doi:10.1016/j.cell.2019.01.006 · Cited by 829
Botsch, M., Kobbelt, L., Pauly, M., Alliez, P., & Levy, B. (2010) · A K Peters/CRC Press eBooks · doi:10.1201/b10688 · Cited by 814
The geometry of optimal transportation
Gangbo, W., & McCann, R. J. (1996) · Acta Mathematica · doi:10.1007/bf02392620 · Cited by 813
Fast and robust Earth Mover's Distances
Pele, O., & Werman, M. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459199 · Cited by 805
A Nonparametric Estimate of a Multivariate Density Function
Loftsgaarden, D. O., & Quesenberry, C. P. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700079 · Cited by 781
Barycenters in the Wasserstein Space
Agueh, M., & Carlier, G. (2011) · SIAM Journal on Mathematical Analysis · doi:10.1137/100805741 · Cited by 749
On the Methods of Measuring Association Between Two Attributes
Yule, G. U. (1912) · Journal of the Royal Statistical Society · doi:10.2307/2340126 · Cited by 744
A survey for the quadratic assignment problem
Loiola, E. M., de Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.09.032 · Cited by 741
Metric spaces and positive definite functions
Schoenberg, I. J. (1938) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1938-1501980-0 · Cited by 702
Iterative Bregman Projections for Regularized Transportation Problems
Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., & Peyré, G. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/141000439 · Cited by 672
Self-citationBarvinok, A. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/054 · Cited by 660
(1997) · SZTAKI Publication Repository (Hungarian Academy of Sciences) · Cited by 598
New algorithms for 2D and 3D point matching
Gold, S., Rangarajan, A., Lu, C.-P., Pappu, S., & Mjolsness, E. (1998) · Pattern Recognition · doi:10.1016/s0031-3203(98)80010-1 · Cited by 580
An Algorithm for Restricted Least Squares Regression
Dykstra, R. L. (1983) · Journal of the American Statistical Association · doi:10.1080/01621459.1983.10477029 · Cited by 551
Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching
Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0508601103 · Cited by 538
Gromov–Wasserstein Distances and the Metric Approach to Object Matching
Mémoli, F. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9093-5 · Cited by 515
A fast algorithm for matrix balancing
Knight, P. A., & Ruiz, D. (2013) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drs019 · Cited by 507
Wasserstein Barycenter and Its Application to Texture Mixing
Rabin, J., Peyré, G., Delon, J., & Bernot, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24785-9_37 · Cited by 504
Self-citationA Douglas–Rachford Splitting Approach to Nonsmooth Convex Variational Signal Recovery
Combettes, P. L., & Pesquet, J.-C. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910264 · Cited by 490
Kulis, B. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601986979 · Cited by 482
Convolutional wasserstein distances: efficient optimal transportation on geometric domains
Solomon, J., de Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., & Guibas, L. (2015) · ACM Transactions on Graphics · doi:10.1145/2766963 · Cited by 481
Self-citationSliced and Radon Wasserstein Barycenters of Measures
Bonneel, N., Rabin, J., Peyré, G., & Pfister, H. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-014-0506-3 · Cited by 467
Self-citationOn Wasserstein Two-Sample Testing and Related Families of Nonparametric Tests
Ramdas, A., Trillos, N., & Cuturi, M. (2017) · Entropy · doi:10.3390/e19020047 · Cited by 443
Self-citationOptimal Mass Transport: Signal processing and machine-learning applications
Kolouri, S., Park, S. R., Thorpe, M., Slepcev, D., & Rohde, G. K. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2695801 · Cited by 443
A new algorithm for non-rigid point matching
Chui, H., & Rangarajan, A. (2002) · Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) · doi:10.1109/cvpr.2000.854733 · Cited by 440
Modern Multidimensional Scaling
(2005) · Springer Series in Statistics · doi:10.1007/0-387-28981-x · Cited by 432
Auction algorithms for network flow problems: A tutorial introduction
Bertsekas, D. P. (1992) · Computational Optimization and Applications · doi:10.1007/bf00247653 · Cited by 421
Fast Computation of Wasserstein Barycenters
Cuturi, M., & Arnaud Doucet, B. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.4375 · Cited by 420
Self-citationAn Efficient Earth Mover's Distance Algorithm for Robust Histogram Comparison
Ling, H., & Okada, K. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1058 · Cited by 414
A SURVEY OF THE SCHRÖDINGER PROBLEM AND SOME OF ITS CONNECTIONS WITH OPTIMAL TRANSPORTPreprint
(2016) · Cited by 403
Automated colour grading using colour distribution transfer
Pitié, F., Kokaram, A. C., & Dahyot, R. (2007) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2006.11.011 · Cited by 395
The Evolution of the Minimum Degree Ordering Algorithm
George, A. D., & Liu, J. W. H. (1989) · SIAM Review · doi:10.1137/1031001 · Cited by 395
Vaillant, M., & Glaunès, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11505730_32 · Cited by 380
Application of the simplex method to a transportation problem
Dantzig, G. B. (1951) · Medical Entomology and Zoology · Cited by 375
The Sinkhorn–Knopp Algorithm: Convergence and Applications
Knight, P. A. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060659624 · Cited by 372
Bures, D. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0236719-2 · Cited by 365
The gravity model in transportation analysis : theory and extensions
Erlander, S., & Stewart, N. F. (1990) · VSP eBooks · Cited by 360
Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation
Griewank, A. (1992) · Optimization Methods and Software · doi:10.1080/10556789208805505 · Cited by 360
Fast projection onto the simplex and the $$\pmb {l}_\mathbf {1}$$ l 1 ball
Condat, L. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0946-6 · Cited by 350
Learning with a Wasserstein Loss
Frogner, C., Zhang, C., Mobahi, H., Araya‐Polo, M., & Poggio, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.05439 · Cited by 337
A Theoretical and Computational Framework for Isometry Invariant Recognition of Point Cloud Data
Mémoli, F., & Sapiro, G. (2005) · Foundations of Computational Mathematics · doi:10.1007/s10208-004-0145-y · Cited by 311
A Linear Time Histogram Metric for Improved SIFT Matching
Pele, O., & Werman, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_37 · Cited by 305
Self-concordant analysis for logistic regression
Bach, F. (2010) · Electronic Journal of Statistics · doi:10.1214/09-ejs521 · Cited by 298
Geodesics in heat: A new approach to computing distance based on heat flow
Crane, K., Weischedel, C., & Wardetzky, M. (2013) · ACM Transactions on Graphics · doi:10.1145/2516971.2516977 · Cited by 297
Classical complexity and quantum entanglement
Gurvits, L. (2004) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2004.06.003 · Cited by 295
A new algorithm for the assignment problem
Bertsekas, D. P. (1981) · Mathematical Programming · doi:10.1007/bf01584237 · Cited by 292
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Altschuler, J. M., Weed, J., & Rigollet, P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.09634 · Cited by 280
Stochastic Optimization for Large-scale Optimal TransportPreprint
Genevay, A., Cuturi, M., Gabriel Peyré, A., & Bach, F. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.08527 · Cited by 275
Self-citationWeed, J., & Bach, F. (2019) · Bernoulli · doi:10.3150/18-bej1065 · Cited by 275
Introduction to Automatic Differentiation and MATLAB Object-Oriented Programming
Neidinger, R. D. (2010) · SIAM Review · doi:10.1137/080743627 · Cited by 271
Proximal minimization algorithm withD-functions
Censor, Y., & Zenios, S. A. (1992) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940051 · Cited by 268
Bronstein, A. M., Bronstein, M. M., Kimmel, R., Mahmoudi, M., & Sapiro, G. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-009-0301-6 · Cited by 267
Bayesian inference with optimal maps
El Moselhy, T. A., & Marzouk, Y. M. (2012) · Journal of Computational Physics · doi:10.1016/j.jcp.2012.07.022 · Cited by 267
Unbalanced optimal transport: Dynamic and Kantorovich formulations
Chizat, L., Peyré, G., Schmitzer, B., & Vialard, F.-X. (2018) · Journal of Functional Analysis · doi:10.1016/j.jfa.2018.03.008 · Cited by 263
Self-citationOn the Relation Between Optimal Transport and Schrödinger Bridges: A Stochastic Control Viewpoint
Chen, Y., Georgiou, T. T., & Pavon, M. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-015-0803-z · Cited by 258
The Speed of Mean Glivenko-Cantelli Convergence
Dudley, R. M. (1969) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697802 · Cited by 253
Quantitative Concentration Inequalities for Empirical Measures on Non-compact Spaces
Bolley, F., Guillin, A., & Villani, C. (2007) · Probability Theory and Related Fields · doi:10.1007/s00440-006-0004-7 · Cited by 248
On the optimal mapping of distributions
Knott, M., & Smith, C. S. (1984) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934745 · Cited by 248
Displacement interpolation using Lagrangian mass transport
Bonneel, N., van de Panne, M., Paris, S., et al. (2011) · doi:10.1145/2024156.2024192 · Cited by 241
Local Histogram Based Segmentation Using the Wasserstein Distance
Ni, K., Bresson, X., Chan, T., & Esedoglu, S. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-009-0234-0 · Cited by 237
On the empirical estimation of integral probability metrics
Sriperumbudur, B. K., Fukumizu, K., Gretton, A., Schölkopf, B., & Lanckriet, G. R. G. (2012) · Electronic Journal of Statistics · doi:10.1214/12-ejs722 · Cited by 225
On integral probability metrics, ϕ-divergences and binary classificationPreprint
Sriperumbudur, B. K., Fukumizu, K., Gretton, A., Schölkopf, B., & Lanckriet, G. R. G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0901.2698 · Cited by 224
Diffusion Distance for Histogram Comparison
Ling, H., & Okada, K. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.99 · Cited by 222
Gromov-Wasserstein Averaging of Kernel and Distance Matrices
Gabriel Peyré, A., Cuturi, M., & Solomon, J. (2016) · Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD) (University Paris-Dauphine) · Cited by 221
Self-citationProgramming of Interdependent Activities: II Mathematical Model
Dantzig, G. B. (1949) · Econometrica · doi:10.2307/1905523 · Cited by 216
On the scaling of multidimensional matrices
Franklin, J., & Lorenz, J. (1989) · Linear Algebra and its Applications · doi:10.1016/0024-3795(89)90490-4 · Cited by 213
Minkowski-Type Theorems and Least-Squares Clustering
Aurenhammer, F., Hoffmann, F., & Aronov, B. (1998) · Algorithmica · doi:10.1007/pl00009187 · Cited by 208
Inference for Empirical Wasserstein Distances on Finite Spaces
Sommerfeld, M., & Munk, A. (2017) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/rssb.12236 · Cited by 207
A new class of metric divergences on probability spaces and its applicability in statistics
Österreicher, F., & Vajda, I. (2003) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf02517812 · Cited by 206
Sample Complexity of Sinkhorn divergencesPreprint
Genevay, A., Chizat, L., Bach, F., Cuturi, M., & Gabriel Peyré, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.02733 · Cited by 193
Self-citationMetamorphoses Through Lie Group Action
Trouvé, A., & Younes, L. (2005) · Foundations of Computational Mathematics · doi:10.1007/s10208-004-0128-z · Cited by 192
Entropic metric alignment for correspondence problems
Solomon, J., Peyré, G., Kim, V. G., & Sra, S. (2016) · ACM Transactions on Graphics · doi:10.1145/2897824.2925903 · Cited by 184
Self-citationOptimal Transport with Proximal Splitting
Papadakis, N., Peyré, G., & Oudet, E. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/130920058 · Cited by 178
Self-citationLarge-Scale Optimal Transport and Mapping EstimationPreprint
Seguy, V., Damodaran, B. B., Flamary, R., Courty, N., Rolet, A., & Blondel, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.02283 · Cited by 178
Wang, W., Slepčev, D., Basu, S., Ozolek, J. A., & Rohde, G. K. (2013) · International Journal of Computer Vision · doi:10.1007/s11263-012-0566-z · Cited by 177
Approximate earth mover’s distance in linear time
Shirdhonkar, S., & Jacobs, D. W. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587662 · Cited by 176
Graph Matching: Relax at Your Own Risk
Lyzinski, V., Fishkind, D. E., Fiori, M., Vogelstein, J. T., Priebe, C. E., & Sapiro, G. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2424894 · Cited by 173
Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
Carlier, G., Duval, V., Gabriel Peyré, A., & Schmitzer, B. (2017) · SIAM Journal on Mathematical Analysis · doi:10.1137/15m1050264 · Cited by 171
An Interpolating Distance Between Optimal Transport and Fisher–Rao Metrics
Chizat, L., Peyré, G., Schmitzer, B., & Vialard, F.-X. (2018) · Foundations of Computational Mathematics · doi:10.1007/s10208-016-9331-y · Cited by 169
Self-citationOn the use of Gromov-Hausdorff Distances for Shape Comparison
Mémoli, F. (2007) · Eurographics · doi:10.2312/spbg/spbg07/081-090 · Cited by 165
Glaunes, J., Trouve, A., & Younes, L. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315234 · Cited by 165
A review of matrix scaling and Sinkhorn's normal form for matrices and positive mapsPreprint
Idel, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.06349 · Cited by 164
Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
Schmitzer, B. (2019) · SIAM Journal on Scientific Computing · doi:10.1137/16m1106018 · Cited by 164
From optimal transport to generative modeling: the VEGAN cookbookPreprint
Bousquet, O., Gelly, S., Tolstikhin, I., Simon-Gabriel, C.-J., & Schölkopf, B. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.07642 · Cited by 164
A Smoothed Dual Approach for Variational Wasserstein Problems
Cuturi, M., & Gabriel Peyré, A. (2016) · SIAM Journal on Imaging Sciences · doi:10.1137/15m1032600 · Cited by 163
Self-citationWasserstein barycentric coordinates: histogram regression using optimal transport
Bonneel, N., Gabriel Peyré, A., & Cuturi, M. (2016) · ACM Transactions on Graphics · doi:10.1145/2897824.2925918 · Cited by 162
Self-citationRanking via Sinkhorn PropagationPreprint
Adams, R. P., & Zemel, R. S. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1106.1925 · Cited by 160
Distributionally Robust Logistic Regression
Shafieezadeh-Abadeh, S., Esfahani, P. M., & Kühn, D. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.09259 · Cited by 160
A Survey of Gaussian Convolution Algorithms
Getreuer, P. (2013) · Image Processing On Line · doi:10.5201/ipol.2013.87 · Cited by 158
The Optimal Partial Transport Problem
Figalli, A. (2009) · Archive for Rational Mechanics and Analysis · doi:10.1007/s00205-008-0212-7 · Cited by 153
Multi-marginal optimal transport: Theory and applications
Pass, B. (2015) · ESAIM Mathematical Modelling and Numerical Analysis · doi:10.1051/m2an/2015020 · Cited by 153
Nonnegative Matrix Factorization with Earth Mover's Distance Metric for Image Analysis
Sandler, R., & Lindenbaum, M. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.18 · Cited by 153
The invisible hand algorithm: Solving the assignment problem with statistical physics
Kosowsky, J. J., & Yuille, A. (1994) · Neural Networks · doi:10.1016/0893-6080(94)90081-7 · Cited by 151
Geodesic convexity of the relative entropy in reversible Markov chains
Mielke, A. (2012) · Calculus of Variations and Partial Differential Equations · doi:10.1007/s00526-012-0538-8 · Cited by 149
Wasserstein geometry of Gaussian measures
Takatsu, A. (2011) · Osaka City University (Osaka City University) · doi:10.18910/4973 · Cited by 147
Convergence of the Iterative Proportional Fitting Procedure
Rüschendorf, L. (1995) · The Annals of Statistics · doi:10.1214/aos/1176324703 · Cited by 146
Fokker–Planck Equations for a Free Energy Functional or Markov Process on a Graph
Chow, S.-N., Huang, W., Li, Y., & Zhou, H. (2011) · Archive for Rational Mechanics and Analysis · doi:10.1007/s00205-011-0471-6 · Cited by 146
Earth mover's distances on discrete surfaces
Solomon, J., Rustamov, R. M., Guibas, L. J., & Butscher, A. (2014) · ACM Transactions on Graphics · doi:10.1145/2601097.2601175 · Cited by 146
Sliced Wasserstein Kernels for Probability Distributions
Kolouri, S., Zou, Y., & Rohde, G. K. (2016) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2016.568 · Cited by 143
Fast Optimal Transport Averaging of Neuroimaging Data
Gramfort, A., Gabriel Peyré, A., & Cuturi, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-19992-4_20 · Cited by 141
Self-citationMohajerin Esfahani, P., & Kuhn, D. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1172-1 · Cited by 136
Optimal Mass Transport for Shape Matching and Comparison
Su, Z., Wang, Y., Shi, R., Zeng, W., Sun, J., Luo, F., & Gu, X. D. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2408346 · Cited by 135
Power particles: an incompressible fluid solver based on power diagrams
de Goes, F., Wallez, C., Huang, J., Pavlov, D., & Desbrun, M. (2015) · ACM Transactions on Graphics · doi:10.1145/2766901 · Cited by 135
Fisher information distance: A geometrical reading
Costa, S. I. R., Santos, S. A., & Strapasson, J. E. (2014) · Discrete Applied Mathematics · doi:10.1016/j.dam.2014.10.004 · Cited by 128
Supervised word mover's distance
Huang, G. M., Quo, C., Kusner, M. J., Sun, Y., Weinberger, K. Q., & Sha, F. (2016) · PolyPublie (École Polytechnique de Montréal) · doi:10.5555/3157382.3157641 · Cited by 123
Entropic Approximation of Wasserstein Gradient Flows
Gabriel Peyré, A. (2015) · SIAM Journal on Imaging Sciences · doi:10.1137/15m1010087 · Cited by 117
Scaling Algorithms for Unbalanced Transport ProblemsPreprint
Chizat, L., Gabriel Peyré, A., Schmitzer, B., & Vialard, F. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1607.05816 · Cited by 116
Edwards, D. A. (1975) · Elsevier eBooks · doi:10.1016/b978-0-12-663450-1.50017-7 · Cited by 97
Much Faster Algorithms for Matrix Scaling
Allen-Zhu, Z., Li, Y., Oliveira, R., & Wigderson, A. (2017) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2017.87 · Cited by 95
Multilevel Clustering via Wasserstein MeansPreprint
Ho, N., Nguyen, X., Yurochkin, M., Bui, H., Huynh, V. H., & Phung, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.03883 · Cited by 95
A Novel Earth Mover's Distance Methodology for Image Matching with Gaussian Mixture Models
Li, P., Wang, Q., & Zhang, L. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.212 · Cited by 89
Minimax Statistical Learning with Wasserstein DistancesPreprint
Lee, J., & Raginsky, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.07815 · Cited by 89
Planar Earthmover Is Not in $L_1$
Naor, A., & Schechtman, G. (2007) · SIAM Journal on Computing · doi:10.1137/05064206x · Cited by 87
Discrete Wasserstein barycenters: optimal transport for discrete data
Anderes, E., Borgwardt, S., & Miller, J. (2016) · Mathematical Methods of Operations Research · doi:10.1007/s00186-016-0549-x · Cited by 86
Liero, M., Mielke, A., & Savaré, G. (2015) · doi:10.20347/wias.preprint.2160 · Cited by 86
Wasserstein Propagation for Semi-Supervised Learning
Solomon, J., Rustamov, R. M., Guibas, L. J., & Butscher, A. (2014) · Cited by 84
Quadratically Regularized Optimal Transport on Graphs
Essid, M., & Solomon, J. (2018) · SIAM Journal on Scientific Computing · doi:10.1137/17m1132665 · Cited by 84
An Optimal Transportation Approach for Nuclear Structure-Based Pathology
Wang, W., Ozolek, J. A., Slepčev, D., Lee, A. B., Chen, C., & Rohde, G. K. (2010) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2010.2089693 · Cited by 81
Optimal Transport for Diffeomorphic Registration
Feydy, J., Charlier, B., Vialard, F., & Gabriel Peyré, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66182-7_34 · Cited by 78
A Sparse Multiscale Algorithm for Dense Optimal Transport
Schmitzer, B. (2016) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-016-0653-9 · Cited by 76
Амари, Ш.-И., Karakida, R., & Oizumi, M. (2018) · Information Geometry · doi:10.1007/s41884-018-0002-8 · Cited by 75
About the analogy between optimal transport and minimal entropy
Gentil, I., Léonard, C., & Ripani, L. (2017) · Annales de la faculté des sciences de Toulouse Mathématiques · doi:10.5802/afst.1546 · Cited by 71
Kantorovich-Rubinstein norm and its application in the theory of Lipschitz spaces
Hanin, L. G. (1992) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1992-1097344-5 · Cited by 71
Wasserstein Training of Restricted Boltzmann Machines
Montavon, G., Müller, K. R., & Cuturi, M. (2016) · neural information processing systems · Cited by 71
Self-citationSchiebinger, G., Shu, J., Tabaka, M., Cleary, B., Subramanian, V., Solomon, A., Liu, S.-Y., Lin, S., Berube, P., Lee, L., et al. (2017) · bioRxiv · doi:10.1101/191056 · Cited by 71
An Image Morphing Technique Based on Optimal Mass Preserving Mapping
Zhu, L., Yang, Y. X., Haker, S. J., & Tannenbaum, A. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.896637 · Cited by 68
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Linial, N., Samorodnitsky, A., & Wigderson, A. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276880 · Cited by 67
The Space of Spaces: Curvature Bounds and Gradient Flows on the Space of Metric Measure Spaces
Sturm, K. (2023) · Memoirs of the American Mathematical Society · doi:10.1090/memo/1443 · Cited by 66
Riemannian Center of Mass and so called karcher meanPreprint
Karcher, H. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.2087 · Cited by 63
Simple Bounds for the Convergence of Empirical and Occupation Measures in 1-Wasserstein Distance
Boissard, E. (2011) · Electronic Journal of Probability · doi:10.1214/ejp.v16-958 · Cited by 63
A generalized model for optimal transport of images including dissipation and density modulation
Maas, J., Rumpf, M., Schönlieb, C., & Simon, S. (2015) · ESAIM Mathematical Modelling and Numerical Analysis · doi:10.1051/m2an/2015043 · Cited by 60
An Iterative Procedure for Obtaining $I$-Projections onto the Intersection of Convex Sets
Dykstra, R. L. (1985) · The Annals of Probability · doi:10.1214/aop/1176992918 · Cited by 59
Synthesizing and Mixing Stationary Gaussian Texture Models
Xia, G.-S., Ferradans, S., Gabriel Peyré, A., & Aujol, J. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/130918010 · Cited by 55
Supervised Earth Mover’s Distance Learning and Its Computer Vision Applications
Wang, F., & Guibas, L. J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33718-5_32 · Cited by 53
Convergence Properties of the Softassign Quadratic Assignment Algorithm
Rangarajan, A., Yuille, A., & Mjolsness, E. (1999) · Neural Computation · doi:10.1162/089976699300016313 · Cited by 52
Positive contraction mappings for classical and quantum Schrödinger systems
Georgiou, T. T., & Pavon, M. (2015) · eScholarship (California Digital Library) · Cited by 49
Optimal Transport for Secure Spread-Spectrum Watermarking of Still Images
Mathon, B., Cayre, F., Bas, P., et al. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2305873 · Cited by 48
RELATING THE BURES MEASURE TO THE CAUCHY TWO-MATRIX MODELPreprint
Forrester, P. J., & Kieburg, M. (2016) · Cited by 48
A discrete Schrödinger equation via optimal transport on graphs
Chow, S.-N., Li, W., & Zhou, H. (2019) · Journal of Functional Analysis · doi:10.1016/j.jfa.2019.02.005 · Cited by 47
Wasserstein Loss for Image Synthesis and Restoration
Tartavel, G., Gabriel Peyré, A., & Gousseau, Y. (2016) · SIAM Journal on Imaging Sciences · doi:10.1137/16m1067494 · Cited by 46
Optimal Transport and Cournot-Nash Equilibria
Blanchet, A., & Carlier, G. (2015) · Mathematics of Operations Research · doi:10.1287/moor.2015.0719 · Cited by 44
Quantum entropic regularization of matrix-valued optimal transport
Gabriel Peyré, A., Chizat, L., Vialard, F., & Solomon, J. (2017) · European Journal of Applied Mathematics · doi:10.1017/s0956792517000274 · Cited by 43
Learning from uncertain curves: The 2-Wasserstein metric for Gaussian processes
Mallasto, A., & Feragen, A. (2017) · Research at the University of Copenhagen (University of Copenhagen) · Cited by 40
Fast Transport Optimization for Monge Costs on the Circle
Delon, J., Salomon, J., & Sobolevskii, A. N. (2010) · SIAM Journal on Applied Mathematics · doi:10.1137/090772708 · Cited by 39
Robust Hypothesis Testing Using Wasserstein Uncertainty SetsPreprint
Gao, R., Xie, L., Xie, Y., & Xu, H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.10611 · Cited by 39
Closedness of Sum Spaces andthe Generalized Schrödinger Problem
Rüschendorf, L., & Thomsen, W. (1998) · Theory of Probability and Its Applications · doi:10.1137/s0040585x97976301 · Cited by 36
K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance
Indyk, P., & Price, E. (2011) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1993636.1993720 · Cited by 34
Sublinear Time Algorithms for Earth Mover’s Distance
Ba, K. D., Nguyễn, H. L., Nguyen, H. N., et al. (2010) · Theory of Computing Systems · doi:10.1007/s00224-010-9265-8 · Cited by 34
Cited by
SuperGlue: Learning Feature Matching With Graph Neural Networks
Sarlin, P.-E., DeTone, D., Malisiewicz, T., & Rabinovich, A. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00499 · Cited by 2,830
UNITER: UNiversal Image-TExt Representation Learning
Chen, Y.-C., Li, L., Yu, L., El Kholy, A., Ahmed, F., Gan, Z., Cheng, Y., & Liu, J. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58577-8_7 · Cited by 2,055
Deep Closest Point: Learning Representations for Point Cloud Registration
Wang, Y., & Solomon, J. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00362 · Cited by 1,112
LightGlue: Local Feature Matching at Light Speed
Lindenberger, P., Sarlin, P.-E., & Pollefeys, M. (2023) · 2023 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.01616 · Cited by 943
Statistical Aspects of Wasserstein Distances
Panaretos, V. M., & Zemel, Y. (2019) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-030718-104938 · Cited by 857
Metadata
- Authors
- Peyré, G., & Cuturi, M.
- Venue
- now publishers, Inc. eBooks
- Publisher
- now Publishers Inc
- Published
- 2019
- OpenAlex
- W2793477525
- Cited by
- 847
- References
- 210
- FWCI
- 77.77
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.