Fetching the paper…
Reading the bibliography…
Monge map refers to the optimal transport map between two probability distributions and provides a principled approach to transform one distribution to another.
Theory of maxima and the method of lagrange
Afriat, S. (1971) · 1971
Earlier work this paper cites.
Near-linear time approximation algorithms for optimal transport via sinkhorn iteration
Altschuler, J., Niles-Weed, J., and Rigollet, P. (2017) · 1974
Earlier work this paper cites.
The (dantzig) simplex method for linear programming
Nash, J. C. (2000) · 2000
Earlier work this paper cites.
Learning stochastic behaviour of aggregate data
Ma, S., Liu, S., Zha, H., and Zhou, H. (2020) · 2002
Earlier work this paper cites.
Topics in optimal transportation
Villani, C. (2003) · 2003
Earlier work this paper cites.
The mnist database of handwritten digits
LeCun, Y. and Cortes, C. (2005) · 2005
Earlier work this paper cites.
Multi-marginal optimal transport and probabilistic graphical models
Haasler, I., Singh, R., Zhang, Q., Karlsson, J., and Chen, Y. (2020) · 2006
Earlier work this paper cites.
Scalable computations of wasserstein barycenter via input convex neural networks
Fan, J., Taghvaei, A., and Chen, Y. (2020) · 2007
Earlier work this paper cites.
Optimal transport: old and new
Villani, C. (2008) · 2008
Earlier work this paper cites.
Improving neural networks by preventing co-adaptation of feature detectors
Hinton, G. E., Srivastava, N., Krizhevsky, A., Sutskever, I., and Salakhutdinov, R. R. (2012) · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M. (2013) · 2013
Earlier work this paper cites.
Adam: A method for stochastic optimization
Kingma, D. P. and Ba, J. (2014) · 2014
Earlier work this paper cites.
Taking advantage of the improved availability of census data: A first look at the gridded population of the world, version 4
Doxsey-Whitfield, E., MacManus, K., Adamo, S. B., Pistolesi, L., Squires, J., Borkovska, O., and Baptista, S. R. (2015) · 2015
Earlier work this paper cites.
Deep learning face attributes in the wild
Liu, Z., Luo, P., Wang, X., and Tang, X. (2015) · 2015
Earlier work this paper cites.
Optimal transport for domain adaptation
Courty, N., Flamary, R., Tuia, D., and Rakotomamonjy, A. (2016) · 2016
Earlier work this paper cites.
Stochastic optimization for large-scale optimal transport
Genevay, A., Cuturi, M., Peyré, G., and Bach, F. (2016) · 2016
Earlier work this paper cites.
Mapping estimation for discrete optimal transport
Perrot, M., Courty, N., Flamary, R., and Habrard, A. (2016) · 2016
Earlier work this paper cites.
Input convex neural networks
Amos, B., Xu, L., and Kolter, J. (2017) · 2017
Earlier work this paper cites.
Arjovsky, M., Chintala, S., and Bottou, L. (2017) · 2017
Earlier work this paper cites.
Joint distribution optimal transportation for domain adaptation
Courty, N., Flamary, R., Habrard, A., and Rakotomamonjy, A. (2017) · 2017
Cited alongside, same era.
Improved training of wasserstein gans
Gulrajani, I., Ahmed, F., Arjovsky, M., Dumoulin, V., and Courville, A. C. (2017) · 2017
Cited alongside, same era.
Gans trained by a two time-scale update rule converge to a local nash equilibrium
Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., and Hochreiter, S. (2017) · 2017
Cited alongside, same era.
Large-scale optimal transport and mapping estimation
Seguy, V., Damodaran, B., Flamary, R., Courty, N., R., A., and Blondel, M. (2017) · 2017
Cited alongside, same era.
Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms
Xiao, H., Rasul, K., and Vollgraf, R. (2017) · 2017
Cited alongside, same era.
High-fidelity performance metrics for generative models in pytorch
Obukhov, A., Seitzer, M., Wu, P.-W., Zhydenko, S., Kyl, J., and Lin, E. Y.-J. (2020) · 2020
Later among the works it cites.
A fast proximal point method for computing exact wasserstein distance
Xie, Y., Wang, X., Wang, R., and Zha, H. (2020) · 2020
Later among the works it cites.
Optimizing functionals on the space of probabilities with input convex neural networks
Alvarez-Melis, D., Schiff, Y., and Mroueh, Y. (2021) · 2021
Closest in time.
Jkonet: Proximal optimal transport modeling of population dynamics
Bunne, C., Meng-Papaxanthos, L., Krause, A., and Cuturi, M. (2021) · 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) · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Deep learning for classical japanese literature
Clanuwat, T., Bober-Irizar, M., Kitamoto, A., Lamb, A., Yamamoto, K., and Ha, D. (2018) · 2018
Cited alongside, same era.
Learning generative models with sinkhorn divergences
Genevay, A., Peyré, G., and Cuturi, M. (2018) · 2018
Cited alongside, same era.
Distributed optimal transport for the deployment of swarms
Krishnan, V. and Martínez, S. (2018) · 2018
Cited alongside, same era.
cgans with projection discriminator
Miyato, T. and Koyama, M. (2018) · 2018
Cited alongside, same era.
Scalable unbalanced optimal transport using generative adversarial networks
Yang, K. D. and Uhler, C. (2018) · 2018
Cited alongside, same era.
Learning to match via inverse optimal transport
Li, R., Ye, X., Zhou, H., and Zha, H. (2019) · 2019
Cited alongside, same era.
Wasserstein gan with quadratic transport cost
Liu, H., Gu, X., and Samaras, D. (2019) · 2019
Cited alongside, same era.
Closest in time.
Large-scale wasserstein gradient flows
Mokrov, P., Korotin, A., Li, L., Genevay, A., Solomon, J., and Burnaev, E. (2021) · 2021
Closest in time.
Entropic estimation of optimal transport maps
Pooladian, A.-A. and Niles-Weed, J. (2021) · 2021
Closest in time.
Learning transferable visual models from natural language supervision
Radford, A., Kim, J. W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al. (2021) · 2021
Closest in time.
Zero-shot text-to-image generation
Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., and Sutskever, I. (2021) · 2021
Closest in time.
Cr-fill: Generative image inpainting with auxiliary contextual reconstruction
Zeng, Y., Lin, Z., Lu, H., and Patel, V. M. (2021) · 2021
Closest in time.
Meta optimal transport
Amos, B., Cohen, S., Luise, G., and Redko, I. (2022) · 2022
Closest in time.
Neural optimal transport with general cost functionals
Asadulaev, A., Korotin, A., Egiazarian, V., and Burnaev, E. (2022) · 2022
Closest in time.
Supervised training of conditional monge maps
Bunne, C., Krause, A., and Cuturi, M. (2022) · 2022
Closest in time.
Unpaired image super-resolution with optimal transport maps
Gazdieva, M., Rout, L., Korotin, A., Filippov, A., and Burnaev, E. (2022) · 2022
Closest in time.
Spinalnet: Deep neural network with gradual input
Kabir, H. D., Abdar, M., Khosravi, A., Jalali, S. M. J., Atiya, A. F., Nahavandi, S., and Srinivasan, D. (2022) · 2022
Closest in time.
Hierarchical text-conditional image generation with clip latents
Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., and Chen, M. (2022) · 2022
Closest in time.
Generative modeling with optimal transport maps
Rout, L., Korotin, A., and Burnaev, E. (2022) · 2022
Closest in time.
Photorealistic text-to-image diffusion models with deep language understanding
Saharia, C., Chan, W., Saxena, S., Li, L., Whang, J., Denton, E., Ghasemipour, S. K. S., Ayan, B. K., Mahdavi, S. S., Lopes, R. G., et al. (2022) · 2022
Closest in time.