The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Barycenters in the Wasserstein Space
Open accessAbstract
In this paper, we introduce a notion of barycenter in the Wasserstein space which generalizes McCann's interpolation to the case of more than two measures. We provide existence, uniqueness, characterizations, and regularity of the barycenter and relate it to the multimarginal optimal transport problem considered by Gangbo and Święch in [Comm. Pure Appl. Math., 51 (1998), pp. 23–45]. We also consider some examples and, in particular, rigorously solve the Gaussian case. We finally discuss convexity of functionals in the Wasserstein space.
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
Topics in Optimal Transportation
Villani, C. (2003) · Graduate Studies in Mathematics · doi:10.1090/gsm/058 · Cited by 4,412
Convex Analysis and Variational Problems
(1976) · Studies in Mathematics and Its Applications · doi:10.1016/c2009-0-19672-1 · Cited by 3,806
(2008) · doi:10.1007/978-3-7643-8722-8 · Cited by 2,220
Polar factorization and monotone rearrangement of vector‐valued functions
Brenier, Y. (1991) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160440402 · Cited by 1,641
(1978) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)x7141-5 · Cited by 1,123
Wasserstein Barycenter and Its Application to Texture Mixing
Rabin, J., Peyré, G., Delon, J., & Bernot, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24785-9_37 · Cited by 504
Cited by
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
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Iterative Bregman Projections for Regularized Transportation Problems
Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., & Peyré, G. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/141000439 · Cited by 672
Self-citationWasserstein Barycenter and Its Application to Texture Mixing
Rabin, J., Peyré, G., Delon, J., & Bernot, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24785-9_37 · Cited by 504
Convolutional wasserstein distances: efficient optimal transportation on geometric domains
Solomon, J., de Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., & Guibas, L. (2015) · ACM Transactions on Graphics · doi:10.1145/2766963 · Cited by 481
Sliced and Radon Wasserstein Barycenters of Measures
Bonneel, N., Rabin, J., Peyré, G., & Pfister, H. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-014-0506-3 · Cited by 467
Fast Computation of Wasserstein Barycenters
Cuturi, M., & Arnaud Doucet, B. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.4375 · Cited by 420
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
Exploration in Deep Reinforcement Learning: From Single-Agent to Multiagent Domain
Hao, J., Yang, T., Tang, H., Bai, C., Liu, J., Meng, Z., Liu, P., & Wang, Z. (2021) · arXiv · doi:10.48550/arxiv.2109.06668 · Cited by 192
Fair Regression with Wasserstein Barycenters
Chzhen, E., Denis, C., Hebiri, M., Oneto, L., & Pontil, M. (2020) · arXiv · doi:10.48550/arxiv.2006.07286 · Cited by 46
“The next result is standard and can be found for instance in [2, Section 6.1] or [38, Section 5.5.5].”
BackgroundMethodInfluentialSelf-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
Metadata
- Authors
- Agueh, M., & Carlier, G.
- Venue
- SIAM Journal on Mathematical Analysis
- Published
- 2011-01
- Volume
- 43
- Issue
- 2
- Pages
- 904-924
- ISSN
- 0036-1410 (ISSN-L)
- 1095-7154
- OpenAlex
- W1968333723
- Cited by
- 749
- References
- 6
- FWCI
- 17.49
- Type
- journal article
- Language
- en
- Open access
- green
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.