FlowADMM: Plug-and-play ADMM with Flow-based Renoise-Denoise Priors

• URL: http://arxiv.org/abs/2605.08640v1
• Date: Sat, 09 May 2026 03:21:01 GMT
• Title: FlowADMM: Plug-and-play ADMM with Flow-based Renoise-Denoise Priors
• Abstract summary: FlowADMM is a state-of-the-art flow-based generative algorithm for solving inverse problems.<n>We show that FlowADMM achieves a state-of-the-art performance among flow-based generative methods on a range of inverse problems.
• Score: 2.986668330518244
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Plug-and-play (PnP) methods for solving inverse problems have recently achieved strong performance by leveraging denoising priors based on powerful generative diffusion and flow models. However, existing diffusion- and flow-based PnP methods typically rely on stochastic renoise-denoise operations, which complicate the analysis of their convergence behavior. In this work, we identify and formalize the deterministic renoise-denoise operator underlying flow-based plug-and-play methods. This perspective reveals that these methods implicitly define a deterministic operator given by the expectation of a denoiser over the latent noise distribution. Building on this insight, we propose FlowADMM, a PnP algorithm that integrates the renoise-denoise operator into the classical alternating direction method of multiplier (ADMM) framework. We establish convergence guarantees for FlowADMM under weak Lipschitz conditions on the underlying flow network, and extend the analysis to non-stationary time schedules. Empirically, FlowADMM achieves state-of-the-art performance among flow-based PnP methods on a range of inverse problems, including denoising, deblurring, super-resolution, and inpainting, while requiring fewer data consistency evaluations than prior approaches.

Related papers

• LLM Inference Under Bursty Workload Distribution: Modifying the WAIT Algorithm [0.8564127299257368]
  We propose a lightweight extension to the state-of-the-art WAIT algorithm.<n>The proposed algorithm performs online estimation of request intensity based on observed interarrival times.
  arXiv  Detail & Related papers  (2026-08-06T15:07:43Z)
• Stochastic Generative Plug-and-Play Priors [9.429516239444922]
  Plug-and-play (M) methods are widely used for solving inverse imaging problems by incorporating a denoiser into optimization algorithms.<n>Score-based diffusion models (SBDMs) have recently demonstrated strong generative performance through a denoiser trained across a range of levels.<n>It remains unclear how to systematically use SBDMs as priors within a framework without relying on reverse diffusion sampling.
  arXiv  Detail & Related papers  (2026-04-04T06:14:38Z)
• Trajectory Stitching for Solving Inverse Problems with Flow-Based Models [68.36374645801901]
  Flow-based generative models have emerged as powerful priors for solving inverse problems.<n>We propose MS-Flow, which represents the trajectory as a sequence of intermediate latent states rather than a single initial code.<n>We demonstrate the effectiveness of MS-Flow over existing methods on image recovery and inverse problems, including inpainting, super-resolution, and computed tomography.
  arXiv  Detail & Related papers  (2026-02-09T11:36:41Z)
• FlowLPS: Langevin-Proximal Sampling for Flow-based Inverse Problem Solvers [51.56484100374058]
  FlowLPS solves inverse problems with pretrained flow models via a Langevin Proximal Sampling (LPS) strategy.<n>Our method integrates Langevin dynamics for manifold-consistent exploration with proximal optimization for precise mode seeking, achieving a superior balance between reconstruction fidelity and perceptual quality.
  arXiv  Detail & Related papers  (2025-12-08T04:18:13Z)
• Provable Mixed-Noise Learning with Flow-Matching [6.687571760931077]
  We study inverse problems with mixed noise, modeled as a combination of additive and multiplicative Gaussian components.<n>Motivated by recent advances in flow-based generative modeling, we propose a novel inference framework based on conditional flow matching embedded within an Expectation-Maximization (EM) algorithm.
  arXiv  Detail & Related papers  (2025-08-25T15:30:12Z)
• One-Step Flow Policy Mirror Descent [52.31612487608593]
  Flow Policy Mirror Descent (FPMD) is an online RL algorithm that enables 1-step sampling during flow policy inference.<n>Our approach exploits a theoretical connection between the distribution variance and the discretization error of single-step sampling in straight flow matching models.
  arXiv  Detail & Related papers  (2025-07-31T15:51:10Z)
• Diffusion Models for Solving Inverse Problems via Posterior Sampling with Piecewise Guidance [52.705112811734566]
  A novel diffusion-based framework is introduced for solving inverse problems using a piecewise guidance scheme.<n>The proposed method is problem-agnostic and readily adaptable to a variety of inverse problems.<n>The framework achieves a reduction in inference time of (25%) for inpainting with both random and center masks, and (23%) and (24%) for (4times) and (8times) super-resolution tasks.
  arXiv  Detail & Related papers  (2025-07-22T19:35:14Z)
• PnP-Flow: Plug-and-Play Image Restoration with Flow Matching [9.589644878034553]
  We introduce Plug-and-Play Flow Matching, an algorithm for solving inverse imaging problems.<n>We evaluate its performance on denoising, superresolution, and inpainting tasks.
  arXiv  Detail & Related papers  (2024-10-03T12:13:56Z)
• AdjointDPM: Adjoint Sensitivity Method for Gradient Backpropagation of Diffusion Probabilistic Models [103.41269503488546]
  Existing customization methods require access to multiple reference examples to align pre-trained diffusion probabilistic models with user-provided concepts. This paper aims to address the challenge of DPM customization when the only available supervision is a differentiable metric defined on the generated contents. We propose a novel method AdjointDPM, which first generates new samples from diffusion models by solving the corresponding probability-flow ODEs. It then uses the adjoint sensitivity method to backpropagate the gradients of the loss to the models' parameters.
  arXiv  Detail & Related papers  (2023-07-20T09:06:21Z)
• Fast and efficient speech enhancement with variational autoencoders [0.0]
  Unsupervised speech enhancement based on variational autoencoders has shown promising performance compared with the commonly used supervised methods. We propose a new approach based on Langevin dynamics that generates multiple sequences of samples and comes with a total variation-based regularization to incorporate temporal correlations of latent vectors. Our experiments demonstrate that the developed framework makes an effective compromise between computational efficiency and enhancement quality, and outperforms existing methods.
  arXiv  Detail & Related papers  (2022-11-02T09:52:13Z)
• Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
  We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior. Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm. Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
  arXiv  Detail & Related papers  (2020-11-18T16:40:45Z)

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.