Establishes the first non-asymptotic exponential convergence rates for Sinkhorn's algorithm on unbounded quadratic costs with non-compact marginals satisfying asymptotically positive log-concavity.
Learning to solve inverse problems using Wasserstein loss
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We propose using the Wasserstein loss for training in inverse problems. In particular, we consider a learned primal-dual reconstruction scheme for ill-posed inverse problems using the Wasserstein distance as loss function in the learning. This is motivated by miss-alignments in training data, which when using standard mean squared error loss could severely degrade reconstruction quality. We prove that training with the Wasserstein loss gives a reconstruction operator that correctly compensates for miss-alignments in certain cases, whereas training with the mean squared error gives a smeared reconstruction. Moreover, we demonstrate these effects by training a reconstruction algorithm using both mean squared error and optimal transport loss for a problem in computerized tomography.
fields
math.PR 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginals
Establishes the first non-asymptotic exponential convergence rates for Sinkhorn's algorithm on unbounded quadratic costs with non-compact marginals satisfying asymptotically positive log-concavity.