mlsanityData to 7 Oct 2026

Fast L2 optimal mass transport via reduced basis methods for the Monge-Ampgraverm ere equation

arXiv 2112.01878 ↗First posted 3 Dec 2021math.NA cs.LG cs.NAcited by 0

Not on the map. Why?

Abstract (arXiv)

Repeatedly solving the parameterized optimal mass transport (pOMT) problem is a frequent task in applications such as image registration and adaptive grid generation. It is thus critical to develop a highly efficient reduced solver that is equally accurate as the full order model. In this paper, we propose such a machine learning-like method for pOMT by adapting a new reduced basis (RB) technique specifically designed for nonlinear equations, the reduced residual reduced over-collocation (R2-ROC) approach, to the parameterized Monge-Ampgraverm ere equation. It builds on top of a narrow-stencil finite different method (FDM), a so-called truth solver, which we propose in this paper for the Monge-Ampgraverm ere equation with a transport boundary. Together with the R2-ROC approach, it allows us to handle the strong and unique nonlinearity pertaining to the Monge-Ampgraverm ere equation achieving online efficiency without resorting to any direct approximation of the nonlinearity. Several challenging numerical tests demonstrate the accuracy and high efficiency of our method for solving the Monge-Ampgraverm ere equation with various parametric boundary conditions.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 54 references that are in the map. First posted on arXiv 3 Dec 2021.

Builds on

3 of 54 references.

References · 3

  1. 2015Learning with a Wasserstein Losscited by 194
  2. 2015Sliced Wasserstein Kernels for Probability Distributionscited by 64
  3. 2015Wasserstein Training of Boltzmann Machinescited by 3

Built on by

Not cited yet.