The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Iterative Bregman Projections for Regularized Transportation Problems
Open accessAbstract
This paper details a general numerical framework to approximate solutions to linear programs related to optimal transport. The general idea is to introduce an entropic regularization of the initial linear program. This regularized problem corresponds to a Kullback--Leibler Bregman divergence projection of a vector (representing some initial joint distribution) on the polytope of constraints. We show that for many problems related to optimal transport, the set of linear constraints can be split in an intersection of a few simple constraints, for which the projections can be computed in closed form. This allows us to make use of iterative Bregman projections (when there are only equality constraints) or, more generally, Bregman--Dykstra iterations (when inequality constraints are involved). We illustrate the usefulness of this approach for several variational problems related to optimal transport: barycenters for the optimal transport metric, tomographic reconstruction, multimarginal optimal transport, and in particular its application to Brenier's relaxed solutions of incompressible Euler equations, partial unbalanced optimal transport, and optimal transport with capacity constraints.
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
The Earth Mover's Distance as a Metric for Image Retrieval
Rubner, Y., Tomasi, C., & Guibas, L. J. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026543900054 · Cited by 4,568
Topics in Optimal Transportation
Villani, C. (2003) · Graduate Studies in Mathematics · doi:10.1090/gsm/058 · Cited by 4,412
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Sinkhorn Distances: Lightspeed Computation of Optimal TransportPreprint
Cuturi, M. (2013) · Cited by 2,385
Self-citationImage reconstruction from projections : the fundamentals of computerized tomography
Herman, G. T. (1980) · Academic Press eBooks · Cited by 1,993
$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
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
Self-citationDeming, W. E., & Stephan, F. F. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731829 · Cited by 1,537
Burkard, R., Dell'Amico, M., & Martello, S. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717754 · Cited by 1,394
A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
Sinkhorn, R. (1964) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177703591 · Cited by 1,032
Concerning nonnegative matrices and doubly stochastic matrices
Sinkhorn, R., & Knopp, P. (1967) · Pacific Journal of Mathematics · doi:10.2140/pjm.1967.21.343 · Cited by 887
Barycenters in the Wasserstein Space
Agueh, M., & Carlier, G. (2011) · SIAM Journal on Mathematical Analysis · doi:10.1137/100805741 · Cited by 749
Self-citationAn Algorithm for Restricted Least Squares Regression
Dykstra, R. L. (1983) · Journal of the American Statistical Association · doi:10.1080/01621459.1983.10477029 · Cited by 551
A survey of the Schrödinger problem and some of its connections with optimal transport
Léonard, C. (2013) · Discrete and Continuous Dynamical Systems · doi:10.3934/dcds.2014.34.1533 · Cited by 493
Fast Computation of Wasserstein Barycenters
Cuturi, M., & Arnaud Doucet, B. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.4375 · Cited by 420
Self-citationA SURVEY OF THE SCHRÖDINGER PROBLEM AND SOME OF ITS CONNECTIONS WITH OPTIMAL TRANSPORTPreprint
(2016) · Cited by 403
A survey of the Schr\"odinger problem and some of its connections with optimal transportPreprint
Léonard, C. (2013) · arXiv (Cornell University) · Cited by 379
The gravity model in transportation analysis : theory and extensions
Erlander, S., & Stewart, N. F. (1990) · VSP eBooks · Cited by 360
Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
Sinkhorn, R. (1967) · The American Mathematical Monthly · doi:10.2307/2314570 · Cited by 342
Displacement interpolation using Lagrangian mass transport
Bonneel, N., van de Panne, M., Paris, S., et al. (2011) · doi:10.1145/2024156.2024192 · Cited by 241
On the scaling of multidimensional matrices
Franklin, J., & Lorenz, J. (1989) · Linear Algebra and its Applications · doi:10.1016/0024-3795(89)90490-4 · Cited by 213
Optimal Transport with Proximal Splitting
Papadakis, N., Peyré, G., & Oudet, E. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/130920058 · Cited by 178
Self-citationDisplacement interpolation using Lagrangian mass transport
Bonneel, N., van de Panne, M., Paris, S., et al. (2011) · ACM Transactions on Graphics · doi:10.1145/2070781.2024192 · Cited by 159
The Optimal Partial Transport Problem
Figalli, A. (2009) · Archive for Rational Mechanics and Analysis · doi:10.1007/s00205-008-0212-7 · Cited by 153
Convergence of the Iterative Proportional Fitting Procedure
Rüschendorf, L. (1995) · The Annals of Statistics · doi:10.1214/aos/1176324703 · Cited by 146
Use of entropy maximizing models in theory of trip distribution, mode split and route split
Wilson, A. G. (1969) · UCL Discovery (University College London) · Cited by 104
Wasserstein Propagation for Semi-Supervised Learning
Solomon, J., Rustamov, R. M., Guibas, L. J., & Butscher, A. (2014) · Cited by 84
An Iterative Procedure for Obtaining $I$-Projections onto the Intersection of Convex Sets
Dykstra, R. L. (1985) · The Annals of Probability · doi:10.1214/aop/1176992918 · Cited by 59
Synthesizing and Mixing Stationary Gaussian Texture Models
Xia, G.-S., Ferradans, S., Gabriel Peyré, A., & Aujol, J. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/130918010 · Cited by 55
Closedness of Sum Spaces andthe Generalized Schrödinger Problem
Rüschendorf, L., & Thomsen, W. (1998) · Theory of Probability and Its Applications · doi:10.1137/s0040585x97976301 · Cited by 36
Bhattacharya, B. (2006) · The Annals of Statistics · doi:10.1214/009053606000000056 · Cited by 13
Cited by
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Self-citationAn introduction to continuous optimization for imaging
Chambolle, A., & Pock, T. (2016) · Acta Numerica · doi:10.1017/s096249291600009x · Cited by 545
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
Self-citationOptimal Mass Transport: Signal processing and machine-learning applications
Kolouri, S., Park, S. R., Thorpe, M., Slepcev, D., & Rohde, G. K. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2695801 · Cited by 443
Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning
Kuhn, D., Esfahani, P. M., Nguyen, V. A., & Shafieezadeh-Abadeh, S. (2019) · Operations Research & Management Science in the Age of Analytics · doi:10.1287/educ.2019.0198 · Cited by 342
Metadata
- Authors
- Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., & Peyré, G.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2015-01
- Volume
- 37
- Issue
- 2
- Pages
- A1111-A1138
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2036996178
- Cited by
- 672
- References
- 31
- FWCI
- 105.78
- 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.