How well do generative models solve inverse problems? A benchmark study

Patrick Krüger, Patrick Materne, Werner Krebs, Hanno Gottschalk
1/30/2026
cs.LG

No confident code implementation found for this paper.

Abstract

Generative learning generates high dimensional data based on low dimensional conditions, also called prompts. Therefore, generative learning algorithms are eligible for solving (Bayesian) inverse problems. In this article we compare a traditional Bayesian inverse approach based on a forward regression model and a prior sampled with the Markov Chain Monte Carlo method with three state of the art generative learning models, namely conditional Generative Adversarial Networks, Invertible Neural Networks and Conditional Flow Matching. We apply them to a problem of gas turbine combustor design where we map six independent design parameters to three performance labels. We propose several metrics for the evaluation of this inverse design approaches and measure the accuracy of the labels of the generated designs along with the diversity. We also study the performance as a function of the training dataset size. Our benchmark has a clear winner, as Conditional Flow Matching consistently outperforms all competing approaches.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{krger2026well,
  title  = {How well do generative models solve inverse problems? A benchmark study},
  author = {Patrick Krüger and Patrick Materne and Werner Krebs and Hanno Gottschalk},
  year   = {2026},
  eprint = {2601.23238},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.23238v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.23238.svg)](https://codeofpaper.com/paper/2601.23238)

Discussion