.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
optimal transport
convex optimization
entropy regularization
multiscale
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
The Diagnostic Validity of Melancholic Major Depression in a Population-Based Sample of Female Twins
.png){kind=icon}
PREAI
分享收藏
查看更多内容