.png){kind=icon}
.png){kind=icon}
Return
STABILIZED SPARSE SCALING ALGORITHMS FOR ENTROPY REGULARIZED TRANSPORT PROBLEMS
.png){kind=icon}
OA
AI
DOI：10.1137/16M1106018.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Scaling algorithms for entropic transport-type problems have become a very popular numerical method, encompassing Wasserstein barycenters, multimarginal problems, gradient flows, and unbalanced transport. However, a standard implementation of the scaling algorithm has several numerical limitations: the scaling factors diverge and convergence becomes impractically slow as the entropy regularization approaches zero. Moreover, handling the dense kernel matrix becomes unfeasible for large problems. To address this, we combine several modifications: A log-domain stabilized formulation, the well-known epsilon-scaling heuristic, an adaptive truncation of the kernel, and a coarse-to-fine scheme. This permits the solution of larger problems with smaller regularization and negligible truncation error. A new convergence analysis of the Sinkhorn algorithm is developed, working toward a better understanding of epsilon-scaling. Numerical examples illustrate efficiency and versatility of the modified algorithm.
Keywords:
optimal transport
convex optimization
entropy regularization
multiscale
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W