The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Unbalanced optimal transport: Dynamic and Kantorovich formulations
Open accessAbstract
This article presents a new class of distances between arbitrary nonnegative Radon measures inspired by optimal transport. These distances are defined by two equivalent alternative formulations: (i) a dynamic formulation defining the distance as a geodesic distance over the space of measures (ii) a static “Kantorovich” formulation where the distance is the minimum of an optimization problem over pairs of couplings describing the transfer (transport, creation and destruction) of mass between two measures. Both formulations are convex optimization problems, and the ability to switch from one to the other depending on the targeted application is a crucial property of our models. Of particular interest is the Wasserstein–Fisher–Rao metric recently introduced independently by [7] , [15] . Defined initially through a dynamic formulation, it belongs to this class of metrics and hence automatically benefits from a static Kantorovich formulation.
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
Functions of Bounded Variation and Free Discontinuity Problems
Ambrosio, L., Fusco, N., & Pallara, D. (2000) · doi:10.1093/oso/9780198502456.001.0001 · Cited by 4,318
A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
Benamou, J.-D., & Brenier, Y. (2000) · Numerische Mathematik · doi:10.1007/s002110050002 · Cited by 1,609
Abstract Convexity and Global Optimization
Rubinov, A. M. (2000) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-3200-9 · Cited by 422
Learning with a Wasserstein Loss
Frogner, C., Zhang, C., Mobahi, H., Araya‐Polo, M., & Poggio, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.05439 · Cited by 337
A Linear Time Histogram Metric for Improved SIFT Matching
Pele, O., & Werman, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_37 · Cited by 305
An Interpolating Distance Between Optimal Transport and Fisher–Rao Metrics
Chizat, L., Peyré, G., Schmitzer, B., & Vialard, F.-X. (2018) · Foundations of Computational Mathematics · doi:10.1007/s10208-016-9331-y · Cited by 169
Self-citationThe Optimal Partial Transport Problem
Figalli, A. (2009) · Archive for Rational Mechanics and Analysis · doi:10.1007/s00205-008-0212-7 · Cited by 153
Fast Optimal Transport Averaging of Neuroimaging Data
Gramfort, A., Gabriel Peyré, A., & Cuturi, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-19992-4_20 · Cited by 141
A new class of transport distances between measures
Dolbeault, J., Nazaret, B., & Savaré, G. (2008) · Calculus of Variations and Partial Differential Equations · doi:10.1007/s00526-008-0182-5 · Cited by 138
A new optimal transport distance on the space of finite Radon measures
Kondratyev, S., Monsaingeon, L., & Vorotnikov, D. (2016) · Advances in Differential Equations · doi:10.57262/ade/1476369298 · Cited by 86
Liero, M., Mielke, A., & Savaré, G. (2015) · doi:10.20347/wias.preprint.2160 · Cited by 86
Liero, M., Mielke, A., & Savaré, G. (2016) · SIAM Journal on Mathematical Analysis · doi:10.1137/15m1041420 · Cited by 78
A generalized model for optimal transport of images including dissipation and density modulation
Maas, J., Rumpf, M., Schönlieb, C., & Simon, S. (2015) · ESAIM Mathematical Modelling and Numerical Analysis · doi:10.1051/m2an/2015043 · Cited by 60
Cited by
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Self-citationLearning with a Wasserstein Loss
Frogner, C., Zhang, C., Mobahi, H., Araya‐Polo, M., & Poggio, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.05439 · Cited by 337
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
Self-citationCMOT: cross-modality optimal transport for multimodal inference
Alatkar, S. A., & Wang, D. (2023) · Genome biology · doi:10.1186/s13059-023-02989-8 · Cited by 24
Metadata
- Authors
- Chizat, L., Peyré, G., Schmitzer, B., & Vialard, F.-X.
- Venue
- Journal of Functional Analysis
- Publisher
- Elsevier BV
- Published
- 2018-06
- Volume
- 274
- Issue
- 11
- Pages
- 3090-3123
- ISSN
- 0022-1236 (ISSN-L)
- OpenAlex
- W2789285779
- Cited by
- 263
- References
- 13
- FWCI
- 31.06
- Type
- journal article
- Language
- en
- Open access
- bronze
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.