Trajectory Stitching for Solving Inverse Problems with Flow-Based Models

• URL: http://arxiv.org/abs/2602.08538v1
• Date: Mon, 09 Feb 2026 11:36:41 GMT
• Title: Trajectory Stitching for Solving Inverse Problems with Flow-Based Models
• Authors: Alexander Denker, Moshe Eliasof, Zeljko Kereta, Carola-Bibiane Schönlieb,
• Abstract summary: 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.
• Score: 68.36374645801901
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Flow-based generative models have emerged as powerful priors for solving inverse problems. One option is to directly optimize the initial latent code (noise), such that the flow output solves the inverse problem. However, this requires backpropagating through the entire generative trajectory, incurring high memory costs and numerical instability. We propose MS-Flow, which represents the trajectory as a sequence of intermediate latent states rather than a single initial code. By enforcing the flow dynamics locally and coupling segments through trajectory-matching penalties, MS-Flow alternates between updating intermediate latent states and enforcing consistency with observed data. This reduces memory consumption while improving reconstruction quality. We demonstrate the effectiveness of MS-Flow over existing methods on image recovery and inverse problems, including inpainting, super-resolution, and computed tomography.

Related papers

• Bidirectional Normalizing Flow: From Data to Noise and Back [16.352742402707953]
  Normalizing Flows (NFs) have been established as a principled framework for generative modeling.<n>Recent developments in TARFlow and its variants have revitalized NF methods by combining Transformers and autoregressive flows.<n>We introduce BiFlow, a framework that removes the need for an exact analytic inverse.
  arXiv  Detail & Related papers  (2025-12-11T18:59:55Z)
• 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)
• Restora-Flow: Mask-Guided Image Restoration with Flow Matching [0.39141750421215127]
  Flow matching has emerged as a promising generative approach that addresses the lengthy sampling times associated with state-of-the-art diffusion models.<n>We introduce Restora-Flow, a training-free method that guides flow matching sampling by a degradation mask.<n>We show superior perceptual quality and processing time compared to diffusion and flow matching-based reference methods.
  arXiv  Detail & Related papers  (2025-11-25T10:22:26Z)
• Latent Refinement via Flow Matching for Training-free Linear Inverse Problem Solving [18.226350407462643]
  We propose LFlow, a training-free framework for solving linear inverse problems via pretrained latent flow priors.<n>Our proposed method outperforms state-of-the-art latent diffusion solvers in reconstruction quality across most tasks.
  arXiv  Detail & Related papers  (2025-11-08T21:20:59Z)
• Solving Inverse Problems with FLAIR [68.87167940623318]
  We present FLAIR, a training-free variational framework that leverages flow-based generative models as prior for inverse problems.<n>Results on standard imaging benchmarks demonstrate that FLAIR consistently outperforms existing diffusion- and flow-based methods in terms of reconstruction quality and sample diversity.
  arXiv  Detail & Related papers  (2025-06-03T09:29:47Z)
• 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)
• D-Flow: Differentiating through Flows for Controlled Generation [37.80603174399585]
  We introduce D-Flow, a framework for controlling the generation process by differentiating through the flow. We motivate this framework by our key observation stating that for Diffusion/FM models trained with Gaussian probability paths, differentiating through the generation process projects gradient on the data manifold. We validate our framework on linear and non-linear controlled generation problems including: image and audio inverse problems and conditional molecule generation reaching state of the art performance across all.
  arXiv  Detail & Related papers  (2024-02-21T18:56:03Z)
• GMFlow: Learning Optical Flow via Global Matching [124.57850500778277]
  We propose a GMFlow framework for learning optical flow estimation. It consists of three main components: a customized Transformer for feature enhancement, a correlation and softmax layer for global feature matching, and a self-attention layer for flow propagation. Our new framework outperforms 32-iteration RAFT's performance on the challenging Sintel benchmark.
  arXiv  Detail & Related papers  (2021-11-26T18:59:56Z)
• Normalizing Flows with Multi-Scale Autoregressive Priors [131.895570212956]
  We introduce channel-wise dependencies in their latent space through multi-scale autoregressive priors (mAR) Our mAR prior for models with split coupling flow layers (mAR-SCF) can better capture dependencies in complex multimodal data. We show that mAR-SCF allows for improved image generation quality, with gains in FID and Inception scores compared to state-of-the-art flow-based models.
  arXiv  Detail & Related papers  (2020-04-08T09:07:11Z)

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.