Variational Flow Maps: Make Some Noise for One-Step Conditional Generation

• URL: http://arxiv.org/abs/2603.07276v1
• Date: Sat, 07 Mar 2026 16:32:30 GMT
• Title: Variational Flow Maps: Make Some Noise for One-Step Conditional Generation
• Abstract summary: Variational Flow Maps (VFM) is a framework for conditional sampling.<n>VFM produces well-calibrated conditional samples in a single (or few) steps.<n>For ImageNet, VFM attains competitive fidelity while accelerating the sampling by orders of magnitude.
• Score: 42.163444304261766
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Flow maps enable high-quality image generation in a single forward pass. However, unlike iterative diffusion models, their lack of an explicit sampling trajectory impedes incorporating external constraints for conditional generation and solving inverse problems. We put forth Variational Flow Maps, a framework for conditional sampling that shifts the perspective of conditioning from "guiding a sampling path", to that of "learning the proper initial noise". Specifically, given an observation, we seek to learn a noise adapter model that outputs a noise distribution, so that after mapping to the data space via flow map, the samples respect the observation and data prior. To this end, we develop a principled variational objective that jointly trains the noise adapter and the flow map, improving noise-data alignment, such that sampling from complex data posterior is achieved with a simple adapter. Experiments on various inverse problems show that VFMs produce well-calibrated conditional samples in a single (or few) steps. For ImageNet, VFM attains competitive fidelity while accelerating the sampling by orders of magnitude compared to alternative iterative diffusion/flow models. Code is available at https://github.com/abbasmammadov/VFM

Related papers

• The Principles of Diffusion Models [81.12042238390075]
  Diffusion modeling starts by defining a forward process that gradually corrupts data into noise.<n>The goal is to learn a reverse process that transforms noise back into data while recovering the same intermediates.<n>The score-based view, rooted in energy-based modeling, learns the gradient of the evolving data distribution.<n>The flow-based view, related to normalizing flows, treats generation as following a smooth path that moves samples from noise to data.
  arXiv  Detail & Related papers  (2025-10-24T02:29:02Z)
• FlowDPS: Flow-Driven Posterior Sampling for Inverse Problems [51.99765487172328]
  Posterior sampling for inverse problem solving can be effectively achieved using flows.<n>Flow-Driven Posterior Sampling (FlowDPS) outperforms state-of-the-art alternatives.
  arXiv  Detail & Related papers  (2025-03-11T07:56:14Z)
• Distributional Diffusion Models with Scoring Rules [83.38210785728994]
  Diffusion models generate high-quality synthetic data.<n> generating high-quality outputs requires many discretization steps.<n>We propose to accomplish sample generation by learning the posterior em distribution of clean data samples.
  arXiv  Detail & Related papers  (2025-02-04T16:59:03Z)
• DAWN-FM: Data-Aware and Noise-Informed Flow Matching for Solving Inverse Problems [4.212663349859165]
  Inverse problems, which involve estimating parameters from incomplete or noisy observations, arise in various fields such as medical imaging.<n>We employ Flow Matching (FM), a generative framework that integrates a deterministic processes to map a simple reference distribution.<n>Our method DAWN-FM: Data-AWare and Noise-informed Flow Matching incorporates data and noise embedding, allowing the model to access representations about the measured data.
  arXiv  Detail & Related papers  (2024-12-06T04:18:49Z)
• There and Back Again: On the relation between Noise and Image Inversions in Diffusion Models [3.8384683391475556]
  Diffusion Models generate new samples but lack a low-dimensional latent space that encodes the data into editable features.<n>Inversion-based methods address this by reversing the denoising trajectory, transferring images to their approximated starting noise.<n>We show that latents exhibit structural patterns in the form of less diverse noise predicted for smooth image areas.
  arXiv  Detail & Related papers  (2024-10-31T00:30:35Z)
• Fast Samplers for Inverse Problems in Iterative Refinement Models [19.099632445326826]
  We propose a plug-and-play framework for constructing efficient samplers for inverse problems. Our method can generate high-quality samples in as few as 5 conditional sampling steps and outperforms competing baselines requiring 20-1000 steps.
  arXiv  Detail & Related papers  (2024-05-27T21:50:16Z)
• Boosting Diffusion Models with Moving Average Sampling in Frequency Domain [101.43824674873508]
  Diffusion models rely on the current sample to denoise the next one, possibly resulting in denoising instability. In this paper, we reinterpret the iterative denoising process as model optimization and leverage a moving average mechanism to ensemble all the prior samples. We name the complete approach "Moving Average Sampling in Frequency domain (MASF)"
  arXiv  Detail & Related papers  (2024-03-26T16:57:55Z)
• Diffusion Model Based Posterior Sampling for Noisy Linear Inverse Problems [14.809545109705256]
  This paper presents a fast and effective solution by proposing a simple closed-form approximation to the likelihood score. For both diffusion and flow-based models, extensive experiments are conducted on various noisy linear inverse problems. Our method demonstrates highly competitive or even better reconstruction performances while being significantly faster than all the baseline methods.
  arXiv  Detail & Related papers  (2022-11-20T01:09:49Z)
• Diffusion Posterior Sampling for General Noisy Inverse Problems [50.873313752797124]
  We extend diffusion solvers to handle noisy (non)linear inverse problems via approximation of the posterior sampling. Our method demonstrates that diffusion models can incorporate various measurement noise statistics.
  arXiv  Detail & Related papers  (2022-09-29T11:12:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.