Fetching the paper…
Reading the bibliography…
The squared Wasserstein distance is a natural quantity to compare probability distributions in a non-parametric setting.
The approximate arithmetical solution by finite differences of physical problems involving differential equations, with an application to the stresses in a masonry dam
Lewis Fry Richardson · 1911
Earlier work this paper cites.
Iterative procedures for nonlinear integral equations
Donald G. Anderson · 1965
Earlier work this paper cites.
The speed of mean Glivenko–Cantelli convergence
Richard Mansfield Dudley · 1969
Earlier work this paper cites.
Survey of extrapolation processes in numerical analysis
D.C. Joyce · 1971
Earlier work this paper cites.
ε \varepsilon -entropy of convex sets and functions
E.M. Bronshtein · 1976
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.
The invisible hand algorithm: Solving the assignment problem with statistical physics
Jeffrey J. Kosowsky and Alan L. Yuille · 1994
Earlier work this paper cites.
Sur le transport de mesures périodiques
Dario Cordero-Erausquin · 1999
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.
Optimal transport: Old and New
Cédric Villani · 2008
Earlier work this paper cites.
A new class of transport distances between measures
Jean Dolbeault, Bruno Nazaret, and Giuseppe Savaré · 2009
Earlier work this paper cites.
The Wasserstein gradient flow of the Fisher information and the quantum drift-diffusion equation
Ugo Gianazza, Giuseppe Savaré, and Giuseppe Toscani · 2009
Earlier work this paper cites.
Displacement interpolation using Lagrangian mass transport
Nicolas Bonneel, Michiel Van De Panne, Sylvain Paris, and Wolfgang Heidrich · 2011
Earlier work this paper cites.
Transportation distances on the circle
Julien Rabin, Julie Delon, and Yann Gousseau · 2011
Earlier work this paper cites.
Wasserstein barycenter and its application to texture mixing
Julien Rabin, Gabriel Peyré, Julie Delon, and Marc Bernot · 2011
Earlier work this paper cites.
L 1 {L}_{1} covering numbers for uniformly bounded convex functions
Adityanand Guntuboyina and Bodhisattva Sen · 2012
Earlier work this paper cites.
The matrix cookbook, nov 2012
Kaare Brandt Petersen and Michael Syskind Pedersen · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Yurii Nesterov · 2013
Earlier work this paper cites.
On the mean speed of convergence of empirical and occupation measures in Wasserstein distance
Emmanuel Boissard and Thibaut Le Gouic · 2014
Earlier work this paper cites.
The Monge–Ampère equation and its link to optimal transportation
Guido De Philippis and Alessio Figalli · 2014
Earlier work this paper cites.
Optimal steering of a linear stochastic system to a final probability distribution, part i
Yongxin Chen, Tryphon T. Georgiou, and Michele Pavon · 2015
Cited alongside, same era.
On the rate of convergence in Wasserstein distance of the empirical measure
Nicolas Fournier and Arnaud Guillin · 2015
Cited alongside, same era.
Learning with a Wasserstein loss
Charlie Frogner, Chiyuan Zhang, Hossein Mobahi, Mauricio Araya, and Tomaso A. Poggio · 2015
Cited alongside, same era.
Optimal Transport for Applied Mathematicians
Filippo Santambrogio · 2015
Cited alongside, same era.
On the relation between optimal transport and Schrödinger bridges: A stochastic control viewpoint
Yongxin Chen, Tryphon T. Georgiou, and Michele Pavon · 2016
Cited alongside, same era.
Regularized nonlinear acceleration
Damien Scieur, Alexandre d’Aspremont, and Francis Bach · 2016
A formula for the time derivative of the entropic cost and applications
Giovanni Conforti and Luca Tamanini · 2019
Later among the works it cites.
Interpolating between optimal transport and MMD using Sinkhorn divergences
Jean Feydy, Thibault Séjourné, François-Xavier Vialard, Shun-ichi Amari, Alain Trouvé, and Gabriel Peyré · 2019
Later among the works it cites.
Sample complexity of Sinkhorn divergences
Aude Genevay, Lénaïc Chizat, Francis Bach, Marco Cuturi, and Gabriel Peyré · 2019
Later among the works it cites.
Minimax rates of estimation for smooth optimal transport maps
Jan-Christian Hütter and Philippe Rigollet · 2019
Later among the works it cites.
A graph theoretic additive approximation of optimal transport
Nathaniel Lahn, Deepika Mulchandani, and Sharath Raghvendra · 2019
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.
Much faster algorithms for matrix scaling
Zeyuan Allen-Zhu, Yuanzhi Li, Rafael Oliveira, and Avi Wigderson · 2017
Cited alongside, same era.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Jason Altschuler, Jonathan Niles-Weed, and Philippe Rigollet · 2017
Cited alongside, same era.
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
Cited alongside, same era.
About the analogy between optimal transport and minimal entropy
Ivan Gentil, Christian Léonard, and Luigia Ripani · 2017
Cited alongside, same era.
Learning in implicit generative models
Shakir Mohamed and Balaji Lakshminarayanan · 2017
Cited alongside, same era.
On Wasserstein two-sample testing and related families of nonparametric tests
Aaditya Ramdas, Nicolás García Trillos, and Marco Cuturi · 2017
Cited alongside, same era.
Tudor Manole, Sivaraman Balakrishnan, and Larry Wasserman · 2019
Later among the works it cites.
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
Gonzalo Mena and Jonathan Niles-Weed · 2019
Later among the works it cites.
Asymptotic guarantees for learning generative models with the Sliced-Wasserstein distance
Kimia Nadjahi, Alain Durmus, Umut Simsekli, and Roland Badeau · 2019
Later among the works it cites.
Estimation of Wasserstein distances in the spiked transport model
Jonathan Niles-Weed and Philippe Rigollet · 2019
Later among the works it cites.
Computational optimal transport
Gabriel Peyré and Marco Cuturi · 2019
Later among the works it cites.
Empirical optimal transport on countable metric spaces: Distributional limits and statistical applications
Carla Tameling, Max Sommerfeld, and Axel Munk · 2019
Later among the works it cites.
High-Dimensional Statistics: A Non-asymptotic Viewpoint
Martin J. Wainwright · 2019
Later among the works it cites.
Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
Jonathan Weed and Francis Bach · 2019
Later among the works it cites.
Estimation of smooth densities in Wasserstein distance
Jonathan Weed and Quentin Berthet · 2019
Later among the works it cites.
On the effectiveness of Richardson extrapolation in machine learning
Francis Bach · 2020
Closest in time.
The Sinkhorn algorithm, parabolic optimal transport and geometric Monge–Ampère equations
Robert J. Berman · 2020
Closest in time.
Benamou–Brenier and duality formulas for the entropic cost on R C D ∗ ( K , N ) RCD^{*}(K,N) spaces
Nicola Gigli and Luca Tamanini · 2020
Closest in time.
Entropic optimal transport between (unbalanced) Gaussian measures has a closed form
Hicham Janati, Boris Muzellec, Gabriel Peyré, and Marco Cuturi · 2020
Closest in time.
Entropy-regularized 2 2 -Wasserstein distance between Gaussian measures
Anton Mallasto, Augusto Gerolin, and Hà Quang Minh · 2020
Closest in time.
The use of entropy maximising models, in the theory of trip distribution, mode split and route split
Alan Geoffrey Wilson · 2020
Closest in time.