Bayesian Inverse Problems with Conditional Sinkhorn Generative Adversarial Networks in Least Volume Latent Spaces
Qiuyi Chen, Panagiotis Tsilifis, Mark Fuge

TL;DR
This paper introduces a novel approach combining Least Volume dimension reduction with conditional Sinkhorn GANs to improve Bayesian inverse problem solving in high-dimensional, nonlinear, and uncertain settings.
Contribution
It presents a new latent space reduction method that enables efficient training of conditional GANs for complex inverse problems.
Findings
Effective dimension reduction improves model training
Method successfully applied to ODE parameter inversion
Enhanced posterior inference in high-dimensional flow problems
Abstract
Solving inverse problems in scientific and engineering fields has long been intriguing and holds great potential for many applications, yet most techniques still struggle to address issues such as high dimensionality, nonlinearity and model uncertainty inherent in these problems. Recently, generative models such as Generative Adversarial Networks (GANs) have shown great potential in approximating complex high dimensional conditional distributions and have paved the way for characterizing posterior densities in Bayesian inverse problems, yet the problems' high dimensionality and high nonlinearity often impedes the model's training. In this paper we show how to tackle these issues with Least Volume--a novel unsupervised nonlinear dimension reduction method--that can learn to represent the given datasets with the minimum number of latent variables while estimating their intrinsic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Adversarial Robustness in Machine Learning · Statistical Methods and Inference
