Monotone generative modeling via a geometry-preserving mapping

Applied and Computational Mathematics Seminar
Monday, April 15, 2024 - 2:00pm for 1 hour (actually 50 minutes)
Skiles 005 and
Wonjun Lee – University of Minnesota, Twin Cities – lee01273@umn.edu
Haomin Zhou and Wenjing Liao

Generative Adversarial Networks (GANs) are powerful tools for creating new content, but they face challenges such as sensitivity to starting conditions and mode collapse. To address these issues, we propose a deep generative model that utilizes the Gromov-Monge embedding (GME). It helps identify the low-dimensional structure of the underlying measure of the data and then map it, while preserving its geometry, into a measure in a low-dimensional latent space, which is then optimally transported to the reference measure. We guarantee the preservation of the underlying geometry by the GME and c-cyclical monotonicity of the generative map, where c is an intrinsic embedding cost employed by the GME. The latter property is a first step in guaranteeing better robustness to initialization of parameters and mode collapse. Numerical experiments demonstrate the effectiveness of our approach in generating high-quality images, avoiding mode collapse, and exhibiting robustness to different starting conditions.