Sparsity for dynamic inverse problems on Wasserstein curves with bounded variation
Marcello Carioni, Julius Lohmann
TL;DR
The article develops a dynamic inverse problem framework with a Wasserstein-1 regularizer acting on BV curves in time, allowing jumps and sparse temporal structure. It proves the existence of a sparse minimizer consisting of at most $m$ Dirac-atom trajectories with BV evolution, and furnishes a representer theorem to guarantee sparsity. An FC-GCG method is derived and discretized for grid-free computation of BV trajectories, with a detailed insertion/coefficients/pruning scheme. Numerical experiments validate the ability to recover sparse and jumpy ground truths, even under noise, demonstrating the approach's effectiveness for dynamic inverse problems in Wasserstein space.
Abstract
We investigate a dynamic inverse problem using a regularization which implements the so-called Wasserstein-$1$ distance. It naturally extends well-known static problems such as lasso or total variation regularized problems to a (temporally) dynamic setting. Further, the decision variables, realized as BV curves, are allowed to exhibit discontinuities, in contrast to the design variables in classical optimal transport based regularization techniques. We prove the existence and a characterization of a sparse solution. Further, we use an adaption of the fully-corrective generalized conditional gradient method to experimentally justify that the determination of BV curves in the Wasserstein-$1$ space is numerically implementable.
