Altschuler, Jason, Francis Bach, Alessandro Rudi, and Jonathan Niles-Weed. 2019.
“Massively Scalable Sinkhorn Distances via the Nyström Method.” In
Advances in Neural Information Processing Systems 32, 11. Curran Associates, Inc.
Ambrosio, Luigi, and Nicola Gigli. 2013.
“A User’s Guide to Optimal Transport.” In
Modelling and Optimisation of Flows on Networks: Cetraro, Italy 2009, Editors: Benedetto Piccoli, Michel Rascle, edited by Luigi Ambrosio, Alberto Bressan, Dirk Helbing, Axel Klar, and Enrique Zuazua, 1–155. Lecture Notes in Mathematics. Berlin, Heidelberg: Springer.
Ambrosio, Luigi, Nicola Gigli, and Giuseppe Savare. 2008.
Gradient Flows: In Metric Spaces and in the Space of Probability Measures. 2nd ed. Lectures in Mathematics. ETH Zürich. Birkhäuser Basel.
Angenent, Sigurd, Steven Haker, and Allen Tannenbaum. 2003.
“Minimizing Flows for the Monge-Kantorovich Problem.” SIAM Journal on Mathematical Analysis 35 (1): 61–97.
Arjovsky, Martin, Soumith Chintala, and Léon Bottou. 2017.
“Wasserstein Generative Adversarial Networks.” In
International Conference on Machine Learning, 214–23.
Arora, Sanjeev, Rong Ge, Yingyu Liang, Tengyu Ma, and Yi Zhang. 2017.
“Generalization and Equilibrium in Generative Adversarial Nets (GANs).” arXiv:1703.00573 [Cs], March.
Arras, Benjamin, Ehsan Azmoodeh, Guillaume Poly, and Yvik Swan. 2017.
“A Bound on the 2-Wasserstein Distance Between Linear Combinations of Independent Random Variables.” arXiv:1704.01376 [Math], April.
Bachem, Olivier, Mario Lucic, and Andreas Krause. 2017.
“Practical Coreset Constructions for Machine Learning.” arXiv Preprint arXiv:1703.06476.
Bion-Nadal, Jocelyne, and Denis Talay. 2019.
“On a Wasserstein-Type Distance Between Solutions to Stochastic Differential Equations.” The Annals of Applied Probability 29 (3).
Blanchet, Jose, Lin Chen, and Xun Yu Zhou. 2018.
“Distributionally Robust Mean-Variance Portfolio Selection with Wasserstein Distances.” arXiv:1802.04885 [Stat], February.
Blanchet, Jose, Arun Jambulapati, Carson Kent, and Aaron Sidford. 2018.
“Towards Optimal Running Times for Optimal Transport.” arXiv:1810.07717 [Cs], October.
Blanchet, Jose, Yang Kang, and Karthyek Murthy. 2016.
“Robust Wasserstein Profile Inference and Applications to Machine Learning.” arXiv:1610.05627 [Math, Stat], October.
Blanchet, Jose, Karthyek Murthy, and Nian Si. 2019.
“Confidence Regions in Wasserstein Distributionally Robust Estimation.” arXiv:1906.01614 [Math, Stat], June.
Bolley, François, Ivan Gentil, and Arnaud Guillin. 2012.
“Convergence to Equilibrium in Wasserstein Distance for Fokker–Planck Equations.” Journal of Functional Analysis 263 (8): 2430–57.
Bolley, François, and Cédric Villani. 2005.
“Weighted Csiszár-Kullback-Pinsker Inequalities and Applications to Transportation Inequalities.” Annales de La Faculté Des Sciences de Toulouse Mathématiques 14 (3): 331–52.
Canas, Guillermo D., and Lorenzo Rosasco. 2012.
“Learning Probability Measures with Respect to Optimal Transport Metrics.” arXiv:1209.1077 [Cs, Stat], September.
Carlier, Guillaume, Marco Cuturi, Brendan Pass, and Carola Schoenlieb. 2017. “Optimal Transport Meets Probability, Statistics and Machine Learning,” 9.
Champion, T., L. De Pascale, and P. Juutinen. 2008.
“The ∞-Wasserstein Distance: Local Solutions and Existence of Optimal Transport Maps.” SIAM Journal on Mathematical Analysis 40 (1): 1–20.
Chizat, Lénaïc, and Francis Bach. 2018.
“On the Global Convergence of Gradient Descent for over-Parameterized Models Using Optimal Transport.” In
Proceedings of the 32nd International Conference on Neural Information Processing Systems, 3040–50. NIPS’18. Red Hook, NY, USA: Curran Associates Inc.
Chizat, Lénaïc, Edouard Oyallon, and Francis Bach. 2018.
“On Lazy Training in Differentiable Programming.” arXiv:1812.07956 [Cs, Math], December.
Coscia, Michele. 2020. “Generalized Euclidean Measure to Estimate Network Distances,” 11.
Cuturi, Marco. 2013.
“Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances.” In
Advances in Neural Information Processing Systems 26.
Dowson, D. C., and B. V. Landau. 1982.
“The Fréchet Distance Between Multivariate Normal Distributions.” Journal of Multivariate Analysis 12 (3): 450–55.
Dudley, R. M. 2002. Real Analysis and Probability. Cambridge Studies in Advanced Mathematics 74. Cambridge ; New York: Cambridge University Press.
Fatras, Kilian, Younes Zine, Rémi Flamary, Remi Gribonval, and Nicolas Courty. 2020.
“Learning with Minibatch Wasserstein : Asymptotic and Gradient Properties.” In
Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, 2131–41. PMLR.
Fernholz, Luisa Turrin. 1983. von Mises calculus for statistical functionals. Lecture Notes in Statistics 19. New York: Springer.
Feydy, Jean, Thibault Séjourné, François-Xavier Vialard, Shun-ichi Amari, Alain Trouve, and Gabriel Peyré. 2019.
“Interpolating Between Optimal Transport and MMD Using Sinkhorn Divergences.” In
Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics, 2681–90. PMLR.
Frogner, Charlie, Chiyuan Zhang, Hossein Mobahi, Mauricio Araya, and Tomaso A Poggio. 2015.
“Learning with a Wasserstein Loss.” In
Advances in Neural Information Processing Systems 28, edited by C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, 2053–61. Curran Associates, Inc.
Givens, Clark R., and Rae Michael Shortt. 1984.
“A Class of Wasserstein Metrics for Probability Distributions.” The Michigan Mathematical Journal 31 (2): 231–40.
Gozlan, Nathael, and Christian Léonard. 2010.
“Transport Inequalities. A Survey.” arXiv:1003.3852 [Math], March.
Guo, Xin, Johnny Hong, Tianyi Lin, and Nan Yang. 2017.
“Relaxed Wasserstein with Applications to GANs.” arXiv:1705.07164 [Cs, Stat], May.
Henry-Labordère, Pierre. 2017. Model-Free Hedging: A Martingale Optimal Transport Viewpoint. Chapman and Hall CRC Financial Mathematics 1.0. CRC Press.
Huggins, Jonathan H., Trevor Campbell, Mikołaj Kasprzak, and Tamara Broderick. 2018a.
“Scalable Gaussian Process Inference with Finite-Data Mean and Variance Guarantees.” arXiv:1806.10234 [Cs, Stat], June.
Huggins, Jonathan, Ryan P Adams, and Tamara Broderick. 2017.
“PASS-GLM: Polynomial Approximate Sufficient Statistics for Scalable Bayesian GLM Inference.” In
Advances in Neural Information Processing Systems 30, edited by I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, 3611–21. Curran Associates, Inc.
Ji, Kaiyi, and Yingbin Liang. 2018.
“Minimax Estimation of Neural Net Distance,” November.
Khan, Gabriel, and Jun Zhang. 2022.
“When Optimal Transport Meets Information Geometry.” Information Geometry, June.
Kloeckner, Benoît R. 2021.
“Optimal Transportation and Stationary Measures for Iterated Function Systems.” Mathematical Proceedings of the Cambridge Philosophical Society, June, 1–25.
Knott, M., and C. S. Smith. 1984.
“On the Optimal Mapping of Distributions.” Journal of Optimization Theory and Applications 43 (1): 39–49.
Léonard, Christian. 2014.
“A Survey of the Schrödinger Problem and Some of Its Connections with Optimal Transport.” Discrete & Continuous Dynamical Systems - A 34 (4): 1533.
Liu, Huidong, Xianfeng Gu, and Dimitris Samaras. 2018.
“A Two-Step Computation of the Exact GAN Wasserstein Distance.” In
International Conference on Machine Learning, 3159–68.
Liu, Qiang, and Dilin Wang. 2019.
“Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithm.” In
Advances In Neural Information Processing Systems.
Mahdian, Saied, Jose Blanchet, and Peter Glynn. 2019.
“Optimal Transport Relaxations with Application to Wasserstein GANs.” arXiv:1906.03317 [Cs, Math, Stat], June.
Mallasto, Anton, Augusto Gerolin, and Hà Quang Minh. 2021.
“Entropy-Regularized 2-Wasserstein Distance Between Gaussian Measures.” Information Geometry, August.
Marzouk, Youssef, Tarek Moselhy, Matthew Parno, and Alessio Spantini. 2016.
“Sampling via Measure Transport: An Introduction.” In
Handbook of Uncertainty Quantification, edited by Roger Ghanem, David Higdon, and Houman Owhadi, 1:1–41. Cham: Springer International Publishing.
Maurya, Abhinav. 2018. “Optimal Transport in Statistical Machine Learning : Selected Review and Some Open Questions.” In.
Montavon, Grégoire, Klaus-Robert Müller, and Marco Cuturi. 2016.
“Wasserstein Training of Restricted Boltzmann Machines.” In
Advances in Neural Information Processing Systems 29, edited by D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett, 3711–19. Curran Associates, Inc.
Olkin, I., and F. Pukelsheim. 1982.
“The Distance Between Two Random Vectors with Given Dispersion Matrices.” Linear Algebra and Its Applications 48: 257–63.
Panaretos, Victor M., and Yoav Zemel. 2019.
“Statistical Aspects of Wasserstein Distances.” Annual Review of Statistics and Its Application 6 (1): 405–31.
———. 2020.
An Invitation to Statistics in Wasserstein Space. SpringerBriefs in Probability and Mathematical Statistics. Springer International Publishing.
Peyre, Gabriel. 2019. “Course Notes on Computational Optimal Transport,” 46.
Peyré, Gabriel, and Marco Cuturi. 2019.
Computational Optimal Transport. Vol. 11.
Piccoli, Benedetto, and Francesco Rossi. 2016.
“On Properties of the Generalized Wasserstein Distance.” Archive for Rational Mechanics and Analysis 222 (3): 1339–65.
Santambrogio, Filippo. 2015.
Optimal Transport for Applied Mathematicians. Edited by Filippo Santambrogio. Progress in Nonlinear Differential Equations and Their Applications. Cham: Springer International Publishing.
Singh, Shashank, and Barnabás Póczos. 2018.
“Minimax Distribution Estimation in Wasserstein Distance.” arXiv:1802.08855 [Cs, Math, Stat], February.
Solomon, Justin, Fernando de Goes, Gabriel Peyré, Marco Cuturi, Adrian Butscher, Andy Nguyen, Tao Du, and Leonidas Guibas. 2015.
“Convolutional Wasserstein Distances: Efficient Optimal Transportation on Geometric Domains.” ACM Transactions on Graphics 34 (4): 66:1–11.
Spantini, Alessio, Daniele Bigoni, and Youssef Marzouk. 2017.
“Inference via Low-Dimensional Couplings.” Journal of Machine Learning Research 19 (66): 2639–709.
Thorpe, Matthew. 2018. “Introduction to Optimal Transport,” 56.
Verdinelli, Isabella, and Larry Wasserman. 2019.
“Hybrid Wasserstein Distance and Fast Distribution Clustering.” Electronic Journal of Statistics 13 (2): 5088–5119.
Villani, Cédric. 2009.
Optimal Transport: Old and New. Grundlehren Der Mathematischen Wissenschaften. Berlin Heidelberg: Springer-Verlag.
Zemel, Yoav. 2012. “Optimal Transportation: Continuous and Discrete.”
Zhu, B., J. Jiao, and D. Tse. 2020.
“Deconstructing Generative Adversarial Networks.” IEEE Transactions on Information Theory 66 (11): 7155–79.
No comments yet. Why not leave one?