Flower: A Flow-Matching Solver for Inverse Problems

Mehrsa Pourya, Bassam El Rawas, Michael Unser
9/30/2025
cs.CVcs.LG

Official code: mehrsapo/Flower (31 stars, last commit 2026-04-14). 2 more implementations below.

Abstract

We introduce Flower, a solver for linear inverse problems. It leverages a pre-trained flow model to produce reconstructions that are consistent with the observed measurements. Flower operates through an iterative procedure over three steps: (i) a flow-consistent destination estimation, where the velocity network predicts a denoised target; (ii) a refinement step that projects the estimated destination onto a feasible set defined by the forward operator; and (iii) a time-progression step that re-projects the refined destination along the flow trajectory. We provide a theoretical analysis that demonstrates how Flower approximates Bayesian posterior sampling, thereby unifying perspectives from plug-and-play methods and generative inverse solvers. On the practical side, Flower achieves state-of-the-art reconstruction quality while using nearly identical hyperparameters across various linear inverse problems. Our code is available at https://github.com/mehrsapo/Flower.

View on arXivView PDF

Code Implementations(3)

mehrsapo/FlowerOfficial100%

[ICLR 2026] Flower: A Flow Matching Solver for Inverse Problems

314C++, CudaFeb 21, 20266 months agoNOASSERTION
ahxmeds/DAWN-FMCommunity71%
MIT

Data-aware and noise-informed flow matching for solving inverse problems

20Shell, PythonOct 19, 20257 months agoMIT
titouanp22/FlowerCommunity70%

Project on Flow Matching solver for inverse problems

00C++, CudaMar 5, 20266 months ago

Similar Papers

Cite this paper

@article{pourya2025flower,
  title  = {Flower: A Flow-Matching Solver for Inverse Problems},
  author = {Mehrsa Pourya and Bassam El Rawas and Michael Unser},
  year   = {2025},
  eprint = {2509.26287},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.26287v2}
}

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/2509.26287.svg)](https://codeofpaper.com/paper/2509.26287)

Discussion