pith. sign in

arxiv: 1710.10898 · v1 · pith:U5PXATX2new · submitted 2017-10-30 · 💻 cs.CV · math.FA· math.OC

Learning to solve inverse problems using Wasserstein loss

classification 💻 cs.CV math.FAmath.OC
keywords lossreconstructiontrainingwassersteinerrorinversemeanproblems
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginals

    math.PR 2023-04 unverdicted novelty 7.0

    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.