Learning from small data sets: Patch‐based regularizers in inverse problems for image reconstruction
The solution of inverse problems is of fundamental interest in medical and astronomical
imaging, geophysics as well as engineering and life sciences. Recent advances were made …
imaging, geophysics as well as engineering and life sciences. Recent advances were made …
Generative sliced MMD flows with Riesz kernels
Maximum mean discrepancy (MMD) flows suffer from high computational costs in large
scale computations. In this paper, we show that MMD flows with Riesz kernels $ K (x, y) …
scale computations. In this paper, we show that MMD flows with Riesz kernels $ K (x, y) …
Unbalanced multi-marginal optimal transport
Entropy-regularized optimal transport and its multi-marginal generalization have attracted
increasing attention in various applications, in particular due to efficient Sinkhorn-like …
increasing attention in various applications, in particular due to efficient Sinkhorn-like …
Wasserstein steepest descent flows of discrepancies with Riesz kernels
The aim of this paper is twofold. Based on the geometric Wasserstein tangent space, we first
introduce Wasserstein steepest descent flows. These are locally absolutely continuous …
introduce Wasserstein steepest descent flows. These are locally absolutely continuous …
Accelerating the Sinkhorn algorithm for sparse multi-marginal optimal transport via fast Fourier transforms
FA Ba, M Quellmalz - Algorithms, 2022 - mdpi.com
We consider the numerical solution of the discrete multi-marginal optimal transport (MOT) by
means of the Sinkhorn algorithm. In general, the Sinkhorn algorithm suffers from the curse of …
means of the Sinkhorn algorithm. In general, the Sinkhorn algorithm suffers from the curse of …
Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm
This contribution features an accelerated computation of the Sinkhorn's algorithm, which
approximates the Wasserstein transportation distance, by employing nonequispaced fast …
approximates the Wasserstein transportation distance, by employing nonequispaced fast …
Wasserstein gradient flows of the discrepancy with distance kernel on the line
This paper provides results on Wasserstein gradient flows between measures on the real
line. Utilizing the isometric embedding of the Wasserstein space P 2 (R) into the Hilbert …
line. Utilizing the isometric embedding of the Wasserstein space P 2 (R) into the Hilbert …
Conditional Wasserstein barycenters and interpolation/extrapolation of distributions
J Fan, HG Müller - IEEE Transactions on Information Theory, 2024 - ieeexplore.ieee.org
Increasingly complex data analysis tasks motivate the study of the dependency of
distributions of multivariate continuous random variables on scalar or vector predictors …
distributions of multivariate continuous random variables on scalar or vector predictors …
On the effect of initialization: The scaling path of 2-layer neural networks
In supervised learning, the regularization path is sometimes used as a convenient
theoretical proxy for the optimization path of gradient descent initialized from zero. In this …
theoretical proxy for the optimization path of gradient descent initialized from zero. In this …
Multi-marginal Gromov-Wasserstein transport and barycenters
Gromov-Wasserstein (GW) distances are combinations of Gromov-Hausdorff and
Wasserstein distances that allow the comparison of two different metric measure spaces …
Wasserstein distances that allow the comparison of two different metric measure spaces …