Fetching the paper…
Reading the bibliography…
Optimal transport (OT) theory can be informally described using the words of the French mathematician Gaspard Monge (1746-1818): A worker with a shovel in hand has to move a large pile of sand lying on a construction site.
On the methods of measuring association between two attributes
G Udny Yule · 1912
Earlier work this paper cites.
Metody nakhozhdeniya naimen’shego summovogo kilome-trazha pri planirovanii perevozok v prostranstve (russian; methods of finding the minimal total kilometrage in cargo transportation planning in space)
AN Tolstoı · 1930
Earlier work this paper cites.
Über die Umkehrung der Naturgesetze
Erwin Schrödinger · 1931
Earlier work this paper cites.
Telefoonverkeersrekening
J. Kruithof · 1937
Earlier work this paper cites.
Metric spaces and positive definite functions
Isaac J Schoenberg · 1938
Earlier work this paper cites.
Metody ustraneniya neratsional’nykh perevozok priplanirovanii [russian; methods of removing irrational transportation in planning]
AN Tolstoı · 1939
Earlier work this paper cites.
On a least squares adjustment of a sampled frequency table when the expected marginal totals are known
Edwards Deming and Frederick F Stephan · 1940
Earlier work this paper cites.
The distribution of a product from several sources to numerous localities
Frank L Hitchcock · 1941
Earlier work this paper cites.
On the transfer of masses (in russian)
Leonid Kantorovich · 1942
Earlier work this paper cites.
Tres observaciones sobre el algebra lineal
Garrett Birkhoff · 1946
Earlier work this paper cites.
Programming of interdependent activities: II mathematical model
George B. Dantzig · 1949
Earlier work this paper cites.
Optimum utilization of the transportation system
Tjalling C Koopmans · 1949
Earlier work this paper cites.
Application of the simplex method to a transportation problem
George B Dantzig · 1951
Earlier work this paper cites.
A continuous model of transportation
Martin Beckmann · 1952
Earlier work this paper cites.
The hungarian method for the assignment problem
Harold W. Kuhn · 1955
Earlier work this paper cites.
Extensions of jentzsch’s theorem
Garrett Birkhoff · 1957
Earlier work this paper cites.
On the perron-frobenius theorem
Hans Samelson et al · 1957
Earlier work this paper cites.
On a space of totally additive functions
LV Kantorovich and G.S. Rubinstein · 1958
Earlier work this paper cites.
Flows in Networks
Lester Randolph Ford and Delbert Ray Fulkerson · 1962
Earlier work this paper cites.
A relationship between arbitrary positive matrices and doubly stochastic matrices
Richard Sinkhorn · 1964
Earlier work this paper cites.
Estimating nonnegative matrices from marginal data
Michael Bacharach · 1965
Earlier work this paper cites.
A nonparametric estimate of a multivariate density function
Don O Loftsgaarden and Charles P Quesenberry · 1965
Earlier work this paper cites.
A general class of coefficients of divergence of one distribution from another
Syed Mumtaz Ali and Samuel D Silvey · 1966
Earlier work this paper cites.
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
Lev M Bregman · 1967
Earlier work this paper cites.
Information-type measures of difference of probability distributions and indirect observations
Imre Ciszár · 1967
Earlier work this paper cites.
On the behavior of the fundamental solution of the heat equation with variable coefficients
Sathamangalam R Srinivasa Varadhan · 1967
Earlier work this paper cites.
An extension of Kakutani’s theorem on infinite product measures to the tensor product of semifinite w ∗ w^{*} -algebras
Donald Bures · 1969
Earlier work this paper cites.
The speed of mean Glivenko-Cantelli convergence
Richard M. Dudley · 1969
Earlier work this paper cites.
The use of entropy maximizing models, in the theory of trip distribution, mode split and route split
Alan Geoffrey Wilson · 1969
Earlier work this paper cites.
The structure of superspace
David A Edwards · 1975
Earlier work this paper cites.
Sur l’approximation, par éléments finis d’ordre un, et la résolution, par pénalisation-dualité d’une classe de problèmes de Dirichlet non linéaires
Roland Glowinski and A. Marroco · 1975
Earlier work this paper cites.
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Daniel Gabay and Bertrand Mercier · 1976
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R Tyrrell Rockafellar · 1976
Earlier work this paper cites.
Splitting algorithms for the sum of two nonlinear operators
Pierre-Louis Lions and Bertrand Mercier · 1979
Earlier work this paper cites.
Geometric Problems in the Theory of Infinite-dimensional Probability Distributions
Vladimir N Sudakov · 1979
Earlier work this paper cites.
Optimal Spatial Interaction and the Gravity Model , volume 173
Sven Erlander · 1980
Earlier work this paper cites.
A new algorithm for the assignment problem
Dimitri P Bertsekas · 1981
Earlier work this paper cites.
Automatic Differentiation: Techniques and Applications
Louis B Rall · 1981
Earlier work this paper cites.
Reminiscences Aabout the origins of linear programming , pages 78–86
George B. Dantzig · 1983
Earlier work this paper cites.
An algorithm for restricted least squares regression
Richard L Dykstra · 1983
Earlier work this paper cites.
Harmonic Analysis on Semigroups
Christian Berg, Jens Peter Reus Christensen, and Paul Ressel · 1984
Earlier work this paper cites.
Extensions of Lipschitz mappings into a Hilbert space
William B Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
On the optimal mapping of distributions
Martin Knott and Cyril S Smith · 1984
Earlier work this paper cites.
An iterative procedure for obtaining I I -projections onto the intersection of convex sets
Richard L Dykstra · 1985
Earlier work this paper cites.
Density Estimation for Statistics and Data Analysis , volume 26
Bernard W Silverman · 1986
Earlier work this paper cites.
Power diagrams: properties, algorithms and applications
Franz Aurenhammer · 1987
Earlier work this paper cites.
Décomposition polaire et réarrangement monotone des champs de vecteurs
Yann Brenier · 1987
Earlier work this paper cites.
Dual coordinate step methods for linear network flow problems
Dimitri P Bertsekas and Jonathan Eckstein · 1988
Earlier work this paper cites.
Notes on the wasserstein metric in hilbert spaces
Juan Antonio Cuesta and Carlos Matran · 1989
Earlier work this paper cites.
On the scaling of multidimensional matrices
Joel Franklin and Jens Lorenz · 1989
Earlier work this paper cites.
The evolution of the minimum degree ordering algorithm
Alan George and Joseph WH Liu · 1989
Earlier work this paper cites.
On the numerical solution of the equation ∂ 2 z ∂ x 2 ∂ 2 z ∂ y 2 − ( ∂ 2 z ∂ x ∂ y ) 2 = f \frac{\partial^{2}z}{\partial x^{2}}\frac{\partial^{2}z}{\partial y^{2}}-\left(\frac{\partial^{2}z}{\partial x\partial y}\right)^{2}=f and its discretizations, I
Vladimir Oliker and Laird D Prussner · 1989
Earlier work this paper cites.
The least action principle and the related concept of generalized flows for incompressible perfect fluids
Yann Brenier · 1990
Earlier work this paper cites.
The Gravity Model in Transportation Analysis: Theory and Extensions
Sven Erlander and Neil F Stewart · 1990
Earlier work this paper cites.
On a formula for the l 2 l^{2} wasserstein metric between measures on euclidean and hilbert spaces
Matthias Gelbrich · 1990
Earlier work this paper cites.
A characterization of random variables with minimum l2-distance
Lüdger Rüschendorf and Svetlozar T Rachev · 1990
Earlier work this paper cites.
Polar factorization and monotone rearrangement of vector-valued functions
Yann Brenier · 1991
Earlier work this paper cites.
Linear programming
George B. Dantzig · 1991
Earlier work this paper cites.
Auction algorithms for network flow problems: a tutorial introduction
Dimitri P Bertsekas · 1992
Earlier work this paper cites.
Proximal minimization algorithm with d d -functions
Yair Censor and Stavros Andrea Zenios · 1992
Earlier work this paper cites.
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Jonathan Eckstein and Dimitri P Bertsekas · 1992
Earlier work this paper cites.
Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation
Andreas Griewank · 1992
Earlier work this paper cites.
Kantorovich-Rubinstein norm and its application in the theory of Lipschitz spaces
Leonid G Hanin · 1992
Earlier work this paper cites.
The dual least action problem for an ideal, incompressible fluid
Yann Brenier · 1993
Earlier work this paper cites.
Recursively implementating the Gaussian and its derivatives
Rachid Deriche · 1993
Earlier work this paper cites.
Asymptotic analysis of the exponential penalty trajectory in linear programming
Roberto Cominetti and Jaime San Martín · 1994
Earlier work this paper cites.
On a generalization of cyclic monotonicity and distances among random vectors
Martin Knott and Cyril S Smith · 1994
Earlier work this paper cites.
The invisible hand algorithm: Solving the assignment problem with statistical physics
JJ Kosowsky and Alan L Yuille · 1994
Earlier work this paper cites.
Interior-point polynomial algorithms in convex programming , volume 13
Yurii Nesterov and Arkadii Nemirovskii · 1994
Earlier work this paper cites.
Convergence of the iterative proportional fitting procedure
Ludger Ruschendorf · 1995
Earlier work this paper cites.
Optimal output-sensitive convex hull algorithms in two and three dimensions
Timothy M Chan · 1996
Earlier work this paper cites.
The geometry of optimal transportation
Wilfrid Gangbo and Robert J McCann · 1996
Earlier work this paper cites.
A graduated assignment algorithm for graph matching
Steven Gold and Anand Rangarajan · 1996
Earlier work this paper cites.
Nonparametric entropy estimation: an overview
Jan Beirlant, Edward J Dudewicz, Laszlo Gyorfi, and Edward C Van der Meulen · 1997
Earlier work this paper cites.
Introduction to Linear Optimization
Dimitris Bertsimas and John N Tsitsiklis · 1997
Earlier work this paper cites.
A convexity principle for interacting gases
Robert J McCann · 1997
Earlier work this paper cites.
A polynomial time primal network simplex algorithm for minimum cost flows
James B. Orlin · 1997
Earlier work this paper cites.
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
Robert E. Tarjan · 1997
Earlier work this paper cites.
Minkowski-type theorems and least-squares clustering
Franz Aurenhammer, Friedrich Hoffmann, and Boris Aronov · 1998
Earlier work this paper cites.
Network Optimization: Continuous and Discrete Models
Dimitri P Bertsekas · 1998
Earlier work this paper cites.
The Dykstra algorithm with Bregman projections
Yair Censor and Simeon Reich · 1998
Earlier work this paper cites.
Optimal maps for the multidimensional Monge-Kantorovich problem
Wilfrid Gangbo and Andrzej Swiech · 1998
Earlier work this paper cites.
New algorithms for 2d and 3d point matching: pose estimation and correspondence
Steven Gold, Anand Rangarajan, Chien-Ping Lu, Suguna Pappu, and Eric Mjolsness · 1998
Earlier work this paper cites.
The variational formulation of the Fokker-Planck equation
Richard Jordan, David Kinderlehrer, and Felix Otto · 1998
Earlier work this paper cites.
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Nathan Linial, Alex Samorodnitsky, and Avi Wigderson · 1998
Earlier work this paper cites.
Closedness of sum spaces and the generalized Schrodinger problem
Ludger Rüschendorf and Wolfgang Thomsen · 1998
Earlier work this paper cites.
Minimal geodesics on groups of volume-preserving maps and generalized solutions of the Euler equations
Yann Brenier · 1999
Earlier work this paper cites.
Problem of reflector design with given far-field scattering data
Luis A Caffarelli, Sergey A Kochengin, and Vladimir I Oliker · 1999
Earlier work this paper cites.
The earth mover’s distance under transformation sets
Scott Cohen and Leonidas Guibas · 1999
Earlier work this paper cites.
Differential Equations Methods for the Monge-Kantorovich Mass Transfer Problem , volume 653
Lawrence C. Evans and Wilfrid Gangbo · 1999
Earlier work this paper cites.
Approximation of parabolic equations using the Wasserstein metric
David Kinderlehrer and Noel J Walkington · 1999
Earlier work this paper cites.
Learning the parts of objects by non-negative matrix factorization
Daniel D Lee and H Sebastian Seung · 1999
Earlier work this paper cites.
On complexity of matrix scaling
Arkadi Nemirovski and Uriel Rothblum · 1999
Earlier work this paper cites.
Numerical Optimization
Jorge Nocedal and Stephen J Wright · 1999
Earlier work this paper cites.
Convergence properties of the softassign quadratic assignment algorithm
Anand Rangarajan, Alan L Yuille, Steven Gold, and Eric Mjolsness · 1999
Earlier work this paper cites.
Dykstra’s algorithm with Bregman projections: a convergence proof
Heinz H Bauschke and Adrian S Lewis · 2000
Earlier work this paper cites.
A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
Jean-David Benamou and Yann Brenier · 2000
Earlier work this paper cites.
A new algorithm for non-rigid point matching
Haili Chui and Anand Rangarajan · 2000
Earlier work this paper cites.
Successive overrelaxation (SOR) and related methods
A Hadjidimos · 2000
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Yossi Rubner, Carlo Tomasi, and Leonidas J Guibas · 2000
Earlier work this paper cites.
Fast slant stack: a notion of radon transform for data in a cartesian grid which is rapidly computible, algebraically exact, geometrically faithful and invertible
Amir Averbuch, Ronald Coifman, David Donoho, Moshe Israeli, and Johan Walden · 2001
Earlier work this paper cites.
A Course in Metric Geometry , volume 33
Dmitri Burago, Yuri Burago, and Sergei Ivanov · 2001
Earlier work this paper cites.
Metric Structures for Riemannian and Non-Riemannian Spaces
Mikhail Gromov · 2001
Earlier work this paper cites.
Modeling the shape of the scene: a holistic representation of the spatial envelope
Aude Oliva and Antonio Torralba · 2001
Earlier work this paper cites.
The geometry of dissipative evolution equations: the porous medium equation
Felix Otto · 2001
Earlier work this paper cites.
Empirical Likelihood
Art B Owen · 2001
Earlier work this paper cites.
On the monge mass transfer problem
Neil S Trudinger and Xu-Jia Wang · 2001
Earlier work this paper cites.
A Course in Convexity
Alexander Barvinok · 2002
Earlier work this paper cites.
Constructing optimal maps for Monge’s transport problem as a limit of strictly convex costs
Luis Caffarelli, Mikhail Feldman, and Robert McCann · 2002
Earlier work this paper cites.
Monge’s transport problem on a Riemannian manifold
Mikhail Feldman and Robert McCann · 2002
Earlier work this paper cites.
A reconstruction of the initial conditions of the universe by optimal mass transportation
Uriel Frisch, Sabino Matarrese, Roya Mohayaee, and Andrei Sobolevski · 2002
Earlier work this paper cites.
On choosing and bounding probability metrics
Alison L Gibbs and Francis Edward Su · 2002
Earlier work this paper cites.
On the n n -coupling problem
Ludger Rüschendorf and Ludger Uckelmann · 2002
Earlier work this paper cites.
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Bernhard Schölkopf and Alexander J Smola · 2002
Earlier work this paper cites.
A polynomial bound on the diameter of the transportation polytope
Leen Stougie · 2002
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
Amir Beck and Marc Teboulle · 2003
Earlier work this paper cites.
Numerical resolution of an “unbalanced” mass transport problem
Jean-David Benamou · 2003
Earlier work this paper cites.
Reproducing Kernel Hilbert Spaces in Probability and Statistics
Alain Berlinet and Christine Thomas-Agnan · 2003
Earlier work this paper cites.
The Monge-Ampere equation and optimal transportation, an elementary review
Luis Caffarelli · 2003
Earlier work this paper cites.
A new metric for probability distributions
Dominik Maria Endres and Johannes E Schindelin · 2003
Earlier work this paper cites.
A survey on continuous elliptical vector distributions
Eusebio Gómez, Miguel A Gómez-Villegas, and J Miguel Marín · 2003
Earlier work this paper cites.
Fast image retrieval via embeddings
Piotr Indyk and Nitin Thaper · 2003
Earlier work this paper cites.
A new class of metric divergences on probability spaces and its applicability in statistics
Ferdinand Österreicher and Igor Vajda · 2003
Earlier work this paper cites.
Topics in Optimal Transportation
Cedric Villani · 2003
Earlier work this paper cites.
Midway image equalization
Julie Delon · 2004
Earlier work this paper cites.
Diffeomorphic matching of distributions: a new approach for unlabelled point-sets and sub-manifolds matching
Joan Glaunes, Alain Trouvé, and Laurent Younes · 2004
Earlier work this paper cites.
Classical complexity and quantum entanglement
Leonid Gurvits · 2004
Earlier work this paper cites.
Optimal mass transport for registration and warping
Steven Haker, Lei Zhu, Allen Tannenbaum, and Sigurd Angenent · 2004
Earlier work this paper cites.
Testing for equal distributions in high dimension
Gábor J Székely and Maria L Rizzo · 2004
Earlier work this paper cites.
Modern Multidimensional Scaling: Theory and Applications
Ingwer Borg and Patrick JF Groenen · 2005
Earlier work this paper cites.
The pyramid match kernel: discriminative classification with sets of image features
Kristen Grauman and Trevor Darrell · 2005
Earlier work this paper cites.
A theoretical and computational framework for isometry invariant recognition of point cloud data
Facundo Mémoli and Guillermo Sapiro · 2005
Earlier work this paper cites.
Metamorphoses through Lie group action
Alain Trouvé and Laurent Younes · 2005
Earlier work this paper cites.
Surface matching via currents
Marc Vaillant and Joan Glaunès · 2005
Earlier work this paper cites.
Gradient Flows in Metric Spaces and in the Space of Probability Measures
L. Ambrosio, N. Gigli, and G. Savaré · 2006
Earlier work this paper cites.
On minimum kantorovich distance estimators
Federico Bassetti, Antonella Bodini, and Eugenio Regazzini · 2006
Cited alongside, same era.
Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching
Alexander M Bronstein, Michael M Bronstein, and Ron Kimmel · 2006
Cited alongside, same era.
Combinatorial Matrix Classes , volume 108
Richard A Brualdi · 2006
Cited alongside, same era.
Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories
Svetlana Lazebnik, Cordelia Schmid, and Jean Ponce · 2006
Cited alongside, same era.
Diffusion distance for histogram comparison
Haibin Ling and Kazunori Okada · 2006
Cited alongside, same era.
Quantitative concentration inequalities for empirical measures on non-compact spaces
Franccois Bolley, Arnaud Guillin, and Cédric Villani · 2007
Iterative Bregman projections for regularized transportation problems
Jean-David Benamou, Guillaume Carlier, Marco Cuturi, Luca Nenna, and Gabriel Peyré · 2015
Later among the works it cites.
Optimal transport and Cournot-Nash equilibria
Adrien Blanchet and Guillaume Carlier · 2015
Later among the works it cites.
Distribution’s template estimate with Wasserstein metrics
Emmanuel Boissard, Thibaut Le Gouic, and Jean-Michel Loubes · 2015
Later among the works it cites.
Sliced and Radon Wasserstein barycenters of measures
Nicolas Bonneel, Julien Rabin, Gabriel Peyré, and Hanspeter Pfister · 2015
Later among the works it cites.
Numerical methods for matching for teams and Wasserstein barycenters
Guillaume Carlier, Adam Oberman, and Edouard Oudet · 2015
Later among the works it cites.
A finite-volume method for nonlinear nonlocal equations with a gradient flow structure
José A Carrillo, Alina Chertock, and Yanghong Huang · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A Douglas-Rachford splitting approach to nonsmooth convex variational signal recovery
Patrick L Combettes and Jean-Christophe Pesquet · 2007
Cited alongside, same era.
Kernels on structured objects through nested histograms
Marco Cuturi and Kenji Fukumizu · 2007
Cited alongside, same era.
A kernel method for the two-sample-problem
Arthur Gretton, Karsten M Borgwardt, Malte Rasch, Bernhard Schölkopf, and Alex J Smola · 2007
Cited alongside, same era.
An efficient earth mover’s distance algorithm for robust histogram comparison
Haibin Ling and Kazunori Okada · 2007
Cited alongside, same era.
A survey for the quadratic assignment problem
Eliane Maria Loiola, Nair Maria Maia de Abreu, Paulo Oswaldo Boaventura-Netto, Peter Hahn, and Tania Querido · 2007
Cited alongside, same era.
On the use of Gromov–Hausdorff distances for shape comparison
Facundo Mémoli · 2007
Cited alongside, same era.
Later among the works it cites.
Fast projection onto the simplex and the ℓ 1 \ell_{1} ball
Laurent Condat · 2015
Later among the works it cites.
Fisher information distance: a geometrical reading
Sueli IR Costa, Sandra A Santos, and João E Strapasson · 2015
Later among the works it cites.
Power particles: an incompressible fluid solver based on power diagrams
Fernando de Goes, Corentin Wallez, Jin Huang, Dmitry Pavlov, and Mathieu Desbrun · 2015
Later among the works it cites.
On the rate of convergence in Wasserstein distance of the empirical measure
Nicolas Fournier and Arnaud Guillin · 2015
Later among the works it cites.
Learning with a Wasserstein loss
Charlie Frogner, Chiyuan Zhang, Hossein Mobahi, Mauricio Araya, and Tomaso A Poggio · 2015
Later among the works it cites.
About the analogy between optimal transport and minimal entropy
Ivan Gentil, Christian Léonard, and Luigia Ripani · 2015
Later among the works it cites.
Positive contraction mappings for classical and quantum Schrödinger systems
Tryphon T Georgiou and Michele Pavon · 2015
Later among the works it cites.
Fast optimal transport averaging of neuroimaging data
Alexandre Gramfort, Gabriel Peyré, and Marco Cuturi · 2015
Later among the works it cites.
Optimal transportation with capacity constraints
Jonathan Korman and Robert McCann · 2015
Later among the works it cites.
From word embeddings to document distances
Matt Kusner, Yu Sun, Nicholas Kolkin, and Kilian Weinberger · 2015
Later among the works it cites.
A numerical algorithm for l 2 l^{2} semi-discrete optimal transport in 3d
Bruno Lévy · 2015
Later among the works it cites.
A generalized model for optimal transport of images including dissipation and density modulation
Jan Maas, Martin Rumpf, Carola Schönlieb, and Stefan Simon · 2015
Later among the works it cites.
Discretization of the 3D Monge-Ampere operator, between wide stencils and power diagrams
Jean-Marie Mirebeau · 2015
Later among the works it cites.
On matrix-valued Monge–Kantorovich optimal mass transport
Lipeng Ning, Tryphon T Georgiou, and Allen Tannenbaum · 2015
Later among the works it cites.
An efficient linear programming method for optimal transportation
Adam M Oberman and Yuanlong Ruan · 2015
Later among the works it cites.
Multi-marginal optimal transport: theory and applications
Brendan Pass · 2015
Later among the works it cites.
Entropic approximation of Wasserstein gradient flows
Gabriel Peyré · 2015
Later among the works it cites.
Convex color image segmentation with optimal transport distances
Julien Rabin and Nicolas Papadakis · 2015
Later among the works it cites.
Optimal transport for applied mathematicians
Filippo Santambrogio · 2015
Later among the works it cites.
Optimal transport for particle image velocimetry
Louis-Philippe Saumier, Boualem Khouider, and Martial Agueh · 2015
Later among the works it cites.
Principal geodesic analysis for probability measures under the optimal transport metric
Vivien Seguy and Marco Cuturi · 2015
Later among the works it cites.
Distributionally robust logistic regression
Soroosh Shafieezadeh Abadeh, Peyman Mohajerin Mohajerin Esfahani, and Daniel Kuhn · 2015
Later among the works it cites.
Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
Justin Solomon, Fernando De Goes, Gabriel Peyré, Marco Cuturi, Adrian Butscher, Andy Nguyen, Tao Du, and Leonidas Guibas · 2015
Later among the works it cites.
Optimal mass transport for shape matching and comparison
Zhengyu Su, Yalin Wang, Rui Shi, Wei Zeng, Jian Sun, Feng Luo, and Xianfeng Gu · 2015
Later among the works it cites.
Transport distances and geodesic convexity for systems of degenerate diffusion equations
Jonathan Zinsl and Daniel Matthes · 2015
Later among the works it cites.
Tensorflow: large-scale machine learning on heterogeneous distributed systems
Martín Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, et al · 2016
Later among the works it cites.
Theano: A python framework for fast computation of mathematical expressions
Rami Al-Rfou, Guillaume Alain, Amjad Almahairi, Christof Angermüller, Dzmitry Bahdanau, and Nicolas Ballas et al · 2016
Later among the works it cites.
A fixed-point approach to barycenters in Wasserstein space
Pedro C Álvarez-Esteban, E del Barrio, JA Cuesta-Albertos, and C Matrán · 2016
Later among the works it cites.
Discrete Wasserstein barycenters: optimal transport for discrete data
Ethan Anderes, Steffen Borgwardt, and Jacob Miller · 2016
Later among the works it cites.
Wasserstein barycentric coordinates: histogram regression using optimal transport
Nicolas Bonneel, Gabriel Peyré, and Marco Cuturi · 2016
Later among the works it cites.
Vector quantile regression beyond correct specification
Guillaume Carlier, Victor Chernozhukov, and Alfred Galichon · 2016
Later among the works it cites.
Constructing geodesics on the space of compact metric spaces
Samir Chowdhury and Facundo Mémoli · 2016
Later among the works it cites.
Optimal transport for data fusion in remote sensing
Nicolas Courty, Rémi Flamary, Devis Tuia, and Thomas Corpetti · 2016
Later among the works it cites.
A smoothed dual approach for variational Wasserstein problems
Marco Cuturi and Gabriel Peyré · 2016
Later among the works it cites.
Robust clustering tools based on optimal transportation
Eustasio del Barrio, JA Cuesta-Albertos, C Matrán, and A Mayo-Íscar · 2016
Later among the works it cites.
Estimating matching affinity matrix under low-rank constraints
Arnaud Dupuy, Alfred Galichon, and Yifei Sun · 2016
Later among the works it cites.
Optimal spectral transportation with application to music transcription
Rémi Flamary, Cédric Févotte, Nicolas Courty, and Valentin Emiya · 2016
Later among the works it cites.
Relating the Bures measure to the Cauchy two-matrix model
Peter J Forrester and Mario Kieburg · 2016
Later among the works it cites.
Optimal Transport Methods in Economics
Alfred Galichon · 2016
Later among the works it cites.
Stochastic optimization for large-scale optimal transport
Aude Genevay, Marco Cuturi, Gabriel Peyré, and Francis Bach · 2016
Later among the works it cites.
The Monge-Ampere Equation
Cristian E Gutiérrez · 2016
Later among the works it cites.
Learning population-level diffusions with generative RNNs
Tatsunori Hashimoto, David Gifford, and Tommi Jaakkola · 2016
Later among the works it cites.
Supervised word mover’s distance
Gao Huang, Chuan Guo, Matt J Kusner, Yu Sun, Fei Sha, and Kilian Q Weinberger · 2016
Later among the works it cites.
A review of matrix scaling and Sinkhorn’s normal form for matrices and positive maps
Martin Idel · 2016
Later among the works it cites.
Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transport
Johan Karlsson and Axel Ringh · 2016
Later among the works it cites.
A Newton algorithm for semi-discrete optimal transport
Jun Kitagawa, Quentin Mérigot, and Boris Thibert · 2016
Later among the works it cites.
Sliced Wasserstein kernels for probability distributions
Soheil Kolouri, Yang Zou, and Gustavo K Rohde · 2016
Later among the works it cites.
A new optimal transport distance on the space of finite Radon measures
Stanislav Kondratyev, Léonard Monsaingeon, and Dmitry Vofnikov · 2016
Later among the works it cites.
Existence and consistency of Wasserstein barycenters
Thibaut Le Gouic and Jean-Michel Loubes · 2016
Later among the works it cites.
Hölder–Lipschitz norms and their duals on spaces with semigroups, with applications to earth mover’s distance
William Leeb and Ronald Coifman · 2016
Later among the works it cites.
Optimal transport in competition with reaction: the Hellinger–Kantorovich distance and geodesic curves
Matthias Liero, Alexander Mielke, and Giuseppe Savaré · 2016
Later among the works it cites.
Graph matching: relax at your own risk
Vince Lyzinski, Donniell E Fishkind, Marcelo Fiori, Joshua T Vogelstein, Carey E Priebe, and Guillermo Sapiro · 2016
Later among the works it cites.
Generalized optimal transport with singular sources
Jan Maas, Martin Rumpf, and Stefan Simon · 2016
Later among the works it cites.
An optimal transport approach for seismic tomography: Application to 3D full waveform inversion
Ludovic Métivier, Romain Brossier, Quentin Merigot, Edouard Oudet, and Jean Virieux · 2016
Later among the works it cites.
Wasserstein training of restricted Boltzmann machines
Grégoire Montavon, Klaus-Robert Müller, and Marco Cuturi · 2016
Later among the works it cites.
Amplitude and phase variation of point processes
Victor M Panaretos and Yoav Zemel · 2016
Later among the works it cites.
Gromov-Wasserstein averaging of kernel and distance matrices
Gabriel Peyré, Marco Cuturi, and Justin Solomon · 2016
Later among the works it cites.
Fast dictionary learning with a smoothed Wasserstein loss
Antoine Rolet, Marco Cuturi, and Gabriel Peyré · 2016
Later among the works it cites.
Wasserstein loss for image synthesis and restoration
Guillaume Tartavel, Gabriel Peyré, and Yann Gousseau · 2016
Later among the works it cites.
Tomographic reconstruction from a few views: a multi-marginal optimal transport approach
Isabelle Abraham, Romain Abraham, Maıtine Bergounioux, and Guillaume Carlier · 2017
Later among the works it cites.
Vers un théorème de la limite centrale dans l’espace de Wasserstein?
Martial Agueh and Guillaume Carlier · 2017
Later among the works it cites.
Much faster algorithms for matrix scaling
Zeyuan Allen-Zhu, Yuanzhi Li, Rafael Oliveira, and Avi Wigderson · 2017
Later among the works it cites.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Jason Altschuler, Jonathan Weed, and Philippe Rigollet · 2017
Later among the works it cites.
Wasserstein generative adversarial networks
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Later among the works it cites.
Inference in generative models using the Wasserstein distance
Espen Bernton, Pierre E Jacob, Mathieu Gerber, and Christian P Robert · 2017
Later among the works it cites.
From optimal transport to generative modeling: the VEGAN cookbook
Olivier Bousquet, Sylvain Gelly, Ilya Tolstikhin, Carl-Johann Simon-Gabriel, and Bernhard Schoelkopf · 2017
Later among the works it cites.
Convergence of entropic schemes for optimal transport and gradient flows
Guillaume Carlier, Vincent Duval, Gabriel Peyré, and Bernhard Schmitzer · 2017
Later among the works it cites.
On the matrix Monge-Kantorovich problem
Yongxin Chen, Wilfrid Gangbo, Tryphon T Georgiou, and Allen Tannenbaum · 2017
Later among the works it cites.
Matrix scaling and balancing via box constrained Newton’s method and interior point methods
Michael B Cohen, Aleksander Madry, Dimitris Tsipras, and Adrian Vladu · 2017
Later among the works it cites.
Further and stronger analogy between sampling and optimization: Langevin monte carlo and gradient descent
Arnak Dalalyan · 2017
Later among the works it cites.
User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
Arnak S Dalalyan and Avetik G Karagulyan · 2017
Later among the works it cites.
Convex Optimization & Euclidean Distance Geometry
Jon Dattorro · 2017
Later among the works it cites.
Arnaud Dessein, Nicolas Papadakis, and Charles-Alban Deledalle · 2017
Later among the works it cites.
A tumor growth model of Hele-Shaw type as a gradient flow
Simone Di Marino and Lenaic Chizat · 2017
Later among the works it cites.
Quadratically-regularized optimal transport on graphs
Montacer Essid and Justin Solomon · 2017
Later among the works it cites.
Optimal transport for diffeomorphic registration
Jean Feydy, Benjamin Charlier, Francois-Xavier Vialard, and Gabriel Peyré · 2017
Later among the works it cites.
A lagrangian scheme à la brenier for the incompressible euler equations
Thomas O Gallouët and Quentin Mérigot · 2017
Later among the works it cites.
A JKO splitting scheme for Kantorovich–Fisher–Rao gradient flows
Thomas O Gallouët and Leonard Monsaingeon · 2017
Later among the works it cites.
GAN and VAE from an optimal transport point of view
Aude Genevay, Gabriel Peyré, and Marco Cuturi · 2017
Later among the works it cites.
Computational methods for martingale optimal transport problems
Gaoyue Guo and Jan Obloj · 2017
Later among the works it cites.
Optimal patch assignment for statistically constrained texture synthesis
Jorge Gutierrez, Julien Rabin, Bruno Galerne, and Thomas Hurtut · 2017
Later among the works it cites.
Multilevel clustering via wasserstein means
Nhat Ho, XuanLong Nguyen, Mikhail Yurochkin, Hung Hai Bui, Viet Huynh, and Dinh Phung · 2017
Later among the works it cites.
Optimal mass transport: signal processing and machine-learning applications
Soheil Kolouri, Se Rim Park, Matthew Thorpe, Dejan Slepcev, and Gustavo K Rohde · 2017
Later among the works it cites.
Multiscale nonrigid point cloud registration using rotation-invariant sliced-wasserstein distance via laplace–beltrami eigenmap
Rongjie Lai and Hongkai Zhao · 2017
Later among the works it cites.
Harmonic mappings valued in the Wasserstein space
Hugo Lavenant · 2017
Later among the works it cites.
Learning from uncertain curves: The 2-wasserstein metric for gaussian processes
Anton Mallasto and Aasa Feragen · 2017
Later among the works it cites.
A convergent lagrangian discretization for a nonlinear fourth-order equation
Daniel Matthes and Horst Osberger · 2017
Later among the works it cites.
Pressureless Euler equations with maximal density constraint: a time-splitting scheme
Bertrand Maury and Anthony Preux · 2017
Later among the works it cites.
Tsallis regularized optimal transport and ecological inference
Boris Muzellec, Richard Nock, Giorgio Patrini, and Frank Nielsen · 2017
Later among the works it cites.
Quantum entropic regularization of matrix-valued optimal transport
Gabriel Peyré, Lenaic Chizat, Francois-Xavier Vialard, and Justin Solomon · 2017
Later among the works it cites.
Pytorch library
Pytorch · 2017
Later among the works it cites.
On Wasserstein two-sample testing and related families of nonparametric tests
Aaditya Ramdas, Nicolás García Trillos, and Marco Cuturi · 2017
Later among the works it cites.
{ \{ Euclidean, metric, and Wasserstein } \} gradient flows: an overview
Filippo Santambrogio · 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
Geoffrey Schiebinger, Jian Shu, Marcin Tabaka, Brian Cleary, Vidya Subramanian, Aryeh Solomon, Siyan Liu, Stacie Lin, Peter Berube, Lia Lee, et al · 2017
Later among the works it cites.
A framework for Wasserstein-1-type metrics
Bernhard Schmitzer and Benedikt Wirth · 2017
Later among the works it cites.
Tensor balancing on statistical manifold
Mahito Sugiyama, Hiroyuki Nakahara, and Koji Tsuda · 2017
Later among the works it cites.
A transportation l p l^{p} distance for signal analysis
Matthew Thorpe, Serim Park, Soheil Kolouri, Gustavo K Rohde, and Dejan Slepčev · 2017
Later among the works it cites.
Jonathan Weed and Francis Bach · 2017
Later among the works it cites.
Information geometry connecting Wasserstein distance and Kullback-Leibler divergence via the entropy-relaxed transportation problem
Shun-ichi Amari, Ryo Karakida, and Masafumi Oizumi · 2018
Closest in time.
Snowflake universality of Wasserstein spaces
Alexandr Andoni, Assaf Naor, and Ofer Neiman · 2018
Closest in time.
Langevin Monte Carlo and JKO splitting
Espen Bernton · 2018
Closest in time.
On the bures-wasserstein distance between positive definite matrices
Rajendra Bhatia, Tanvi Jain, and Yongdo Lim · 2018
Closest in time.
Semidual regularized optimal transport
Marco Cuturi and Gabriel Peyré · 2018
Closest in time.
Regularized optimal transport and the rot mover’s distance
Arnaud Dessein, Nicolas Papadakis, and Jean-Luc Rouas · 2018
Closest in time.
Decentralize and randomize: Faster algorithm for wasserstein barycenters
Pavel Dvurechenskii, Darina Dvinskikh, Alexander Gasnikov, Cesar Uribe, and Angelia Nedich · 2018
Closest in time.
Computational optimal transport: Complexity by accelerated gradient descent is better than by sinkhorn’s algorithm
Pavel Dvurechensky, Alexander Gasnikov, and Alexey Kroshnin · 2018
Closest in time.
Data-driven distributionally robust optimization using the wasserstein metric: Performance guarantees and tractable reformulations
Peyman Mohajerin Esfahani and Daniel Kuhn · 2018
Closest in time.
Robust hypothesis testing using wasserstein uncertainty sets
RUI GAO, Liyan Xie, Yao Xie, and Huan Xu · 2018
Closest in time.
Learning generative models with Sinkhorn divergences
Aude Genevay, Gabriel Peyré, and Marco Cuturi · 2018
Closest in time.
Large scale computation of means and clusters for persistence diagrams using optimal transport
Theo Lacombe, Marco Cuturi, and Steve Oudot · 2018
Closest in time.
Minimax statistical learning with wasserstein distances
Jaeho Lee and Maxim Raginsky · 2018
Closest in time.
Notions of optimal transport theory and how to implement them on a computer
Bruno Lévy and Erica L Schwindt · 2018
Closest in time.
Optimal entropy-transport problems and a new hellinger–kantorovich distance between positive measures
Matthias Liero, Alexander Mielke, and Giuseppe Savaré · 2018
Closest in time.
Wasserstein riemannian geometry of positive-definite matrices
Luigi Malagò, Luigi Montrucchio, and Giovanni Pistone · 2018
Closest in time.
Light in power: a general and parameter-free algorithm for caustic design
Jocelyn Meyron, Quentin Mérigot, and Boris Thibert · 2018
Closest in time.
Generalizing point embeddings using the wasserstein space of elliptical distributions
Boris Muzellec and Marco Cuturi · 2018
Closest in time.
Improving GANs using optimal transport
Tim Salimans, Han Zhang, Alec Radford, and Dimitris Metaxas · 2018
Closest in time.
Crowd motion and population dynamics under density constraints
Filippo Santambrogio · 2018
Closest in time.
Large-scale optimal transport and mapping estimation
Vivien Seguy, Bharath Bhushan Damodaran, Rémi Flamary, Nicolas Courty, Antoine Rolet, and Mathieu Blondel · 2018
Closest in time.
Wasserstein distributionally robust kalman filtering
Soroosh Shafieezadeh Abadeh, Viet Anh Nguyen, Daniel Kuhn, and Peyman Mohajerin Mohajerin Esfahani · 2018
Closest in time.
Inference for empirical wasserstein distances on finite spaces
Max Sommerfeld and Axel Munk · 2018
Closest in time.
Measure-valued variational models with applications to diffusion-weighted imaging
Thomas Vogt and Jan Lellmann · 2018
Closest in time.
Fréchet means and procrustes analysis in wasserstein space
Yoav Zemel and Victor M Panaretos · 2018
Closest in time.
Towards optimal transport with global invariances
David Alvarez-Melis, Stefanie Jegelka, and Tommi S Jaakkola · 2019
Closest in time.
On the total variation Wasserstein gradient flow and the TV-JKO scheme
Guillaume Carlier and Clarice Poon · 2019
Closest in time.
Interpolating between optimal transport and mmd using sinkhorn divergences
Jean Feydy, Thibault Séjourné, Franccois-Xavier Vialard, Shun-Ichi Amari, Alain Trouvé, and Gabriel Peyré · 2019
Closest in time.
Sample complexity of sinkhorn divergences
Aude Genevay, Lénaic Chizat, Francis Bach, Marco Cuturi, and Gabriel Peyré · 2019
Closest in time.
Unsupervised alignment of embeddings with wasserstein procrustes
Edouard Grave, Armand Joulin, and Quentin Berthet · 2019
Closest in time.