Fetching the paper…
Reading the bibliography…
Optimal transport (OT) theory focuses, among all maps $T:\mathbb{R}^d\rightarrow \mathbb{R}^d$ that can morph a probability measure onto another, on those that are the ``thriftiest'', i.e.
Computational optimal transport
Gabriel Peyré and Marco Cuturi · 1935
Earlier work this paper cites.
A relationship between arbitrary positive matrices and doubly stochastic matrices
Richard Sinkhorn · 1964
Earlier work this paper cites.
Weak convergence of probabilities on nonseparable metric spaces and empirical measures on euclidean spaces
Richard Mansfield Dudley et al · 1966
Earlier work this paper cites.
Geometric problems in the theory of infinite-dimensional probability distributions
Vladimir N Sudakov · 1979
Earlier work this paper cites.
Polar factorization and monotone rearrangement of vector-valued functions
Yann Brenier · 1991
Earlier work this paper cites.
Proximal minimization methods with generalized bregman functions
Krzysztof C Kiwiel · 1997
Earlier work this paper cites.
Differential equations methods for the Monge-Kantorovich mass transfer problem
Lawrence C Evans and Wilfrid Gangbo · 1999
Earlier work this paper cites.
On the monge mass transfer problem
Neil S Trudinger and Xu-Jia Wang · 2001
Earlier work this paper cites.
Existence and stability results in the l1 theory of optimal transportation
Luigi Ambrosio and Aldo Pratelli · 2003
Earlier work this paper cites.
Existence of optimal transport maps for crystalline norms
Luigi Ambrosio, Bernd Kirchheim, and Aldo Pratelli · 2004
Earlier work this paper cites.
Regularization and variable selection via the elastic net
Hui Zou and Trevor Hastie · 2005
Earlier work this paper cites.
Sided and symmetrized bregman centroids
Frank Nielsen and Richard Nock · 2009
Earlier work this paper cites.
A strategy for non-strictly convex transport costs and the example of ‖ x − y ‖ p \|x-y\|^{p} in r 2 r^{2}
Guillaume Carlier, Luigi De Pascale, and Filippo Santambrogio · 2010
Earlier work this paper cites.
A similarity measure for indefinite rankings
William Webber, Alistair Moffat, and Justin Zobel · 2010
Earlier work this paper cites.
Sparse prediction with the k-support norm
Andreas Argyriou, Rina Foygel, and Nathan Srebro · 2012
Earlier work this paper cites.
Optimization with sparsity-inducing penalties
Francis Bach, Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski, et al · 2012
Earlier work this paper cites.
Wasserstein barycenter and its application to texture mixing
Julien Rabin, Gabriel Peyré, Julie Delon, and Marc Bernot · 2012
Earlier work this paper cites.
Agglomerative bregman clustering
Matus Telgarsky and Sanjoy Dasgupta · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Earlier work this paper cites.
The decomposition of optimal transportation problems with convex cost
Stefano Bianchini and Mauro Bardelloni · 2014
Cited alongside, same era.
Fast computation of wasserstein barycenters
Marco Cuturi and Arnaud Doucet · 2014
Cited alongside, same era.
Sliced and radon wasserstein barycenters of measures
Nicolas Bonneel, Julien Rabin, Gabriel Peyré, and Hanspeter Pfister · 2015
Cited alongside, same era.
Statistical learning with sparsity
Trevor Hastie, Robert Tibshirani, and Martin Wainwright · 2015
Cited alongside, same era.
Optimal transport for applied mathematicians
Filippo Santambrogio · 2015
Cited alongside, same era.
A shrinkage-thresholding metropolis adjusted langevin algorithm for bayesian variable selection
Amandine Schreck, Gersende Fort, Sylvain Le Corff, and Eric Moulines · 2015
Tree-sliced variants of wasserstein distances
Tam Le, Makoto Yamada, Kenji Fukumizu, and Marco Cuturi · 2019
Later among the works it cites.
scgen predicts single-cell perturbation responses
Mohammad Lotfollahi, F. Alexander Wolf, and Fabian J. Theis · 2019
Later among the works it cites.
Subspace detours: Building transport plans that are optimal on subspace projections
Boris Muzellec and Marco Cuturi · 2019
Later among the works it cites.
Subspace robust wasserstein distances
François-Pierre Paty and Marco Cuturi · 2019
Later among the works it cites.
Computational optimal transport
Gabriel Peyré and Marco Cuturi · 2019
Later among the works it cites.
Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogramming
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Optimal transport for domain adaptation
Nicolas Courty, Rémi Flamary, Devis Tuia, and Alain Rakotomamonjy · 2016
Cited alongside, same era.
Wasserstein training of restricted boltzmann machines
Grégoire Montavon, Klaus-Robert Müller, and Marco Cuturi · 2016
Cited alongside, same era.
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Cited alongside, same era.
Joint distribution optimal transportation for domain adaptation
Nicolas Courty, Rémi Flamary, Amaury Habrard, and Alain Rakotomamonjy · 2017
Cited alongside, same era.
Smooth and sparse optimal transport
Mathieu Blondel, Vivien Seguy, and Antoine Rolet · 2018
Cited alongside, same era.
Regularized optimal transport and the rot mover’s distance
Arnaud Dessein, Nicolas Papadakis, and Jean-Luc Rouas · 2018
Cited alongside, same era.
Geoffrey Schiebinger, Jian Shu, Marcin Tabaka, Brian Cleary, Vidya Subramanian, Aryeh Solomon, Joshua Gould, Siyan Liu, Stacie Lin, Peter Berube, et al · 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.
Wasserstein-2 generative networks
Alexander Korotin, Vage Egiazarian, Arip Asadulaev, Alexander Safin, and Evgeny Burnaev · 2020
Later among the works it cites.
Projection robust wasserstein distance and riemannian optimization
Tianyi Lin, Chenyou Fan, Nhat Ho, Marco Cuturi, and Michael Jordan · 2020
Later among the works it cites.
Optimal transport mapping via input convex neural networks
Ashok Makkuva, Amirhossein Taghvaei, Sewoong Oh, and Jason Lee · 2020
Later among the works it cites.
Massively multiplex chemical transcriptomics at single-cell resolution
Sanjay R. Srivatsan, José L. McFaline-Figueroa, Vijay Ramani, Lauren Saunders, Junyue Cao, Jonathan Packer, Hannah A. Pliner, Dana L. Jackson, Riza M. Daza, Lena Christiansen, Fan Zhang, Frank Steemers, Jay Shendure, and Cole Trapnell · 2020
Later among the works it cites.
A riemannian block coordinate descent method for computing the projection robust wasserstein distance
Minhui Huang, Shiqian Ma, and Lifeng Lai · 2021
Later among the works it cites.
On projection robust optimal transport: Sample complexity and model misspecification
Tianyi Lin, Zeyu Zheng, Elynn Chen, Marco Cuturi, and Michael I Jordan · 2021
Later among the works it cites.
Entropic estimation of optimal transport maps
Aram-Alexandre Pooladian and Jonathan Niles-Weed · 2021
Later among the works it cites.
Optimal transport tools (ott): A jax toolbox for all things wasserstein
Marco Cuturi, Laetitia Meng-Papaxanthos, Yingtao Tian, Charlotte Bunne, Geoff Davis, and Olivier Teboul · 2022
Later among the works it cites.
Sparsity-constrained optimal transport
Tianlin Liu, Joan Puigcerver, and Mathieu Blondel · 2022
Later among the works it cites.
Estimation of wasserstein distances in the spiked transport model
Jonathan Niles-Weed and Philippe Rigollet · 2022
Later among the works it cites.
On the sample complexity of entropic optimal transport
Philippe Rigollet and Austin J Stromme · 2022
Later among the works it cites.