The DOI matches its Crossref record; 210 of the 210 references it cites were found in a registry or an index.
Computational Optimal Transport
Abstract
The goal of Optimal Transport (OT) is to define geometric tools that are useful to compare probability distributions. Their use dates back to 1781. Recent years have witnessed a new revolution in the spread of OT, thanks to the emergence of approximate solvers that can scale to sizes and dimensions that are relevant to data sciences. Thanks to this newfound scalability, OT is being increasingly used to unlock various problems in imaging sciences (such as color or texture processing), computer vision and graphics (for shape manipulation) or machine learning (for regression, classification and density fitting). This monograph reviews OT with a bias toward numerical methods and their applications in data sciences, and sheds lights on the theoretical properties of OT that make it particularly useful for some of these applications. Computational Optimal Transport presents an overview of the main theoretical insights that support the practical effectiveness of OT before explaining how to turn these insights into fast computational schemes. Written for readers at all levels, the authors provide descriptions of foundational theory at two-levels. Generally accessible to all readers, more advanced readers can read the specially identified more general mathematical expositions of optimal transport tailored for discrete measures. Furthermore, several chapters deal with the interplay between continuous and discrete measures, and are thus targeting a more mathematically-inclined audience. This monograph will be a valuable reference for researchers and students wishing to get a thorough understanding of Computational Optimal Transport, a mathematical gem at the interface of probability, analysis and optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Items 201–210 of 210
Learning Population-Level Diffusions with Generative RNNs
Hashimoto, T., Gifford, D. K., & Jaakkola, T. (2016) · International Conference on Machine Learning · Cited by 33
The Tangent Earth Mover’s Distance
Pele, O., & Taskar, B. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40020-9_43 · Cited by 29
Dirichlet Energy for Analysis and Synthesis of Soft Maps
Solomon, J., Guibas, L. J., & Butscher, A. (2013) · Computer Graphics Forum · doi:10.1111/cgf.12186 · Cited by 27
A tumor growth model of Hele-Shaw type as a gradient flow
Marino, S. D., & Chizat, L. (2020) · ESAIM Control Optimisation and Calculus of Variations · doi:10.1051/cocv/2020019 · Cited by 24
On the Application of the Monge–Kantorovich Problem to Image Registration
Museyko, O., Stiglmayr, M., Klamroth, K., & Leugering, G. R. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080721522 · Cited by 23
Leeb, W., & Coifman, R. R. (2015) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-015-9439-5 · Cited by 22
Modelling Convex Shape Priors and Matching Based on the Gromov-Wasserstein Distance
Schmitzer, B., & Schnörr, C. (2012) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-012-0375-6 · Cited by 21
A JKO splitting scheme for Kantorovich-Fisher-Rao gradient flowsPreprint
Gallouët, T., & Monsaingeon, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.04457 · Cited by 21
Optimal Patch Assignment for Statistically Constrained Texture Synthesis
Gutierrez, J., Rabin, J., Galerne, B., & Hurtut, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-58771-4_14 · Cited by 20
Efficient Bayesian inference methods via convex optimization and optimal transport
Kim, S., Ma, R., Mesa, D., & Coleman, T. P. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620628 · Cited by 19
Cited by
SuperGlue: Learning Feature Matching With Graph Neural Networks
Sarlin, P.-E., DeTone, D., Malisiewicz, T., & Rabinovich, A. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00499 · Cited by 2,830
UNITER: UNiversal Image-TExt Representation Learning
Chen, Y.-C., Li, L., Yu, L., El Kholy, A., Ahmed, F., Gan, Z., Cheng, Y., & Liu, J. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58577-8_7 · Cited by 2,055
Deep Closest Point: Learning Representations for Point Cloud Registration
Wang, Y., & Solomon, J. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00362 · Cited by 1,112
LightGlue: Local Feature Matching at Light Speed
Lindenberger, P., Sarlin, P.-E., & Pollefeys, M. (2023) · 2023 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.01616 · Cited by 943
Statistical Aspects of Wasserstein Distances
Panaretos, V. M., & Zemel, Y. (2019) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-030718-104938 · Cited by 857
Metadata
- Authors
- Peyré, G., & Cuturi, M.
- Venue
- now publishers, Inc. eBooks
- Publisher
- now Publishers Inc
- Published
- 2019
- OpenAlex
- W2793477525
- Cited by
- 847
- References
- 210
- FWCI
- 77.77
- Type
- book
- Language
- en
- Open access
- closed
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.