Fetching the paper…
Reading the bibliography…
This paper presents a novel two-step approach for the fundamental problem of learning an optimal map from one distribution to another.
On the translocation of masses
Leonid Vitalievich Kantorovich · 1942
Earlier work this paper cites.
Three observations on linear algebra
Garrett Birkhoff · 1946
Earlier work this paper cites.
Polar factorization and monotone rearrangement of vector-valued functions
Yann Brenier · 1991
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.
Gradient-based learning applied to document recognition
Y. Lecun, L. Bottou, Y. Bengio, and P. Haffner · 1998
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.
A computational fluid mechanics solution to the monge-kantorovich mass transfer problem
Jean-David Benamou and Yann Brenier · 2000
Earlier work this paper cites.
Color transfer between images
Erik Reinhard, Michael Adhikhmin, Bruce Gooch, and Peter Shirley · 2001
Earlier work this paper cites.
Gradient flows: in metric spaces and in the space of probability measures
Luigi Ambrosio, Nicola Gigli, and Giuseppe Savaré · 2006
Earlier work this paper cites.
Automated colour grading using colour distribution transfer
François Pitié, Anil C Kokaram, and Rozenn Dahyot · 2007
Earlier work this paper cites.
Optimal transport: old and new , volume 338
Cédric Villani · 2008
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
A theory of learning from different domains
Shai Ben-David, John Blitzer, Koby Crammer, Alex Kulesza, Fernando Pereira, and Jennifer Wortman Vaughan · 2010
Earlier work this paper cites.
Generalized assorted pixel camera: postcapture control of resolution, dynamic range, and spectrum
Fumihito Yasuma, Tomoo Mitsunaga, Daisuke Iso, and Shree K Nayar · 2010
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.
Domain adaptation for object recognition: An unsupervised approach
Raghuraman Gopalan, Ruonan Li, and Rama Chellappa · 2011
Earlier work this paper cites.
A multiscale approach to optimal transport
Quentin Mérigot · 2011
Cited alongside, same era.
Reading Digits in Natural Images with Unsupervised Feature Learning
Yuval Netzer, Tao Wang, Adam Coates, Alessandro Bissacco, Bo Wu, and Andrew Y. Ng · 2011
Cited alongside, same era.
A dynamical systems framework for intermittent data assimilation
Sebastian Reich · 2011
Cited alongside, same era.
Optimal transportation and economic applications
Guillaume Carlier · 2012
Cited alongside, same era.
Bayesian inference with optimal maps
Tarek A. El Moselhy and Youssef M. Marzouk · 2012
Cited alongside, same era.
On the empirical estimation of integral probability metrics
Bharath K Sriperumbudur, Kenji Fukumizu, Arthur Gretton, Bernhard Schölkopf, Gert RG Lanckriet, et al · 2012
Cited alongside, same era.
Earth mover’s distances on discrete surfaces
Justin Solomon, Raif Rustamov, Leonidas Guibas, and Adrian Butscher · 2014
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.
Generative moment matching networks
Yujia Li, Kevin Swersky, and Rich Zemel · 2015
Later among the works it cites.
Wasserstein training of boltzmann machines
Grégoire Montavon, Klaus-Robert Müller, and Marco Cuturi · 2015
Later among the works it cites.
Principal geodesic analysis for probability measures under the optimal transport metric
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Cited alongside, same era.
Auto-encoding variational bayes
Diederik P Kingma and Max Welling · 2013
Cited alongside, same era.
Transfer feature learning with joint distribution adaptation
Mingsheng Long, Jianmin Wang, Guiguang Ding, Jiaguang Sun, and Philip S Yu · 2013
Cited alongside, same era.
A nonparametric ensemble transform method for bayesian inference
Sebastian Reich · 2013
Cited alongside, same era.
A linear optimal transportation framework for quantifying and visualizing variations in sets of images
Wei Wang, Dejan Slepčev, Saurav Basu, John A Ozolek, and Gustavo K Rohde · 2013
Cited alongside, same era.
On the mean speed of convergence of empirical and occupation measures in wasserstein distance
Emmanuel Boissard, Thibaut Le Gouic, et al · 2014
Cited alongside, same era.
Vivien Seguy and Marco Cuturi · 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.
Regularized optimal transport and the rot mover’s distance
Arnaud Dessein, Nicolas Papadakis, and Jean-Luc Rouas · 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.
Mapping Estimation for Discrete Optimal Transport
Michaël Perrot, Nicolas Courty, Rémi Flamary, and Amaury Habrard · 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 generative adversarial networks
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Closest in time.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2017
Closest in time.
Smooth and sparse optimal transport
Mathieu Blondel, Vivien Seguy, and Antoine Rolet · 2018
Closest in time.
Blind source separation with optimal transport non-negative matrix factorization
Antoine Rolet, Vivien Seguy, Mathieu Blondel, and Hiroshi Sawada · 2018
Closest in time.