The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Optimal Transport
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Since π c is continuous, the Kantorovich duality theorem holds (see, e.g., Villani 2009, Theorem 5.10).”
From Non-Discriminatory Personalized Pricing (2025) · cites this paper as Villani 2009
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Derivation of the Schrödinger Equation from Newtonian Mechanics
Nelson, E. (1966) · Physical Review · doi:10.1103/physrev.150.1079 · Cited by 1,725
Cited by
Domain Generalization: A Survey
Zhou, K., Liu, Z., Qiao, Y., Xiang, T., & Loy, C. C. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3195549 · Cited by 1,315
A Review on Generative Adversarial Networks: Algorithms, Theory, and Applications
Gui, J., Sun, Z., Wen, Y., Tao, D., & Ye, J. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3130191 · Cited by 1,231
Integrating single-cell and spatial transcriptomics to elucidate intercellular tissue dynamics
Longo, S. K., Guo, M. G., Ji, A. L., & Khavari, P. A. (2021) · Nature Reviews Genetics · doi:10.1038/s41576-021-00370-8 · Cited by 1,059
Optimal Transport for Domain Adaptation
Courty, N., Flamary, R., Tuia, D., & Rakotomamonjy, A. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2615921 · Cited by 989
Schiebinger, G., Shu, J., Tabaka, M., Cleary, B., Subramanian, V., Solomon, A., Gould, J., Liu, S., Lin, S., Berube, P., et al. (2019) · Cell · doi:10.1016/j.cell.2019.01.006 · Cited by 829
Bond-Taylor, S., Leach, A., Long, Y., & Willcocks, C. G. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3116668 · Cited by 703
Solving inverse problems using data-driven models
Arridge, S., Maass, P., Öktem, O., & Schönlieb, C.-B. (2019) · Acta Numerica · doi:10.1017/s0962492919000059 · Cited by 686
Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptation
Lee, C.-Y., Batra, T., Baig, M. H., & Ulbricht, D. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.01053 · Cited by 577
Deep learning for tomographic image reconstruction
Wang, G., Ye, J. C., & De Man, B. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-00273-z · Cited by 531
Li, B., Zhang, W., Guo, C., Xu, H., Li, L., Fang, M., Hu, Y., Zhang, X., Yao, X., Tang, M., et al. (2022) · Nature Methods · doi:10.1038/s41592-022-01480-9 · Cited by 459
On Wasserstein Two-Sample Testing and Related Families of Nonparametric Tests
Ramdas, A., Trillos, N., & Cuturi, M. (2017) · Entropy · doi:10.3390/e19020047 · Cited by 443
The physics of climate variability and climate change
Ghil, M., & Lucarini, V. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.035002 · Cited by 416
Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
Kudekar, S., Richardson, T., & Urbanke, R. L. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2280915 · Cited by 360
Scaling algorithms for unbalanced optimal transport problems
Chizat, L., Peyré, G., Schmitzer, B., & Vialard, F.-X. (2018) · Mathematics of Computation · doi:10.1090/mcom/3303 · Cited by 336
Oneto, L., & Chiappa, S. (2020) · Studies in Computational Intelligence · doi:10.1007/978-3-030-43883-8_7 · Cited by 291
Nitzan, M., Karaiskos, N., Friedman, N., & Rajewsky, N. (2019) · Nature · doi:10.1038/s41586-019-1773-3 · Cited by 284
Weed, J., & Bach, F. (2019) · Bernoulli · doi:10.3150/18-bej1065 · Cited by 275
Quant GANs: deep generation of financial time series
Wiese, M., Knobloch, R., Korn, R., & Kretschmer, P. (2020) · Quantitative Finance · doi:10.1080/14697688.2020.1730426 · Cited by 258
Learning single-cell perturbation responses using neural optimal transport
Bunne, C., Stark, S. G., Gut, G., del Castillo, J. S., Levesque, M., Lehmann, K.-V., Pelkmans, L., Krause, A., & Rätsch, G. (2023) · Nature Methods · doi:10.1038/s41592-023-01969-x · Cited by 202
Learning Deep Network Representations with Adversarially Regularized Autoencoders
Yu, W., Zheng, C., Cheng, W., Aggarwal, C. C., Song, D., Zong, B., Chen, H., & Wang, W. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220000 · Cited by 188
“(1) As shown in [36], Pn converges to P is equivalent to W (Pn ,P) → 0.”
BackgroundInfluentialThe Born supremacy: quantum advantage and training of an Ising Born machine
Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00288-9 · Cited by 155
“This problem of optimal transport has been widely studied, and has a rich history, so we refer to [75] for a thorough treatment.”
Mean-field models in swarm robotics: a survey
Elamvazhuthi, K., & Berman, S. (2019) · Bioinspiration & Biomimetics · doi:10.1088/1748-3190/ab49a4 · Cited by 110
Causal identification of single-cell experimental perturbation effects with CINEMA-OT
Dong, M., Wang, B., Wei, J., de O. Fonseca, A. H., Perry, C. J., Frey, A., Ouerghi, F., Foxman, E. F., Ishizuka, J. J., Dhodapkar, R. M., et al. (2023) · Nature Methods · doi:10.1038/s41592-023-02040-5 · Cited by 94
Assessing Algorithmic Fairness with Unobserved Protected Class Using Data Combination
Kallus, N., Mao, X., & Zhou, A. (2022) · Management Science · doi:10.1287/mnsc.2020.3850 · Cited by 93
Shekhar, K., Whitney, I. E., Butrus, S., Peng, Y.-R., & Sanes, J. R. (2022) · eLife · doi:10.7554/elife.73809 · Cited by 68
Trellis tree-based analysis reveals stromal regulation of patient-derived organoid drug responses
Ramos Zapatero, M., Tong, A., Opzoomer, J. W., O’Sullivan, R., Cardoso Rodriguez, F., Sufi, J., Vlckova, P., Nattress, C., Qin, X., Claus, J., et al. (2023) · Cell · doi:10.1016/j.cell.2023.11.005 · Cited by 72
Isolating salient variations of interest in single-cell data with contrastiveVI
Weinberger, E., Lin, C., & Lee, S.-I. (2023) · Nature Methods · doi:10.1038/s41592-023-01955-3 · Cited by 66
Binh, L. M., & Woo, S. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i1.19886 · Cited by 63
Self-Supervised Wasserstein Pseudo-Labeling for Semi-Supervised Image Classification
Taherkhani, F., Dabouei, A., Soleymani, S., Dawson, J., & Nasrabadi, N. M. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01209 · Cited by 45
A general approach to fairness with optimal transport
Silvia, C., Ray, J., Tom, S., Aldo, P., Heinrich, J., & John, A. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5771 · Cited by 43
“For simplicity of exposition we explain output and input transportation in the context of SDP and PSCF respectively, starting with some background on optimal transport theory (Villani 2009; Peyr´e and Cuturi 2019).”
MethodJiang, Q., Chen, S., Chen, X., & Jiang, R. (2024) · Bioinformatics · doi:10.1093/bioinformatics/btae265 · Cited by 29
“…for predicting perturbation responses in single-cell gene expression based on an attention mechanism (Vaswani et al. 2017). scPRAM leverages a VAE to encode the training set into a latent space, followed by optimal transport based on Sinkhorn algorithm (Villani 2009) to pair unpaired cells.”
MethodApproximate information state for partially observed systems
Subramanian, J., & Mahajan, A. (2019) · 2019 IEEE 58th Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029898 · Cited by 23
Cross-Hospital Sepsis Early Detection via Semi-Supervised Optimal Transport With Self-Paced Ensemble
Ding, R., Zhou, Y., Xu, J., Xie, Y., Liang, Q., Ren, H., Wang, Y., Chen, Y., Wang, L., & Huang, M. (2023) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2023.3253208 · Cited by 20
“To overcome the above difficulties, we propose a semisupervised transfer learning approach based on optimal transport [22] and self-paced ensemble [23] approach to complete cross-hospital Sepsis early detection.”
MethodAttacking mouse dynamics authentication using novel Wasserstein conditional DCGAN
Roy, A., Wong, K., & Phan, R. C.-W. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3245418 · Cited by 16
(2025) · doi:10.1038/s41467-025-58127-4 · Cited by 13
Non-Discriminatory Personalized Pricing
Strack, P., & Yang, K. H. (2025) · arXiv · doi:10.48550/arxiv.2506.20925 · Cited by 5
Metadata
- Authors
- Villani, C.
- Venue
- Grundlehren der mathematischen Wissenschaften
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- ISSN
- 0072-7830 (ISSN-L)
- OpenAlex
- W4233762729
- Cited by
- 3,669
- References
- 2
- FWCI
- 14.21
- Type
- book
- Language
- de
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.