Fetching the paper…
Reading the bibliography…
We develop a computationally tractable method for estimating the optimal map between two distributions over $\mathbb{R}^d$ with rigorous finite-sample guarantees.
On the translocation of masses
Kantorovitch, L · 1942
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
Sinkhorn, R · 1967
Earlier work this paper cites.
I I -divergence geometry of probability distributions and minimization problems
Csiszár, I · 1975
Earlier work this paper cites.
Polar factorization and monotone rearrangement of vector-valued functions
Brenier, Y · 1991
Earlier work this paper cites.
The regularity of mappings with a convex potential
Caffarelli, L. A · 1992
Earlier work this paper cites.
Weak convergence and empirical processes
van der Vaart, A. W. and Wellner, J. A · 1996
Earlier work this paper cites.
Exponential integrability and transportation cost related to logarithmic Sobolev inequalities
Bobkov, S. G. and Götze, F · 1999
Earlier work this paper cites.
A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
Benamou, J.-D. and Brenier, Y · 2000
Earlier work this paper cites.
An alternative point of view on lepski’s method
Birgé, L · 2001
Earlier work this paper cites.
Distance-based classification with Lipschitz functions
von Luxburg, U. and Bousquet, O · 2003
Earlier work this paper cites.
Introduction to nonparametric estimation
Tsybakov, A. B · 2004
Earlier work this paper cites.
Gradient flows in metric spaces and in the space of probability measures
Ambrosio, L., Gigli, N., and Savaré, G · 2008
Earlier work this paper cites.
Optimal transport: old and new , volume 338
Villani, C · 2008
Earlier work this paper cites.
Interpolation theory , volume 9
Lunardi, A · 2009
Earlier work this paper cites.
An optimal transportation approach for nuclear structure-based pathology
Wang, W., Ozolek, J. A., Slepčev, D., Lee, A. B., Chen, C., and Rohde, G. K · 2010
Earlier work this paper cites.
On Hölder continuity-in-time of the optimal transport map towards measures along a curve
Gigli, N · 2011
Earlier work this paper cites.
From the Schrödinger problem to the Monge-Kantorovich problem
Léonard, C · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M · 2013
Earlier work this paper cites.
Domain adaptation with regularized optimal transport
Courty, N., Flamary, R., and Tuia, D · 2014
Earlier work this paper cites.
Optimal transport for applied mathematicians , volume 87 of Progress in Nonlinear Differential Equations and their Applications
Santambrogio, F · 2015
Earlier work this paper cites.
Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains
Solomon, J., De Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., and Guibas, L · 2015
Earlier work this paper cites.
Vector quantile regression: an optimal transport approach
Carlier, G., Chernozhukov, V., and Galichon, A · 2016
Earlier work this paper cites.
Stochastic optimization for large-scale optimal transport
Genevay, A., Cuturi, M., Peyré, G., and Bach, F. R · 2016
Cited alongside, same era.
Mathematical foundations of infinite-dimensional statistical models
Giné, E. and Nickl, R · 2016
Cited alongside, same era.
Entropic metric alignment for correspondence problems
Solomon, J., Peyré, G., Kim, V. G., and Sra, S · 2016
Cited alongside, same era.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Altschuler, J., Weed, J., and Rigollet, P · 2017
Cited alongside, same era.
Arjovsky, M., Chintala, S., and Bottou, L · 2017
Cited alongside, same era.
Convergence of entropic schemes for optimal transport and gradient flows
Faster Wasserstein distance estimation with the sinkhorn divergence
Chizat, L., Roussillon, P., Léger, F., Vialard, F.-X., and Peyré, G · 2020
Later among the works it cites.
Fast geometric learning with symbolic matrices
Feydy, J., Glaunès, J., Charlier, B., and Bronstein, M · 2020
Later among the works it cites.
Learning normalizing flows from entropy-kantorovich potentials
Finlay, C., Gerolin, A., Oberman, A. M., and Pooladian, A.-A · 2020
Later among the works it cites.
Empirical regularized optimal transport: Statistical theory and applications
Klatt, M., Tameling, C., and Munk, A · 2020
Later among the works it cites.
Optimal transport mapping via input convex neural networks
Makkuva, A., Taghvaei, A., Oh, S., and Lee, J · 2020
Later among the works it cites.
Predicting cell lineages using autoencoders and optimal transport
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Carlier, G., Duval, V., Peyré, G., and Schmitzer, B · 2017
Cited alongside, same era.
Monge–Kantorovich depth, quantiles, ranks and signs
Chernozhukov, V., Galichon, A., Hallin, M., and Henry, M · 2017
Cited alongside, same era.
Optimal transport for domain adaptation
Courty, N., Flamary, R., Tuia, D., and Rakotomamonjy, A · 2017
Cited alongside, same era.
Optimal transport for diffeomorphic registration
Feydy, J., Charlier, B., Vialard, F.-X., and Peyré, G · 2017
Cited alongside, same era.
Notes on adaptive estimation with lepski’s method
Hütter, J.-C. and Mao, C · 2017
Cited alongside, same era.
Dvurechensky, P., Gasnikov, A., and Kroshnin, A · 2018
Cited alongside, same era.
Learning generative models with sinkhorn divergences
Genevay, A., Peyré, G., and Cuturi, M · 2018
Cited alongside, same era.
Yang, K. D., Damodaran, K., Venkatachalapathy, S., Soylemezoglu, A. C., Shivashankar, G., and Uhler, C · 2020
Later among the works it cites.
Asymptotics for semi-discrete entropic optimal transport
Altschuler, J. M., Niles-Weed, J., and Stromme, A. J · 2021
Closest in time.
Entropic optimal transport: geometry and large deviations
Bernton, E., Ghosal, P., and Nutz, M · 2021
Closest in time.
A formula for the time derivative of the entropic cost and applications
Conforti, G. and Tamanini, L · 2021
Closest in time.
Rates of estimation of optimal transport maps using plug-in estimators via barycentric projections
Deb, N., Ghosal, P., and Sen, B · 2021
Closest in time.
Pot: Python optimal transport
Flamary, R., Courty, N., Gramfort, A., Alaya, M. Z., Boisbunon, A., Chambon, S., Chapel, L., Corenflos, A., Fatras, K., Fournier, N., Gautheron, L., Gayraud, N. T., Janati, H., Rakotomamonjy, A., Redko, I., Rolet, A., Schutz, A., Seguy, V., Sutherland, D. J., Tavenard, R., Tong, A., and Vayer, T · 2021
Closest in time.
Stability of entropic optimal transport and schrödinger bridges
Ghosal, P., Nutz, M., and Bernton, E · 2021
Closest in time.
Distribution and quantile functions, ranks and signs in dimension d: A measure transportation approach
Hallin, M., Del Barrio, E., Cuesta-Albertos, J., and Matrán, C · 2021
Closest in time.
Convex potential flows: Universal probability distributions with optimal transport and convex optimization
Huang, C.-W., Chen, R. T. Q., Tsirigotis, C., and Courville, A · 2021
Closest in time.
Limit distributions and sensitivity analysis for entropic optimal transport on countable spaces
Hundrieser, S., Klatt, M., and Munk, A · 2021
Closest in time.
Minimax estimation of smooth optimal transport maps
Hütter, J.-C. and Rigollet, P · 2021
Closest in time.
Plugin estimation of smooth optimal transport maps
Manole, T., Balakrishnan, S., Niles-Weed, J., and Wasserman, L · 2021
Closest in time.
Multivariate rank via entropic optimal transport: sample efficiency and generative modeling
Masud, S. B., Werenski, M., Murphy, J. M., and Aeron, S · 2021
Closest in time.
Near-optimal estimation of smooth transport maps with kernel sums-of-squares
Muzellec, B., Vacher, A., Bach, F., Vialard, F.-X., and Rudi, A · 2021
Closest in time.
Entropic optimal transport: Convergence of potentials
Nutz, M. and Wiesel, J · 2021
Closest in time.
Ot-flow: Fast and accurate continuous normalizing flows via optimal transport
Onken, D., Fung, S. W., Li, X., and Ruthotto, L · 2021
Closest in time.
On the sample complexity of entropic optimal transport
Rigollet, P. and Stromme, A. J · 2022
Closest in time.