betaFeedback

WorksComputer Science

FLINT: Coupling Proximal Initialization and Bounded Stochasticity for Flow-Matching Inverse Problems

Abstract

Flow matching models have emerged as a dominant paradigm for generative posterior sampling in imaging inverse problems. Existing solvers follow two distinct lines of work: trajectory-space methods, which refine sampling dynamics from random initial noise, and source-space methods, which optimize the initial noise itself. While most prior work treats these as independent design choices, we show that they are inherently coupled. We derive a unified stability bound that links initialization proximity and cumulative sampling stochasticity through a multiplicative envelope, complemented by two empirical observations. First, we identify a sufficiency regime in which a moderately optimized proximal source initialization is enough to attain the performance plateau, rendering exhaustive source-space optimization unnecessary. Second, this initial advantage is fragile: it is eroded by excessive stochasticity accumulation during guided sampling, necessitating a mechanism that bounds the cumulative noise injection. These findings motivate FLINT, a two-stage framework that operationalizes this coupling. FLINT establishes a high-fidelity starting point via a manifold-constrained proximal objective in only a few iterations, then performs guided sampling under a bounded stochasticity schedule that helps prevent erasure of the initialization advantage. Across diverse inverse problems, FLINT delivers state of the art perceptual quality and competitive distortion metrics while maintaining superior computational efficiency.

Introduction

Inverse problems arise throughout computational imaging and computer vision [5, 22, 37, 34, 67], where the goal is to recover a clean image x0∈Rdx_0 \in\mathbb{R}^d from a degraded measurement y=Ax0+ny = Ax_0 + n, with AA denoting the forward operator and n∼N(0,σy2I)n \sim\mathcal{N}(0, \sigma_y^2 I) additive Gaussian noise. Since AA is typically many-to-one, the problem is ill-posed and requires a prior over natural images [55, 48, 57, 56]. From a Bayesian perspective, this reduces to sampling from the posterior p(x0∣y)∝p(y∣x0)⋅p(x0)p(x_0 \mid y) \propto p(y \mid x_0) \cdot p(x_0), where the likelihood p(y∣x0)p(y \mid x_0) encodes the forward model and the prior p(x0)p(x_0) regularizes solutions toward the natural image manifold. Deep generative models have emerged as powerful priors with diffusion models [21, 54] and flow matching models [33, 32]. Large-scale rectified flow models [18] achieve photorealistic generation quality, rendering them highly attractive for posterior sampling.

Existing inverse problem solvers leveraging these priors typically fall into two categories (Sec. 2.2). Trajectory-space methods [11, 52, 25, 51, 66, 27, 17, 42, 29, 40, 3] steer the sampling path toward the measurement-consistent solution at each step but rely on a fixed, random starting point x1∼N(0,I)x_1 \sim\mathcal{N}(0, I), leaving reconstruction quality inherently sensitive to the specific realization of the initial noise (Figure 1(a) and (b)). Source-space methods [8, 60, 4, 44, 23, 62, 65, 39] perform inference directly on the initial noise x1x_1, keeping the subsequent trajectory unmodified (Figure 1(c) and (d)). Most prior work has treated initialization and sampling dynamics as decoupled modules, an implicit assumption that overlooks the coupling between initialization proximity and sampling stochasticity, leaving their joint impact on reconstruction quality largely unexplored.

Illustration of generative paradigms for inverse problems

Figure 1. Illustration of generative paradigms for inverse problems. (a) and (b) depict trajectory-space methods, while panels (c) and (d) depict source-space optimization methods. (a) Likelihood score corrections are applied directly at each noisy intermediate state xtx_t. (b) Likelihood score corrections are applied in clean image space via the Tweedie estimate x^0∣t\hat{x}_{0|t}, followed by renoising to the generative manifold at the next timestep. (c) Source-space MAP methods reparameterize the clean image via the deterministic generative map Φ\Phi as x0=Φ(x1)x_0 = \Phi(x_1) and optimize over the initial noise x1x_1 to minimize data fidelity. (d) Source-space posterior sampling draws samples from p(x1∣y)p(x_1 \mid y) via Hamiltonian Monte Carlo or Langevin dynamics. (e) By strategically coupling proximal source initialization with bounded stochasticity during guided posterior sampling, FLINT bounds the sampling trajectory, preserving the initialization advantage and yielding high-fidelity convergence.

In this work, we reveal that these two design choices are not independent but inherently coupled, and that exploiting their synergy is beneficial for high-fidelity posterior sampling. Combining a stability bound that decomposes into a source-space initialization term and a cumulative stochasticity term with empirical observations, we identify two complementary findings. First, a proximal source initialization that anchors the starting noise within a sufficient proximity of a source-space solution can attain high-quality reconstruction without exhaustive optimization. Second, the benefits of this proximal start are fragile. They are eroded by the excessive accumulation of stochasticity during guided posterior sampling, necessitating a mechanism to bound the cumulative injected noise. Together, these findings lead to FLINT (Flow-based posterior sampling with proximal source initialization and bounded stochasticity), a two-stage framework that operationalizes this coupling. Stage 1 implements a well-informed starting point by optimizing a manifold-constrained proximal objective for only a few iterations. Stage 2 then employs a bounded stochasticity schedule to steer the trajectory while preventing the erasure of the informed initialization (Figure 1(e)). Our main contributions are:

  • Theoretical Coupling: We derive a unified stability bound for flow-based posterior sampling, showing that the terminal deviation from a deterministic reference is controlled by initialization proximity and cumulative sampling stochasticity. We empirically identify a sufficiency regime, where moderate source-space optimization is enough to reach the performance plateau.

  • FLINT Framework: We introduce FLINT, a training-free two-stage sampler that bridges source-space and trajectory-space methods. It utilizes a manifold-constrained proximal objective for informed initialization and a bounded stochasticity schedule that helps preserve the initialization advantage during guided posterior sampling.

  • Experimental Results: Extensive experiments across imaging inverse problems show that FLINT achieves state-of-the-art perceptual quality and competitive or superior distortion metrics, with a markedly favorable efficiency-performance profile.

Background

Rectified Flow

Rectified Flow [33] transports between the data distribution π0\pi_0 and the noise distribution π1=N(0,I)\pi_1 = \mathcal{N}(0, I) via an ODE, where t=1t = 1 corresponds to pure noise and t=0t = 0 to the data space. Training pairs (x0,x1)∼π0×π1(x_0, x_1) \sim\pi_0 \times\pi_1 are linearly interpolated as xt=(1−t)x0+tx1x_t = (1-t)x_0 + tx_1, and a velocity network vθv_\theta is trained to match the straight-line direction (x1−x0)(x_1-x_0) as follows.

min⁡θEt∼U[0,1], x0∼π0, x1∼π1[∥(x1−x0)−vθ(xt,t)∥22].(1)\min_\theta\mathbb{E}_{t\sim\mathcal{U}[0,1],\,x_0\sim\pi_0,\,x_1\sim\pi_1}\left[\left\|(x_1-x_0)-v_\theta(x_t,t)\right\|_2^2\right]. \tag*{(1)}

Samples are generated by integrating the ODE from t=1t=1 to t=0t=0 over a fixed schedule {τi(N)}i=1N\{\tau_i^{(N)}\}_{i=1}^N with N∈[28,50]N\in[28,50] steps in practice. We denote the resulting deterministic generative map as Φ:Rd→Rd\Phi:\mathbb{R}^d\to\mathbb{R}^d, so that x0=Φ(x1)x_0=\Phi(x_1). Rearranging the linear interpolation at any intermediate state xtx_t yields a flow-based Tweedie’s formula x^0∣t:=E[x0∣xt]≈xt−t vθ(xt,t)\hat{x}_{0\mid t}:=\mathbb{E}[x_0\mid x_t]\approx x_t-t\,v_\theta(x_t,t), which provides a single step clean image estimate from any intermediate state [26].

Posterior Sampling for Inverse Problems

Given the measurement model y=Ax0+ny=Ax_0+n, posterior sampling aims to draw samples from p(x0∣y)∝p(y∣x0)p(x0)p(x_0\mid y)\propto p(y\mid x_0)p(x_0) [54, 53, 11, 52, 12]. Existing solvers built on diffusion or flow matching priors divide into two families. Trajectory-space methods steer intermediate states toward measurement consistency via the Tweedie estimate x^0∣t:=E[x0∣xt]\hat{x}_{0\mid t}:=\mathbb{E}[x_0\mid x_t], obtaining the posterior mean either via Tweedie’s formula or by integrating a probability flow ODE from xtx_t toward t=0t=0. Within this family, one subfamily enforces data consistency directly in the noisy latent space by approximating ∇xtlog⁡p(y∣xt)≈∇xtlog⁡p(y∣x^0∣t)\nabla_{x_t}\log p(y\mid x_t)\approx\nabla_{x_t}\log p(y\mid\hat{x}_{0\mid t}) [11, 52, 25, 10, 47, 46, 41, 30], while the other enforces consistency in clean image space via x^0∣t\hat{x}_{0\mid t} and then renoises back to the (t+Δt)(t+\Delta t)-manifold of the generative prior [51, 66, 28, 27, 17, 42, 40, 29, 3]. Both subfamilies initialize from x1∼N(0,I)x_1\sim\mathcal{N}(0,I), leaving the quality of the starting point entirely uncontrolled. Source-space methods instead confine to the initial noise x1x_1 via the deterministic generative map Φ:Rd→Rd\Phi:\mathbb{R}^d\to\mathbb{R}^d defined by the full reverse ODE, leaving the generative trajectory unmodified. One line of work casts source-space inference as MAP estimation [8, 60, 4], reparameterizing x0=Φ(x1)x_0=\Phi(x_1) and optimizing x1x_1 to minimize data fidelity. Another targets p(x1∣y)p(x_1\mid y) directly via Langevin dynamics, Hamiltonian Monte Carlo, or related MCMC updates [44, 23, 62, 65, 39], enabling broader posterior exploration. Both subfamilies nonetheless share a substantial computational burden: evaluating ∇x1J(Φ(x1))\nabla_{x_1}\mathcal{J}(\Phi(x_1)) requires backpropagating through the full NN-step reverse ODE.

Reducing the Computational Cost of Source-Space Optimization

Source-space methods optimize x1x_1 by minimizing a data consistency objective J(x0)\mathcal{J}(x_0). Computing ∇x1J(x0)\nabla_{x_1}\mathcal{J}(x_0) incurs two compounding costs: obtaining x0x_0 requires an NN-step reverse ODE, and backpropagating through this chain requires evaluating the Jacobian product ∏i∂xi−1∂xi\prod_i\frac{\partial x_{i-1}}{\partial x_i}.

Truncated sampling. To reduce the forward pass cost, we adopt truncated sampling with K≪NK\ll N steps [49, 31]. The flow ODE is integrated for the first K−1K-1 steps along the NN-step time schedule {τi(N)}i=1N\{\tau_i^{(N)}\}_{i=1}^N, after which a clean image estimate is formed via the flow-based Tweedie’s formula:

xtstop=x1−∑i=1K−1(τi−τi+1)vθ(xτi,τi),x^0=xtstop−tstop⋅vθ(xtstop,tstop).(2)x_{t_{\mathrm{stop}}}=x_1-\sum_{i=1}^{K-1}(\tau_i-\tau_{i+1})v_\theta(x_{\tau_i},\tau_i),\qquad\hat{x}_0=x_{t_{\mathrm{stop}}}-t_{\mathrm{stop}}\cdot v_\theta(x_{t_{\mathrm{stop}}},t_{\mathrm{stop}}). \tag*{(2)}

where τi=τi(N)\tau_i=\tau_i^{(N)} and tstop=τK−1t_{\mathrm{stop}}=\tau_{K-1}. Denoising to tstopt_{\mathrm{stop}} before applying Tweedie’s formula yields an efficient surrogate x^0(x1)\hat{x}_0(x_1).

Efficient gradient computation. The backpropagation cost has been mitigated by strategies such as adjoint methods and gradient checkpointing [38, 58, 7, 43, 14], though these often trade memory for computation. Shortcut Diffusion Optimization (SDO) [16] reinterprets sampling as Picard fixed-point iteration and shows that ∇x1J(x0)\nabla_{x_1}\mathcal{J}(x_0) is well-approximated by ∂J∂x0∂xN−1∂x1\frac{\partial\mathcal{J}}{\partial x_0}\frac{\partial x_{N-1}}{\partial x_1}, retaining the computational graph only at the first denoising step with bounded error. Our method combines truncated sampling and the SDO shortcut, as detailed in Algorithm 2, to substantially reduce per-iteration overhead.

Analysis: Coupling of Proximal Initialization and Sampling Stochasticity

This section analyzes how source-space proximity and sampling stochasticity jointly affect an upper bound on the mean-square terminal deviation from a reference trajectory during guided sampling. An initial noise placed near the minimizer of the posterior energy E(x1):=−log⁡p(x1∣y)\mathcal{E}(x_1):=-\log p(x_1\mid y) admits an energy upper bound controlled by its distance to the minimizer, whereas a random Gaussian draw typically lies far from this minimizer in high dimensions and thus yields a looser distance-based upper bound. This argument is formalized in Appendix A.1. Whether such an initialization advantage is retained during sampling depends on how the proximity gap propagates through the sampling trajectory, which we address by analyzing the reverse-time posterior flow SDE [2, 54]:

dxt=[vt(xt∣y)−gt22∇xtlog⁡pt(xt∣y)]dt+gt dW‾t,(3)dx_t = \left[v_t(x_t \mid y) - \frac{g_t^2}{2}\nabla_{x_t}\log p_t(x_t \mid y)\right]dt + g_t\,d\overline{W}_t, \tag*{(3)}

where vt(xt∣y)v_t(x_t \mid y) is the posterior velocity, ∇xtlog⁡pt(xt∣y)\nabla_{x_t}\log p_t(x_t \mid y) is the posterior score, and gtg_t is the diffusion coefficient controlling stochastic departure.

Proposition 3.1 (Terminal stability bound). Let x1∗∈Rdx_1^* \in\mathbb{R}^d be any reference point in the dd-dimensional source space, x0∗x_0^* the terminal output of the drift ODE of (3) with only the Brownian term removed which is initialized at x1∗x_1^*, and Φg(x1)\Phi_g(x_1) the terminal output of (3) initialized at x1x_1. Let G:=∫01gt2 dtG := \int_0^1 g_t^2\,dt denote the cumulative stochasticity. Suppose the posterior velocity satisfies a one-sided Lipschitz condition with parameter mv(t)m_v(t) (Assumption A.4) and the posterior score satisfies a one-sided Lipschitz condition with parameter ms(t)m_s(t) (Assumption A.5). Then any x~1∈Rd\widetilde{x}_1 \in\mathbb{R}^d satisfying ∥x~1−x1∗∥2≤δ\lVert\widetilde{x}_1 - x_1^* \rVert_2 \le\delta obeys:

E[∥Φg(x~1)−x0∗∥22]≤2e2M+(δ2initialization error term+d⋅Gstochastic departure term),M+:=max⁡(0,sup⁡s∈[0,1]∫0sm(u) du).(4)\mathbb{E}\left[\left\lVert\Phi_g(\widetilde{x}_1)-x_0^*\right\rVert_2^2\right] \le2e^{2M_+}\left(\frac{\delta^2}{\text{initialization error term}}+\frac{d\cdot G}{\text{stochastic departure term}}\right), \quad M_+ := \max\left(0,\sup_{s\in[0,1]}\int_0^s m(u)\,du\right). \tag*{(4)}

where m(t):=mv(t)+gt22ms(t)m(t) := m_v(t) + \frac{g_t^2}{2}m_s(t) is the effective contraction rate of the posterior drift. (Proof in Appendix A.2.)

Remark 1 (Canonical reference: prior-typical and measurement-consistent initialization). A canonical instantiation of Proposition 3.1 selects x1∗x_1^* as a reference point that is simultaneously prior typical and measurement consistent, satisfying A(Φ(x1∗))≈yA(\Phi(x_1^*)) \approx y under the unconditional generative map Φ\Phi. Proposition 3.1 neither bounds reconstruction error relative to the ground truth nor establishes convergence to the exact posterior.

Theoretical insights. Proposition 3.1 places the initialization error and the stochastic departure in a single additive bound under a common prefactor e2M+e^{2M_+}, yielding two key insights independent of the choice of reference. (i) Sufficiency of proximal initialization. When δ2≪d⋅G\delta^2 \ll d\cdot G, the stochastic departure dominates the bound, so further reducing δ\delta has only a small relative effect on the upper bound. Achieving sufficient proximity thus controls the initialization term adequately without exhaustive optimization. * (ii) Attenuation by excessive stochasticity.* Increasing GG inflates the stochastic departure term d⋅Gd \cdot G, so that, for a fixed M+M_+, the bound grows with GG regardless of how well δ\delta has been reduced. Bounding GG throughout sampling therefore helps preserve the benefit of any principled starting point.

We explore the two insights empirically under the setting of Remark 1. Using FlowDPS [26] as the posterior sampler on Gaussian deblurring (FFHQ [24], 100 samples), we instantiate x1∗x_1^* as the unconditional ODE inversion of the ground truth image and construct perturbed initializations x~1\tilde{x}_1 via spherical linear interpolation (SLERP) between x1∗x_1^* and a Gaussian noise ϵ∼N(0,Id)\epsilon\sim\mathcal{N}(0,I_d):

x~1=sin⁡(θ−C0)sin⁡θx1∗+sin⁡C0sin⁡θϵ,θ=cos⁡−1(x1∗⋅ϵ∥x1∗∥2∥ϵ∥2),(5)\tilde{x}_1 = \frac{\sin(\theta-C_0)}{\sin\theta}x_1^*+\frac{\sin C_0}{\sin\theta}\epsilon,\qquad\theta=\cos^{-1}\left(\frac{x_1^*\cdot\epsilon}{\lVert x_1^*\rVert_2\lVert\epsilon\rVert_2}\right), \tag*{(5)}

where C0∈[0,π/2]C_0 \in[0,\pi/2] controls the perturbation scale. This construction approximately preserves the Gaussian typical norm ∥x~1∥2≈d\lVert\tilde{x}_1\rVert_2 \approx\sqrt{d}, providing a clean empirical counterpart to the initialization error term in (4). Figure 2(a) visualizes the perception-distortion landscape as a joint function of the perturbation scale C0C_0, reflecting δ\delta along the horizontal axis, and the cumulative stochasticity GG across the curve family.

Figure 2. Interplay of proximal initialization and sampling stochasticity on Gaussian deblurring. (a) PSNR and LPIPS as functions of the perturbation scale C0C_0 across varying the cumulative stochasticity GG, demonstrating the existence of a sufficiency regime (C0≤0.4C_0 \le0.4 in this setup) where proximal initialization performs on par with exact inversion. (b) Visual comparisons for C0∈{0,0.4,π/2}C_0 \in\{0, 0.4, \pi/2\}. While a representative proximal initialization within this regime (C0=0.4C_0 = 0.4) matches the high fidelity of exact inversion under posterior sampling (G=0.008G = 0.008), it preserves measurement-consistent structures even in unconditional sampling, unlike the unrelated output from random initialization.

Sufficiency of proximal source initialization. Across all GG curves in Figure 2(a), reconstruction quality remains nearly flat within an initial proximity range before it begins to degrade. The exact extent of this flat region (here, up to C0≈0.4C_0 \approx0.4) depends on the specific setup. We refer to this empirically observed region as the “sufficiency regime”. Within this regime, further reducing δ\delta provides negligible gain. Figure 2(b) qualitatively corroborates this. Under posterior sampling (G=0.008G = 0.008), a moderately proximal initialization from this regime (e.g., C0=0.4C_0 = 0.4) achieves reconstructions visually comparable to exact inversion (C0=0C_0 = 0), whereas random initialization (C0=π/2C_0 = \pi/2) incurs a substantial quality drop. Unconditional sampling further confirms that the proximal noise encodes measurement-consistent structure, while the random noise produces an unrelated image.

Attenuation by excessive stochasticity. Turning to the curve family in Figure 2(a), increasing GG degrades reconstruction quality. This is qualitatively consistent with Proposition 3.1: as GG grows, the stochastic departure term d⋅Gd \cdot G rises directly, so the bound increases regardless of how well δ\delta has been reduced. Consequently, a well chosen initialization alone is insufficient. Bounding GG throughout guided sampling helps preserve the advantage conferred by proximal noise initialization. Additional empirical validation is provided in Appendix B.

Method: The FLINT Framework

The analysis in § 3 motivates the two-stage design of FLINT. Since exhaustive source space optimization is redundant under the sufficiency regime (§ 3), Stage 1 (§ 4.1) efficiently anchors the initial noise via a manifold constrained proximal objective with spectrally weighted data consistency. Stage 2 (§ 4.2) then employs a bounded stochasticity schedule during guided posterior sampling, preventing excessive stochasticity from eroding the fidelity attained by this initialization (§ 3).

Stage 1: Proximal Source Initialization

Manifold-constrained proximal objective. Unlike source space MAP methods that incur massive computational costs for a deterministic exact solution, or MCMC approaches that exhaustively characterize the source posterior distribution, Stage 1 focuses solely on rapidly attaining sufficient proximity, a measurement-informed initialization statistically consistent with the generative prior. To derive a principled objective, we employ a variational relaxation, minimizing the KL divergence from a surrogate distribution qϕ(x1)=N(x1∣μϕ,ρ2I)q_\phi(x_1)=\mathcal{N}(x_1\mid\mu_\phi,\rho^2 I) to the intractable source posterior p(x1∣y)p(x_1\mid y):

min⁡ϕ KL(qϕ(x1)∥p(x1∣y))=−Eqϕ[log⁡p(y∣x1)]+KL(qϕ(x1)∥p(x1))+log⁡p(y)(6)\begin{aligned} \min_{\phi}\ \mathrm{KL}(q_\phi(x_1)\parallel p(x_1\mid y)) \\ &= -\mathbb{E}_{q_\phi}[\log p(y\mid x_1)] + \mathrm{KL}(q_\phi(x_1)\parallel p(x_1))+\log p(y) \tag*{(6)} \end{aligned}

Algorithm 1 The FLINT solver for flow-based inverse problems

Stage 1: Source-Space Proximal Initialization

Require: yy, AA, vθv_\theta, βKL\beta_{\mathrm{KL}}, λcum\lambda_{\mathrm{cum}}

  1. Initialize μϕ∼N(0,I)\mu_\phi\sim\mathcal{N}(0,I)

  2. for s=1,…,Ss=1,\ldots,S do

  3. x1←μϕ+ρ(s)ϵx_1 \leftarrow\mu_\phi+\rho^{(s)}\epsilon, ϵ∼N(0,I)\epsilon\sim\mathcal{N}(0,I)

  4. x^0←Φ^tr(x1)\hat{x}_0\leftarrow\hat{\Phi}_{\mathrm{tr}}(x_1) ▷ Algorithm 2

  5. J←ℓIR(y,x^0)+βKLKL⁡(qϕ(x1)∥p(x1))+λcumR(μϕ)\mathcal{J}\leftarrow\ell_{\mathrm{IR}}(y,\hat{x}_0)+\beta_{\mathrm{KL}}\operatorname{KL}(q_\phi(x_1)\Vert p(x_1))+\lambda_{\mathrm{cum}}\mathcal{R}(\mu_\phi) ▷ ℓIR\ell_{\mathrm{IR}}: (8)

  6. μϕ←Adam⁡(∇μϕJ)\mu_\phi\leftarrow\operatorname{Adam}(\nabla_{\mu_\phi}\mathcal{J})

  7. end for

  8. return x~1=μϕ\tilde{x}_1=\mu_\phi

Stage 2: Proximity-Preserving Posterior Sampling with Bounded Stochasticity

Require: x~1\tilde{x}_1, yy, AA, vθv_\theta, λ\lambda, cc, c∅c_\varnothing, η(t)\eta(t) ▷ η(t)\eta(t): (10)

  1. x1←x~1x_1\leftarrow\tilde{x}_1

  2. for t:1→0t:1\to0 do

  3. vt←vθ(xt,c∅)+λ(vθ(xt,c)−vθ(xt,c∅))v_t\leftarrow v_\theta(x_t,c_\varnothing)+\lambda\left(v_\theta(x_t,c)-v_\theta(x_t,c_\varnothing)\right)

  4. x^0∣t←xt−σtvt\hat{x}_{0\mid t}\leftarrow x_t-\sigma_t v_t, x^1∣t←xt+(1−σt)vt\hat{x}_{1\mid t}\leftarrow x_t+(1-\sigma_t)v_t

  5. x~0∣t←arg⁡min⁡x L(A(x),y)\tilde{x}_{0\mid t}\leftarrow\underset{x}{\arg\min}\ \mathcal{L}(A(x),y) ▷ init. at x^0∣t\hat{x}_{0\mid t}

  6. ϵ∼N(0,I)\epsilon\sim\mathcal{N}(0,I)

  7. xt+Δt←(1−σt+Δt)x~0∣t+σt+Δtx^1∣t+η(t)ϵx_{t+\Delta t}\leftarrow(1-\sigma_{t+\Delta t})\tilde{x}_{0\mid t}+\sigma_{t+\Delta t}\hat{x}_{1\mid t}+\eta(t)\epsilon

  8. end for

  9. return x0x_0

where log⁡p(y)\log p(y) is constant. Crucially, the standard KL term only constrains the global norm of μϕ\mu_\phi but cannot preclude higher-order departures from Gaussianity in source space. To encourage the optimized noise adheres to the prior manifold, we augment the objective with a higher order cumulant regularizer R(μϕ)\mathcal{R}(\mu_\phi) that penalizes non-Gaussian drift during optimization (Appendix C.1).

Combining this regularizer with the computationally efficient truncated sampling Φ^tr\hat{\Phi}_{\mathrm{tr}} (§ 2.3) and the data consistency loss (§ 4.1), we formulate the manifold-constrained proximal objective:

J(ϕ)=Ex1∼qϕ[ℓIR(y,Φ^tr(x1))]+βKL⋅KL⁡(qϕ(x1)∥p(x1))+λcum⋅R(μϕ),(7)\mathcal{J}(\phi)=\mathbb{E}_{x_1\sim q_\phi}\left[\ell_{\mathrm{IR}}(y,\hat{\Phi}_{\mathrm{tr}}(x_1))\right]+\beta_{\mathrm{KL}}\cdot\operatorname{KL}(q_\phi(x_1)\parallel p(x_1))+\lambda_{\mathrm{cum}}\cdot\mathcal{R}(\mu_\phi), \tag*{(7)}

where the expectation is approximated via a single sample Monte Carlo estimator x1=μϕ+ρϵx_1=\mu_\phi+\rho\epsilon with a fixed annealing schedule for ρ\rho. Gradients of J(ϕ)\mathcal{J}(\phi) are computed via the SDO shortcut combined with Φ^tr\hat{\Phi}_{\mathrm{tr}}, yielding a low per-iteration cost. Within just a few iterations, this optimization yields a proximity-initialized noise, a starting point residing in a low energy posterior region.

Spectrally weighted data consistency. The truncated ODE estimate x^0=Φ^tr(x1)\hat{x}_0=\hat{\Phi}_{\mathrm{tr}}(x_1) is spectrally biased: with few reverse sampling steps, high-frequency components remain largely unresolved [9], making data consistency gradients unreliable over the full spectrum and destabilizing the proximal optimization. We address this by estimating frequency dependent reliability with the Wiener filter framework [63]. For the flow-matching interpolant xtstop=(1−tstop)x0+tstopϵx_{t_{\mathrm{stop}}}=(1-t_{\mathrm{stop}})x_0+t_{\mathrm{stop}}\epsilon, the signal and noise powers at frequency ω\omega are (1−tstop)2Sx0(ω)(1-t_{\mathrm{stop}})^2S_{x_0}(\omega) and tstop2t_{\mathrm{stop}}^2, respectively, where Sx0(ω)∝∥ω∥−αS_{x_0}(\omega)\propto\lVert\omega\rVert^{-\alpha} follows the well-established pink noise model for natural images [50]. Applying the Wiener filter formula directly yields the following data consistency loss:

ℓIR(y,x0)=∥W(tstop)⊙F[A∗(Ax^0−y)]∥22,W(ω,tstop)=(1−tstop)2Sx0(ω)(1−tstop)2Sx0(ω)+tstop2,(8)\ell_{\mathrm{IR}}(y,x_0)=\left\lVert W(t_{\mathrm{stop}})\odot\mathcal{F}\left[A^*(A\hat{x}_0-y)\right]\right\rVert_2^2,\quad W(\omega,t_{\mathrm{stop}})=\frac{(1-t_{\mathrm{stop}})^2S_{x_0}(\omega)}{(1-t_{\mathrm{stop}})^2S_{x_0}(\omega)+t_{\mathrm{stop}}^2}, \tag*{(8)}

Here, F\mathcal{F} and A∗A^* denotes the 2D Fourier transform, and the adjoint of the forward operator, respectively. A∗(Ax^0−y)A^*(A\hat{x}_0-y) back-projects the measurement residual to the image domain before spectral filtering. The weight W∈[0,1]W\in[0,1] emphasizes reliable low frequencies and decays toward 0 at high frequencies. By suppressing gradients from unreliable frequency components, (8) provides stable low-frequency supervision, yielding faster convergence than full-spectrum data consistency.

Stage 2: Proximity-Preserving Posterior Sampling with Bounded Stochasticity

Stage 2 starts from the proximity-initialized source x~1=μϕ\tilde{x}_1=\mu_\phi produced by Stage 1, which provides a measurement-informed starting point. Its role is not to rediscover a measurement-consistent low-frequency structure from scratch, but rather to perform the proximity-preserving stochastic refinement along the sampling trajectory. We adopt the framework of the second sub-family of trajectory-space methods described in § 2.2. At each reverse step, this approach obtains a clean image estimate via the flow-based Tweedie’s formula, applies a data consistency correction in the clean image space, and re-noises the corrected estimate onto the generative prior manifold at the next timestep. Concretely, the next state is computed as:

xt+Δt=(1−σt+Δt)x~0∣t(y)+σt+Δtx^1∣t+η(t)ϵ,ϵ∼N(0,I),(9)x_{t+\Delta t}=(1-\sigma_{t+\Delta t})\tilde{x}_{0\mid t}(y)+\sigma_{t+\Delta t}\hat{x}_{1\mid t}+\eta(t)\epsilon,\quad\epsilon\sim\mathcal{N}(0,I), \tag*{(9)}

where σt\sigma_t denotes the noise level, and the update reinterpolates the corrected clean estimate x~0∣t(y)\tilde{x}_{0\mid t}(y) and noise estimate x^1∣t\hat{x}_{1\mid t} back onto the (t+Δt)(t+\Delta t)-manifold while injecting stochasticity scale η(t)\eta(t).

Bounded stochasticity schedule. Proposition 3.1 motivates limiting stochastic accumulation but does not uniquely determine how the stochasticity budget should be allocated over time. We design the following stochasticity schedule:

η(t)=λs⋅1−σt⋅σt,(10)\eta(t) = \lambda_s \cdot\sqrt{1-\sigma_t}\cdot\sigma_t, \tag*{(10)}

where λs\lambda_s controls the overall magnitude. The shape is deliberately chosen to endow Eq. (9) with a proximity-preserving role. At early timesteps t≈1t \approx1 (σt≈1\sigma_t \approx1), η(t)\eta(t) remains close to zero, suppressing stochastic perturbations during the phase where the coarse image layout is determined in flow-based models. Large perturbations at this stage would erode the low-energy proximal state established by Stage 1. As tt decreases to 0, η(t)\eta(t) again decays to zero, effectively concentrating stochasticity in the intermediate timesteps where perceptual details are refined without disturbing the global structure. With λs<1\lambda_s < 1, the bell-shaped profile of η(t)\eta(t) keeps ∫01η2(t) dt\int_0^1 \eta^2(t)\,dt bounded, aiming to preserve the initialization advantage throughout guided sampling. The overall algorithm is summarized in Algorithm 1.

Experiments

Experimental Setup

Datasets and metrics. Experiments are conducted on FFHQ [24] (102421024^2, 1k samples) and DIV2K [1] (2K, 800 samples), with PSNR, SSIM [61], LPIPS [68], and patch-based FID [20] (256 × 256 patches, InceptionV3) as evaluation metrics. Additionally, for ablation studies conducted on a smaller subset (100 samples), we report patch-based KID [6].

Baselines. We compare against recent flow matching approaches: FlowChef [41], FlowDPS [26], FLAIR [17], Flower [42], and FlowLPS [40], all built upon Stable Diffusion 3.5-Medium (768², NFE 50). For FLINT, the same 50 NFE budget is split into 21 NFEs for Stage 1 (K=3K = 3 truncated steps × 7 iterations) and 29 NFEs for Stage 2. Baseline configurations are detailed in Appendix E.

Problem setting. We evaluate on several linear inverse problems: SR ×8, ×12, motion deblurring with a 61 × 61 kernel at intensity 0.5, and Gaussian deblurring with a 61 × 61 kernel at standard deviation 3.0. All tasks incorporate additive Gaussian noise with σy=0.03\sigma_y = 0.03 (corresponding to 1.5% of the normalized pixel range). For text conditioning, a fixed prompt ("A high quality photo of a face") is used for FFHQ, while image adaptive captions from DAPE [64] are used for DIV2K.

Experimental Results

Flow matching model. As shown in Table 1, FLINT consistently outperforms all flow matching baselines, yielding favorable results across both distortion and perceptual quality metrics. Figure 3 corroborates these results, with structural artifacts of baseline reconstructions visibly suppressed. Extended evaluations on diffusion model backbones (Stable Diffusion 1.5) are provided in Appendix D.

MethodSuper-Resolution ×8 PSNR↑SSIM↑FID↓LPIPS↓Super-Resolution ×12 PSNR↑SSIM↑FID↓LPIPS↓Motion Deblurring PSNR↑SSIM↑FID↓LPIPS↓Gaussian Deblurring PSNR↑SSIM↑FID↓LPIPS↓
FFHQ (768 × 768)
FlowChef27.940.773104.190.43826.210.725170.390.55425.420.73388.780.47826.620.748103.130.488
FlowDPS27.080.71128.910.37926.660.73630.550.35425.020.68845.540.42725.800.69947.210.420
FLAIR27.580.69729.730.28526.770.70924.750.30729.390.75513.830.25928.680.74415.240.259
Flower28.360.79335.970.35127.150.76276.440.44426.380.75671.930.441026.960.75986.030.462
FlowLPS26.670.69130.410.38625.840.68562.160.42925.800.71521.250.36526.490.71823.460.364
Ours29.630.79521.600.21727.740.76324.260.26830.770.79914.950.18629.880.78315.140.196
DIV2K (768 × 768)
FlowChef22.580.58689.970.57821.140.516141.430.69320.310.510106.780.64721.080.517133.410.675
FlowDPS21.600.51139.230.50320.840.48347.370.55419.790.45355.840.59920.350.45661.200.614
FLAIR21.110.48430.700.38519.920.43943.120.46124.160.64417.330.30322.740.57227.730.378
Flower22.860.59541.190.47921.690.54671.510.59221.160.54480.380.58121.560.53891.030.622
FlowLPS21.780.51634.050.45020.820.47958.350.50720.640.50733.120.45120.980.49139.140.465
Ours23.100.59833.210.35620.350.49635.010.43226.550.72815.690.19724.130.62925.390.301

Table 1. Quantitative comparison on a flow matching model averaged over 1,000 FFHQ and 800 DIV2K samples using 50 NFEs under Gaussian noise (σy=0.03\sigma_y = 0.03).

Qualitative comparison for FFHQ and DIV2K datasets

Figure 3. Qualitative comparison for FFHQ and DIV2K datasets.

Computational cost and performance. Figure 4 evaluates SR ×8 and Gaussian deblurring on 1000 FFHQ samples, varying Stage 2 over {4,9,19,29}\{4, 9, 19, 29\} steps (total budgets {25,30,40,50}\{25, 30, 40, 50\}). With as few as 30 NFEs, FLINT surpasses nearly all baselines at the full 50 NFE budget on both PSNR and LPIPS. This advantage stems from the proximal initialization. Stage 1 requires only a small number of optimization iterations at low cost enabled by Sec. 2.3, which reduces the computational burden of Stage 2 by positioning the initial noise in a favorable region of the source space, requiring only a short guided trajectory to reach the subspace consistent with the measurement. Extended runtime comparisons are provided in Appendix § 14.§ 2.

Computational cost and performance for Super-Resolution ×8 and Gaussian Deblurring

Figure 4. Computational cost and performance. PSNR and LPIPS vs. sampling time (sec) for SR ×8 and Gaussian deblurring. Numbers after method names denote its NFEs.

Diffusion model. To assess applicability beyond flow matching, we further evaluate FLINT on Stable Diffusion 1.5 (5122512^2, 200 NFEs) against PSLD [46], ReSample [51], DDPG [19], and TReg [28]. As shown in Table 2, FLINT achieves the best PSNR, FID, and LPIPS on SR×4 and motion deblurring, as well as the best SSIM on the latter task. Detailed settings and qualitative comparisons are provided in Appendix § 12, with baseline configurations in Appendix § 13.§ 2.

Super-Resolution ×4Motion Deblurring
MethodPSNR↑SSIM↑FID↓LPIPS↓PSNR↑SSIM↑FID↓LPIPS↓
PSLD26.070.71246.690.30925.060.70359.610.367
ReSample25.960.84950.97<u>0.225</u>24.18<u>0.765</u>92.860.397
DDPG<u>29.73</u><u>0.809</u>84.120.305<u>26.62</u>0.75294.410.358
TReg25.220.756<u>37.35</u>0.24425.420.701<u>45.38</u><u>0.274</u>
Ours29.880.77622.360.16130.050.79133.320.182

Table 2. Quantitative comparison on a diffusion model over 1,000 FFHQ samples using 200 NFEs under additive Gaussian noise (σy=0.03\sigma_y = 0.03).

Ablation Studies

Effectiveness of stage 1: MCPO and SWDC. Table 3a isolates the contribution of each component within Stage 1, the Manifold-Constrained Proximal Objective (MCPO) and Spectrally Weighted Data Consistency (SWDC). Comparing Conf. A (random) against Conf. C (full proximal) confirms that the posterior sampling started from proximal-initialized noise yields substantial gains across all metrics. Figure 5 visually corroborates this: unconditional sampling from the proximal noise recovers a coarse structure consistent with the measurement, whereas the same procedure from a random Gaussian draw produces an entirely unrelated image. Incorporating the SWDC (B to C) improves reconstruction quality by suppressing gradients from unreliable high-frequency components during the optimization, ensuring stable convergence.

Conf.MCPOSWDCPSNR↑SSIM↑KID↓LPIPS↓Scheduleλs\lambda_sPSNR↑SSIM↑KID↓LPIPS↓
A✗–28.560.6410.0150.327front-loaded0.329.600.7690.0220.193
B✓✗29.600.7440.0080.2180.829.190.7270.0080.230
C✓✓30.110.7880.0050.1921.328.440.6390.0180.438
1.828.320.6290.0270.499
Bell-shaped0.329.590.7710.0310.208
0.830.110.7880.0050.192
1.329.880.7840.0240.305
1.829.620.7680.0260.328

Table 3. Ablation studies on Gaussian deblurring (FFHQ, 100 samples). (a) Stage 1: Components include MCPO and SWDC. (b) Stage 2: Performance of the BSS profile across λs\lambda_s.

Figure 5. Initialization quality on SR×8. Unconditional sampling from the Stage 1 output (third column) demonstrates that FLINT’s optimized noise recovers faithful coarse structures, contrasting with the unrelated results from random initialization (second column). Starting from this informed point, Stage 2 achieves high-fidelity reconstruction. Metrics are averaged over 100 FFHQ samples.

Sensitivity to the bounded stochasticity schedule (BSS). Table 3b ablates the stochasticity schedule along two axes: the magnitude λs\lambda_s and the temporal shape of η(t)\eta(t), comparing our bell-shaped schedule (Eq. (10)) against a front-loaded alternative ηmono(t)=λs1−(1−σt)2σt\eta_{\mathrm{mono}}(t)=\lambda_s\sqrt{1-(1-\sigma_t)^2}\sigma_t that decreases monotonically over t:1→0t:1\to0 and peaks at t=1t=1. Two key trends emerge. (i) Magnitude: While § 3 warns against excessive stochasticity (λs≥1.3\lambda_s\ge1.3) due to the amplified stochastic departure, suppressing it (λs→0.3\lambda_s\to0.3) limits the FLINT’s ability to perform stochastic exploration concentrated at middle timesteps, resulting in suboptimal performance. The moderate setting (λs=0.8\lambda_s=0.8) achieves the optimal balance, bounded to preserve the low-energy proximal state yet active enough to achieve a high-fidelity reconstruction. (ii) Shape: at matched λs\lambda_s, the bell-shaped schedule generally yields superior performance, particularly as λs\lambda_s increases, as front loading disrupts the proximal noise precisely when coarse structure is being established.

Discussion

The theoretical and empirical findings in § 3 predict that proximal initialization reduces the initialization gap, while bounded stochasticity preserves this advantage throughout guided sampling. Figure 6 corroborates this prediction by evaluating the reconstruction quality of Tweedie’s estimate along the sampling trajectory (visualizations in Appendix § 14.§ 3). FLINT enters the measurement-consistent subspace earlier than baselines and sustains higher reconstruction quality through convergence. The Appendix further provides extensive analyses on the effect of the cumulant regularizer (Appendix § 14.4), comparisons with alternative initialization strategies including forward noising initialization [36] and flow inversion in both deterministic [15] and stochastic variants [45] (Appendix § 14.5), the effect of prolonged source space optimization (Appendix § 14.6), and a posterior variance analysis confirming the absence of mode collapse (Appendix § 14.§ 20).

Quantitative comparison of the sampling process via Tweedie’s estimates

Figure 6. Quantitative comparison of the sampling process via Tweedie’s estimates.

Conclusion

We introduce FLINT, a two-stage framework that bridges source-space and trajectory-space methods by exploiting their coupling, offering a new design principle for flow-based inverse solvers. Through a unified stability analysis, we motivate coupling proximal source initialization with bounded stochasticity to preserve the initialization advantage during posterior sampling. FLINT employs a manifold-constrained proximal objective followed by a strategic stochasticity schedule, consistently improving reconstruction quality across diverse inverse problems at a competitive sampling cost.

Limitation. FLINT inherits the limitations of the underlying pretrained generative models, including training data biases and reduced capacity for out-of-distribution images. Reconstruction quality may degrade on scenes with high structural complexity (e.g., multiple objects or instances), where the increased ill-posedness makes it difficult to simultaneously satisfy data fidelity and prior consistency.

Acknowledgement

This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) [NO.RS-2021-II211343, Artificial Intelligence Graduate School Program (Seoul National University)], the National Research Foundation of Korea(NRF) grants funded by the Korea government(MSIT) (No. RS-2026-25585456, No. RS-2025-02263628), and Samsung Electronics Co., Ltd. (IO251217-1478-01).

Appendix

Theoretical Analysis: Assumptions, Propositions, and Proofs

Posterior Energy Bound of Principled Initialization

This appendix formalizes the interpretation introduced in Remark 1 (§ 3): when the reference point x1∗x_1^* in Proposition 3.1 is taken to be the posterior energy minimizer, source-space proximity controls a likelihood energy upper bound, while a random Gaussian draw typically lies farther away in source space. A principled initialization refers to an initial noise placed deliberately close to the source-space solution, as opposed to a random draw from the prior. We define the posterior energy as the negative log-posterior up to a constant:

E(x1):=−log⁡p(x1∣y)+C=12σy2∥y−A(Φ(x1))∥22⏟Elike(x1)+12∥x1∥22⏟Eprior(x1),(11)E(x_1) := -\log p(x_1 \mid y) + C = \underbrace{\frac{1}{2\sigma_y^2}\lVert y-\mathcal{A}(\Phi(x_1))\rVert_2^2}_{E_{\mathrm{like}}(x_1)} + \underbrace{\frac{1}{2}\lVert x_1\rVert_2^2}_{E_{\mathrm{prior}}(x_1)}, \tag*{(11)}

and choose a source-space solution x1∗∈arg⁡min⁡x1E(x1)x_1^* \in\arg\min_{x_1} E(x_1). Throughout the Section A.1, nn denotes the reference residual, defined by n:=y−A(Φ(x1∗))n := y-\mathcal{A}(\Phi(x_1^*)).

We state the assumptions underlying Proposition A.1.

Assumption A.1 (Lipschitz generative map). The generative map Φ:Rd→Rd\Phi:\mathbb{R}^d \to\mathbb{R}^d is LL-Lipschitz continuous: for all x1,x1′∈Rdx_1,x_1' \in\mathbb{R}^d,

∥Φ(x1)−Φ(x1′)∥2≤L∥x1−x1′∥2.(12)\lVert\Phi(x_1)-\Phi(x_1')\rVert_2 \le L\lVert x_1-x_1'\rVert_2. \tag*{(12)}

Assumption A.2 (Lipschitz forward operator). The forward operator A\mathcal{A} is LAL_A-Lipschitz continuous in a neighbourhood U\mathcal{U} of Φ(x1∗)\Phi(x_1^*): for all u,v∈Uu,v \in\mathcal{U},

∥A(u)−A(v)∥2≤LA∥u−v∥2.(13)\lVert\mathcal{A}(u)-\mathcal{A}(v)\rVert_2 \le L_A\lVert u-v\rVert_2. \tag*{(13)}

When A\mathcal{A} is linear, LA=∥A∥opL_A=\lVert\mathcal{A}\rVert_{\mathrm{op}} (the largest singular value of A\mathcal{A}). For nonlinear operators, a finite local Lipschitz constant can be chosen on a sufficiently small neighbourhood whenever A\mathcal{A} is continuously differentiable.

Assumption A.3 (Typical-set norm of a source-space solution). The source-space solution x1∗x_1^* satisfies

∥x1∗∥2=Θ(d).(14)\lVert x_1^*\rVert_2=\Theta(\sqrt{d}). \tag*{(14)}

This holds when x1∗≈Φ−1(x0∗)x_1^* \approx\Phi^{-1}(x_0^*) and the pretrained flow model transports N(0,Id)\mathcal{N}(0,I_d) to the data distribution, since Gaussian concentration implies ∥z∥2≈d\lVert z\rVert_2\approx\sqrt{d} with high probability for z∼N(0,Id)z\sim\mathcal{N}(0,I_d).

Proposition A.1 (Posterior energy bound). Let Assumptions A.1–A.3 hold. Let x~1∈Rd\tilde{x}_1 \in\mathbb{R}^d satisfy ∥x~1−x1∗∥2≤δ\lVert\tilde{x}_1-x_1^*\rVert_2\le\delta. Then:

(i) Likelihood energy upper bound:

Elike(x~1)≤(∥n∥2+LA⋅L⋅δ)22σy2.(15)E_{\mathrm{like}}(\tilde{x}_1)\le\frac{\left(\lVert n\rVert_2+L_A\cdot L\cdot\delta\right)^2}{2\sigma_y^2}. \tag*{(15)}

(ii) Prior energy near-equality: Both x~1\tilde{x}_1 (constructed via SLERP with ∥x~1∥2≈d\lVert\tilde{x}_1\rVert_2\approx\sqrt{d}) and x1rand∼N(0,Id)x_1^{\mathrm{rand}}\sim\mathcal{N}(0,I_d) satisfy

Eprior(x~1)≈Eprior(x1rand)≈d2.(16)E_{\mathrm{prior}}(\tilde{x}_1)\approx E_{\mathrm{prior}}(x_1^{\mathrm{rand}})\approx\frac{d}{2}. \tag*{(16)}

(iii) Concentration of random initialization: For x1rand∼N(0,Id)x_1^{\mathrm{rand}}\sim\mathcal{N}(0,I_d),

∥x1rand−x1∗∥2=Θ(d)with high probability.(17)\lVert x_1^{\mathrm{rand}}-x_1^*\rVert_2=\Theta(\sqrt{d})\quad\text{with high probability}. \tag*{(17)}

Since the posterior energy is the sum of the likelihood and prior terms, Claims (i) and (ii) together give a proximity-dependent upper bound on the posterior energy.

Proof. We now prove the three claims of Proposition A.1.

Part (i): Upper bound on Elike(x~1)E_{\mathrm{like}}(\tilde{x}_1). Since y=A(x0∗)+ny=A(x_0^*)+n with x0∗=Φ(x1∗)x_0^*=\Phi(x_1^*), we have

∥y−A(Φ(x~1))∥2=∥A(Φ(x1∗))+n−A(Φ(x~1))∥2≤∥n∥2+∥A(Φ(x1∗))−A(Φ(x~1))∥2(triangle inequality)≤∥n∥2+LA∥Φ(x1∗)−Φ(x~1)∥2(Assumption A.2)≤∥n∥2+LA⋅L∥x1∗−x~1∥2(Assumption A.1)≤∥n∥2+LA⋅L⋅δ.(∥x~1−x1∗∥2≤δ)\begin{aligned} \lVert y-A(\Phi(\tilde{x}_1))\rVert_2 &=\lVert A(\Phi(x_1^*))+n-A(\Phi(\tilde{x}_1))\rVert_2\\ &\le\lVert n\rVert_2+\lVert A(\Phi(x_1^*))-A(\Phi(\tilde{x}_1))\rVert_2 &&\text{(triangle inequality)}\\ &\le\lVert n\rVert_2+L_A\lVert\Phi(x_1^*)-\Phi(\tilde{x}_1)\rVert_2 &&\text{(Assumption A.2)}\\ &\le\lVert n\rVert_2+L_A\cdot L\lVert x_1^*-\tilde{x}_1\rVert_2 &&\text{(Assumption A.1)}\\ &\le\lVert n\rVert_2+L_A\cdot L\cdot\delta. &&\text{(}\lVert\tilde{x}_1-x_1^*\rVert_2\le\delta\text{)} \end{aligned}

Squaring and dividing by 2σy22\sigma_y^2 gives the stated bound.

Part (ii): Prior energy near-equality. For x1rand∼N(0,Id)x_1^{\mathrm{rand}}\sim\mathcal{N}(0,I_d), the strong law of large numbers gives ∥x1rand∥22=d(1+o(1))\lVert x_1^{\mathrm{rand}}\rVert_2^2=d(1+o(1)) with high probability, so Eprior(x1rand)≈d/2E_{\mathrm{prior}}(x_1^{\mathrm{rand}})\approx d/2. For x~1\tilde{x}_1 constructed via SLERP (Eq. (5)), the interpolation preserves ∥x~1∥2≈d\lVert\tilde{x}_1\rVert_2\approx\sqrt{d} by construction, giving Eprior(x~1)≈d/2E_{\mathrm{prior}}(\tilde{x}_1)\approx d/2.

Part (iii): Concentration of x1randx_1^{\mathrm{rand}}. Expand the squared distance:

∥x1rand−x1∗∥22=∥x1rand∥22−2⟨x1rand,x1∗⟩+∥x1∗∥22.(18)\lVert x_1^{\mathrm{rand}}-x_1^*\rVert_2^2 =\lVert x_1^{\mathrm{rand}}\rVert_2^2-2\langle x_1^{\mathrm{rand}},x_1^*\rangle+\lVert x_1^*\rVert_2^2. \tag*{(18)}

Term 1. By the strong law of large numbers, ∥x1rand∥22=d(1+o(1))\lVert x_1^{\mathrm{rand}}\rVert_2^2=d(1+o(1)) with high probability.

Term 2. Since x1randx_1^{\mathrm{rand}} is independent of x1∗x_1^*, E[⟨x1rand,x1∗⟩]=∥x1∗∥22=Θ(d)\mathbb{E}[\langle x_1^{\mathrm{rand}},x_1^*\rangle]=\lVert x_1^*\rVert_2^2=\Theta(d), so ∣⟨x1rand,x1∗⟩∣/d→0\lvert\langle x_1^{\mathrm{rand}},x_1^*\rangle\rvert/d\to0 in L2L^2, and the cross term is o(d)o(d).

Term 3. By Assumption A.3, ∥x1∗∥22=Θ(d)\lVert x_1^*\rVert_2^2=\Theta(d).

Combining all three terms, ∥x1rand−x1∗∥22=Θ(d)\lVert x_1^{\mathrm{rand}}-x_1^*\rVert_2^2=\Theta(d), and therefore ∥x1rand−x1∗∥2=Θ(d)\lVert x_1^{\mathrm{rand}}-x_1^*\rVert_2=\Theta(\sqrt{d}) with high probability. □

Remark 1 (Total energy gap). Since Claim (ii) establishes that EpriorE_{\mathrm{prior}} is approximately equal for both initializations, the total energy gap is driven entirely by the likelihood term:

E(x~1)−E(x1rand)≈Elike(x~1)−Elike(x1rand).(19)E(\tilde{x}_1)-E(x_1^{\mathrm{rand}}) \approx E_{\mathrm{like}}(\tilde{x}_1)-E_{\mathrm{like}}(x_1^{\mathrm{rand}}). \tag*{(19)}

Claim (i) bounds Elike(x~1)E_{\mathrm{like}}(\tilde{x}_1) by a quantity controlled by δ\delta, while Claim (iii) implies that ∥x1rand−x1∗∥2=Θ(d)≫δ\lVert x_1^{\mathrm{rand}}-x_1^*\rVert_2=\Theta(\sqrt{d})\gg\delta, incurring a substantially larger likelihood energy upper bound. Consequently, when δ≪d\delta\ll\sqrt{d} and the same Lipschitz bound applies to both initializations, principled initialization admits a tighter distance-based posterior energy upper bound than a random draw.

Proof of Proposition 3.1

In the reverse-time convention [2, 54], tt decreases from 1 (noise) to 0 (data), so dt<0dt<0. Set τ=1−t\tau=1-t and Xτ:=x1−τX_\tau:=x_{1-\tau}. Define the sampling velocity vˉt(⋅∣y):=−vt(⋅∣y)\bar{v}_t(\cdot\mid y):=-v_t(\cdot\mid y), retaining the original noise-level index tt; its value at sampling time τ\tau is vˉ1−τ\bar{v}_{1-\tau}. Then (3) becomes

dXτ=[vˉ1−τ(Xτ∣y)+g1−τ22∇Xτlog⁡p1−τ(Xτ∣y)]dτ+g1−τ dWτ,(20)dX_\tau=\left[\bar{v}_{1-\tau}(X_\tau\mid y)+\frac{g_{1-\tau}^2}{2}\nabla_{X_\tau}\log p_{1-\tau}(X_\tau\mid y)\right]d\tau+g_{1-\tau}\,dW_\tau, \tag*{(20)}

where WτW_\tau is a standard Wiener process in increasing sampling time.

Assumption A.4 (One-sided Lipschitz posterior velocity). The posterior velocity vˉt(⋅∣y)\bar{v}_t(\cdot\mid y) satisfies a one-sided Lipschitz condition with a measurable, integrable parameter mv:[0,1]→Rm_v:[0,1]\to\mathbb{R}: for all x,x′∈Rdx,x'\in\mathbb{R}^d and t∈[0,1]t\in[0,1],

⟨vˉt(x∣y)−vˉt(x′∣y),x−x′⟩≤mv(t)∥x−x′∥22.\langle\bar{v}_t(x\mid y)-\bar{v}_t(x'\mid y),x-x'\rangle\le m_v(t)\lVert x-x'\rVert_2^2.

The parameter mv(t)m_v(t) may take any sign; negative values indicate contraction in the sampling direction.

Assumption A.5 (One-sided Lipschitz posterior score). The posterior score ∇xlog⁡pt(x∣y)\nabla_x\log p_t(x\mid y) satisfies a one-sided Lipschitz condition with a measurable, integrable parameter ms:[0,1]→Rm_s:[0,1]\to\mathbb{R}: for all x,x′∈Rdx,x'\in\mathbb{R}^d and t∈[0,1]t\in[0,1],

⟨∇log⁡pt(x∣y)−∇log⁡pt(x′∣y),x−x′⟩≤ms(t)∥x−x′∥22.\langle\nabla\log p_t(x\mid y)-\nabla\log p_t(x'\mid y),x-x'\rangle\le m_s(t)\lVert x-x'\rVert_2^2.

Remark 2 (Comparison with two-sided Lipschitz). A standard two-sided Lipschitz constant bounds the operator norm of the full Jacobian, which is always nonnegative. The one-sided constant above bounds to the maximum eigenvalue of the symmetric part of the Jacobian, which can be negative. In particular, log-concavity of pt(⋅∣y)p_t(\cdot\mid y) allows a nonpositive choice of ms(t)m_s(t), in which case the score term contributes a nonpositive term to the effective contraction rate. This can reduce the prefactor in our bound by offsetting expansion from the posterior velocity.

Setup and notation. We work with (S10) for τ∈[0,1]\tau\in[0,1], with yy and the deterministic schedule gg fixed. The total drift is

b(x,τ):=vˉ1−τ(x∣y)+g1−τ22∇xlog⁡p1−τ(x∣y).b(\mathbf{x},\tau) := \bar{v}_{1-\tau}(\mathbf{x}\mid y) + \frac{g_{1-\tau}^{2}}{2}\nabla_{\mathbf{x}}\log p_{1-\tau}(\mathbf{x}\mid y).

Under Assumptions A.4–A.5, bb inherits a one-sided Lipschitz property with a time-varying parameter:

⟨b(x,τ)−b(x′,τ),x−x′⟩≤m(1−τ)∥x−x′∥22,m(t):=mv(t)+gt22ms(t).(21)\left\langle b(\mathbf{x},\tau)-b(\mathbf{x}',\tau),\mathbf{x}-\mathbf{x}'\right\rangle\le m(1-\tau)\left\|\mathbf{x}-\mathbf{x}'\right\|_{2}^{2}, \qquad m(t):=m_v(t)+\frac{g_t^{2}}{2}m_s(t). \tag*{(21)}

Its time integral defines the contraction parameter:

M:=∫01m(t) dt=∫01mv(t) dt+12∫01gt2ms(t) dt.M:=\int_{0}^{1}m(t)\,dt=\int_{0}^{1}m_v(t)\,dt+\frac{1}{2}\int_{0}^{1}g_t^{2}m_s(t)\,dt.

Note that MM may be negative, zero, or positive.

Triangle inequality decomposition. We decompose the error via two intermediate reference trajectories. Couple all processes with the same Wiener process W‾t\overline{W}_t:

∥Φg(x~1)−x0∗∥2≤∥Φg(x~1)−Φg(x1∗)∥2+∥Φg(x1∗)−x0∗∥2.\left\|\Phi_g(\widetilde{\mathbf{x}}_1)-\mathbf{x}_0^*\right\|_2 \le\left\|\Phi_g(\widetilde{\mathbf{x}}_1)-\Phi_g(\mathbf{x}_1^*)\right\|_2+\left\|\Phi_g(\mathbf{x}_1^*)-\mathbf{x}_0^*\right\|_2.

Squaring and applying (a+b)2≤2a2+2b2(a+b)^2\le2a^2+2b^2 gives

E[∥Φg(x~1)−x0∗∥22]≤2E[∥Φg(x~1)−Φg(x1∗)∥22]+2E[∥Φg(x1∗)−x0∗∥22].(22)\mathbb{E}\left[\left\|\Phi_g(\widetilde{\mathbf{x}}_1)-\mathbf{x}_0^*\right\|_2^2\right]\le2\mathbb{E}\left[\left\|\Phi_g(\widetilde{\mathbf{x}}_1)-\Phi_g(\mathbf{x}_1^*)\right\|_2^2\right]+2\mathbb{E}\left[\left\|\Phi_g(\mathbf{x}_1^*)-\mathbf{x}_0^*\right\|_2^2\right]. \tag*{(22)}

Bounding Term A (initialization sensitivity). Drive both trajectories Φg(x~1)\Phi_g(\widetilde{\mathbf{x}}_1) and Φg(x1∗)\Phi_g(\mathbf{x}_1^*) with the same Wiener process. Define the pathwise error eτ:=Xτ(x~1)−Xτ(x1∗)\mathbf{e}_\tau:=\mathbf{X}^{(\widetilde{\mathbf{x}}_1)}_\tau-\mathbf{X}^{(\mathbf{x}_1^*)}_\tau. Subtracting the two SDEs, the diffusion terms cancel exactly:

deτ=[b(Xτ(x~1),τ)−b(Xτ(x1∗),τ)]dτ,d\mathbf{e}_\tau=\left[b\left(\mathbf{X}^{(\widetilde{\mathbf{x}}_1)}_\tau,\tau\right)-b\left(\mathbf{X}^{(\mathbf{x}_1^*)}_\tau,\tau\right)\right]d\tau,

so eτ\mathbf{e}_\tau satisfies a deterministic ODE. Differentiating the squared norm and applying (S11) gives, for almost every τ\tau, almost surely,

ddτ∥eτ∥22=2⟨eτ,b(Xτ(x~1),τ)−b(Xτ(x1∗),τ)⟩≤2m(1−τ)∥eτ∥22.\frac{d}{d\tau}\left\|\mathbf{e}_\tau\right\|_2^2=2\left\langle\mathbf{e}_\tau,b\left(\mathbf{X}^{(\widetilde{\mathbf{x}}_1)}_\tau,\tau\right)-b\left(\mathbf{X}^{(\mathbf{x}_1^*)}_\tau,\tau\right)\right\rangle\le2m(1-\tau)\left\|\mathbf{e}_\tau\right\|_2^2.

The initial condition is ∥e0∥22=∥x~1−x1∗∥22≤δ2\left\|\mathbf{e}_0\right\|_2^2=\left\|\widetilde{\mathbf{x}}_1-\mathbf{x}_1^*\right\|_2^2\le\delta^2. Gronwall’s inequality [59] gives the pathwise bound

∥e1∥22≤exp⁡(∫012m(1−τ) dτ)δ2=e2Mδ2.\left\|\mathbf{e}_1\right\|_2^2\le\exp\left(\int_{0}^{1}2m(1-\tau)\,d\tau\right)\delta^2=e^{2M}\delta^2.

Taking expectations yields

E[∥Φg(x~1)−Φg(x1∗)∥22]≤e2Mδ2.(23)\mathbb{E}\left[\left\|\Phi_g(\widetilde{\mathbf{x}}_1)-\Phi_g(\mathbf{x}_1^*)\right\|_2^2\right]\le e^{2M}\delta^2. \tag*{(23)}

Bounding Term B (stochastic departure accumulation). Define ξτ:=Xτ(η)−Xτ(0)\boldsymbol{\xi}_\tau:=\mathbf{X}^{(\eta)}_\tau-\mathbf{X}^{(0)}_\tau, the difference between

  • Xτ(η)\mathbf{X}^{(\eta)}_\tau: trajectory of (S10) initialized at X0(η)=x1∗\mathbf{X}^{(\eta)}_0=\mathbf{x}_1^*, and

  • Xτ(0)\mathbf{X}^{(0)}_\tau: drift ODE trajectory, dXτ(0)=b(Xτ(0),τ)dτd\mathbf{X}^{(0)}_\tau=b(\mathbf{X}^{(0)}_\tau,\tau)d\tau, initialized at X0(0)=x1∗\mathbf{X}^{(0)}_0=\mathbf{x}_1^*, so that X1(0)=x0∗\mathbf{X}^{(0)}_1=\mathbf{x}_0^*.

Here (0)(0) denotes removal of only the Brownian term, with the same schedule gg retained in bb. Both trajectories share the same total drift bb, so

dξτ=[b(Xτ(η),τ)−b(Xτ(0),τ)]dτ+g1−τ dWτ,ξ0=0.d\xi_\tau= \left[b\left(X_\tau^{(\eta)},\tau\right)-b\left(X_\tau^{(0)},\tau\right)\right]d\tau+ g_{1-\tau}\,dW_\tau,\qquad\xi_0=0.

Applying Itô’s lemma to ∥ξτ∥22\|\xi_\tau\|_2^2 gives

d∥ξτ∥22=2⟨ξτ,dξτ⟩+dg1−τ2 dτ.d\|\xi_\tau\|_2^2 = 2\langle\xi_\tau,d\xi_\tau\rangle+ d g_{1-\tau}^2\,d\tau.

Using the one-sided bound (S11), a standard localization and integrating-factor argument, followed by Fatou’s lemma, yields Gronwall’s estimate in the original time variable:

E∥ξ1∥22≤d∫01gt2exp⁡(2∫0tm(u) du)dt≤e2M+d⋅G.(24)\mathbb{E}\|\xi_1\|_2^2 \le d\int_0^1 g_t^2\exp\left(2\int_0^t m(u)\,du\right)dt \le e^{2M_+}d\cdot G. \tag*{(24)}

where M+:=max⁡(0,sup⁡s∈[0,1]∫0sm(u) du)M_+ := \max\left(0,\sup_{s\in[0,1]}\int_0^s m(u)\,du\right) controls the worst-case partial accumulation along the trajectory. Therefore,

E[∥Φg(x1∗)−x0∗∥22]≤e2M+d⋅G.(25)\mathbb{E}\left[\left\|\Phi_g(x_1^*)-x_0^*\right\|_2^2\right]\le e^{2M_+}d\cdot G. \tag*{(25)}

Combining the bounds. Since M≤M+M\le M_+, substituting (S13) and (S15) into (S12) gives

E[∥Φg(x~1)−x0∗∥22]≤2e2Mδ2+2e2M+d⋅G≤2e2M+(δ2+d⋅G).\mathbb{E}\left[\left\|\Phi_g(\widetilde{x}_1)-x_0^*\right\|_2^2\right]\le2e^{2M}\delta^2+2e^{2M_+}d\cdot G\le2e^{2M_+}\left(\delta^2+d\cdot G\right).

This completes the proof.

Additional Empirical Validation: Erosion by Excessive Stochasticity

This section provides additional empirical validation for the erosion phenomenon identified in Section 3, complementing the joint analysis of Figure 2(a) with a controlled experiment that isolates the effect of excessive cumulative stochasticity from the initialization gap. We fix the initialization at either proximal (C0=0.4C_0=0.4) or random (C0=π/2C_0=\pi/2) and vary the cumulative stochasticity GG. Under this design, Figure S1 shows that at low GG, proximal initialization substantially outperforms random initialization across both PSNR and LPIPS, confirming that a well-chosen starting point confers a meaningful reconstruction advantage when cumulative stochasticity is bounded. As GG grows, the performance gap narrows and eventually vanishes. The direction of this trend agrees with the monotone dependence of the bound in Proposition 3.1 on GG, although the bound itself does not predict that the gap closes. Figure S1 corroborates this qualitatively. At low stochasticity (G=0.008G=0.008), the proximal initialization produces reconstructions that are perceptually sharper and more faithful to the ground truth than the random initialization, demonstrating that the initialization advantage translates into visible quality differences. At high stochasticity (G=0.12G=0.12), both initialization types yield reconstructions of comparable and degraded quality, visually confirming that excessive cumulative noise injection overrides any benefit from a principled starting point. Together, these results suggest that bounding GG plays a key role in preserving the initialization advantage throughout guided sampling.

Figure S1. Additional empirical validation for erosion by excessive stochasticity. (a) PSNR and LPIPS as a function of the cumulative stochasticity GG for proximal initialization (C0=0.4C_0 = 0.4) and random initialization (C0=π/2C_0 = \pi/2). Proximal initialization outperforms random initialization at low GG, while the performance gap narrows as GG increases. (b) Qualitative comparison across initialization types (proximal vs. random, rows) and stochasticity levels (high G=0.12G = 0.12 vs. low G=0.008G = 0.008, columns).

Further Details on FLINT Algorithm

Stage 1: Proximal Source Initialization

We cast source-space initialization as variational optimization by introducing a variational distribution qϕ(x1)=N(x1∣μϕ,ρ2Id)q_\phi(x_1)=\mathcal{N}(x_1\mid\mu_\phi,\rho^2 I_d) over the initial noise and minimizing the objective in (7) of the main paper. The expectation in (7) is approximated by a single reparameterized sample per iteration, i.e., x1=μϕ+ρ εx_1=\mu_\phi+\rho\,\varepsilon, ε∼N(0,Id)\varepsilon\sim\mathcal{N}(0,I_d). We find this sufficient in practice given the smoothness of ℓIR\ell_{\mathrm{IR}} over the spectrally filtered subspace 4.1. Gradients ∇ϕJ(ϕ)\nabla_\phi\mathcal{J}(\phi) are computed via the SDO shortcut combined with the truncated ODE forward pass.

Closed-form KL term. Since both qϕq_\phi and the prior p(x1)=N(0,Id)p(x_1)=\mathcal{N}(0,I_d) are Gaussian, the KL divergence admits a closed form. For two dd-dimensional Gaussians with diagonal covariance,

KL⁡(N(μ,ρ2Id) ∥ N(0,Id))=12[tr⁡(ρ2Id)+μTId−1μ−d+log⁡det⁡(Id)det⁡(ρ2Id)].(26)\operatorname{KL}\left(\mathcal{N}(\mu,\rho^2 I_d)\,\middle\|\,\mathcal{N}(0,I_d)\right)=\frac{1}{2}\left[\operatorname{tr}(\rho^2 I_d)+\mu^\mathsf{T}I_d^{-1}\mu-d+\log\frac{\det(I_d)}{\det(\rho^2 I_d)}\right]. \tag*{(26)}

which, upon substituting det⁡(ρ2Id)=ρ2d\det(\rho^2 I_d) = \rho^{2d} and log⁡det⁡(Id)=0\log\det(I_d) = 0, simplifies to

KL⁡(qϕ∥p)=12(∥μϕ∥22+dρ2−d−dlog⁡ρ2).(27)\operatorname{KL}(q_\phi\mathbin{\|} p) = \frac{1}{2}\left(\lVert\mu_\phi\rVert_2^2 + d\rho^2 - d - d\log\rho^2\right). \tag*{(27)}

This term simultaneously penalizes the magnitude of μϕ\mu_\phi (through ∥μϕ∥22\lVert\mu_\phi\rVert_2^2) and constrains the variance ρ2\rho^2 toward unity, regularizing qϕq_\phi toward p(x1)p(x_1) in second-order statistics.

Closed-form cumulant regularizer. The KL term alone cannot preclude higher-order departures from the Gaussian prior, for instance, a heavy-tailed or skewed coordinate distribution that shares the first two moments of N(0,1)\mathcal{N}(0,1). To address this, we include the cumulant regularizer R(μϕ)\mathcal{R}(\mu_\phi), which penalizes non-zero standardized skewness and excess kurtosis of the per-channel coordinate distribution of μϕ\mu_\phi. Treating the HWHW spatial coordinates of channel cc as an empirical sample, define the per-channel empirical mean and variance:

μˉc=1HW∑i=1HW(μϕ)c,i,s^c2=1HW∑i=1HW[(μϕ)c,i−μˉc]2.(28)\bar{\mu}_c = \frac{1}{HW}\sum_{i=1}^{HW}(\mu_\phi)_{c,i}, \qquad\hat{s}_c^2 = \frac{1}{HW}\sum_{i=1}^{HW}\left[(\mu_\phi)_{c,i}-\bar{\mu}_c\right]^2. \tag*{(28)}

The per-channel standardized skewness γ1,c\gamma_{1,c} and excess kurtosis γ2,c\gamma_{2,c} are then

γ1,c(μϕ)=1HW∑i=1HW((μϕ)c,i−μˉcs^c)3,(29)\gamma_{1,c}(\mu_\phi) = \frac{1}{HW}\sum_{i=1}^{HW}\left(\frac{(\mu_\phi)_{c,i}-\bar{\mu}_c}{\hat{s}_c}\right)^3, \tag*{(29)}
γ2,c(μϕ)=1HW∑i=1HW((μϕ)c,i−μˉcs^c)4−3,(30)\gamma_{2,c}(\mu_\phi) = \frac{1}{HW}\sum_{i=1}^{HW}\left(\frac{(\mu_\phi)_{c,i}-\bar{\mu}_c}{\hat{s}_c}\right)^4 - 3, \tag*{(30)}

where both quantities vanish for a perfectly Gaussian coordinate distribution. The regularizer averages these penalties over the CC channels:

R(μϕ)=1C∑c=1C[112γ1,c2(μϕ)+148γ2,c2(μϕ)].(31)\mathcal{R}(\mu_\phi) = \frac{1}{C}\sum_{c=1}^{C}\left[\frac{1}{12}\gamma_{1,c}^2(\mu_\phi) + \frac{1}{48}\gamma_{2,c}^2(\mu_\phi)\right]. \tag*{(31)}

The coefficients 112\frac{1}{12} and 148\frac{1}{48} are not chosen ad hoc but follow from the Edgeworth expansion of log⁡p\log p around N(0,1)\mathcal{N}(0,1): at third and fourth cumulant order, the expansion yields contributions of κ3212\frac{\kappa_3^2}{12} and κ4248\frac{\kappa_4^2}{48} to KL⁡(p∥N(0,1))\operatorname{KL}(p\Vert\mathcal{N}(0,1)) [35]. Consequently, R\mathcal{R} constitutes a second-order approximation to the KL divergence between the empirical marginal coordinate distribution of each channel and N(0,1)\mathcal{N}(0,1). Together, the KL term controls the norm of μϕ\boldsymbol{\mu}_{\phi}, while R\mathcal{R} suppresses skewness and excess kurtosis, jointly reducing the risk of the optimized noise drifting outside the training support of the pretrained flow model during optimization.

Noise annealing schedule. The variance ρ\rho is linearly annealed over KK optimization iterations:

ρ(s)=ρmax⁡−sS(ρmax⁡−ρmin⁡),s=0,1,…,S,(32)\rho^{(s)}=\rho_{\max}-\frac{s}{S}(\rho_{\max}-\rho_{\min}),\qquad s=0,1,\ldots,S, \tag*{(32)}

with ρmin⁡=0.02\rho_{\min}=0.02. Large ρ\rho in early iterations smooths the optimization landscape and prevents premature convergence to suboptimal μϕ\boldsymbol{\mu}_{\phi}. As ρ\rho decays toward ρmin⁡\rho_{\min}, gradient estimates concentrate around μϕ\boldsymbol{\mu}_{\phi}, enabling fine-grained refinement within the identified low-energy region.

Stage 2: Proximity-Preserving Posterior Sampling with Bounded Stochasticity

At the start of Stage 2, the sample x~1=μϕ\widetilde{x}_1=\boldsymbol{\mu}_{\phi} produced by Stage 1 replaces the standard random initialization, positioning the sampler within a low posterior energy region from the outset. Each reverse step proceeds through four sequential operations.

Text-conditional velocity field. At each timestep tt, the pretrained flow model is queried under the text condition cc with a fixed classifier-free guidance scale λ\lambda:

vt(xt)=vθ(xt,c∅)+λ(vθ(xt,c)−vθ(xt,c∅)).(33)v_t(x_t)=v_{\theta}(x_t,c_{\varnothing})+\lambda\left(v_{\theta}(x_t,c)-v_{\theta}(x_t,c_{\varnothing})\right). \tag*{(33)}

Decomposition via Tweedie’s formula. The velocity vt(xt)v_t(x_t) simultaneously yields a clean image estimate x^0∣t\widehat{x}_{0\mid t} and a source noise estimate x^1∣t\widehat{x}_{1\mid t} via the flow-based Tweedie’s formula:

x^0∣t=xt−σtvt(xt),x^1∣t=xt+(1−σt)vt(xt),(34)\widehat{x}_{0\mid t}=x_t-\sigma_t v_t(x_t),\qquad\widehat{x}_{1\mid t}=x_t+(1-\sigma_t)v_t(x_t), \tag*{(34)}

where σt\sigma_t denotes the noise schedule.

Measurement-consistency correction.

x~0∣t(y)=arg⁡min⁡x L(A(x),y)=x^0∣t−β(t)∇x^0∣tL(A(x^0∣t),y),(35)\widetilde{x}_{0\mid t}(y)=\underset{x}{\arg\min}\ \mathcal{L}(\mathcal{A}(x),y)=\widehat{x}_{0\mid t}-\beta(t)\nabla_{\widehat{x}_{0\mid t}}\mathcal{L}(\mathcal{A}(\widehat{x}_{0\mid t}),y), \tag*{(35)}

where L\mathcal{L} measures the discrepancy between the forward projection of the current estimate and the observed measurement, and β(t)\beta(t) is a time-varying data consistency guidance scale. The loss L\mathcal{L} in Eq. (35) is instantiated as a weighted interpolation between a Back-Projection (BP) objective and a Least-Squares (LS) objective [19]:

L(A(x^0∣t),y)=(1−ωt)∥y−A†(A(x^0∣t))∥22+ωt∥y−A(x^0∣t)∥22,(36)\mathcal{L}(\mathcal{A}(\widehat{x}_{0\mid t}),y)=(1-\omega_t)\left\|y-\mathcal{A}^{\dagger}(\mathcal{A}(\widehat{x}_{0\mid t}))\right\|_2^2+\omega_t\left\|y-\mathcal{A}(\widehat{x}_{0\mid t})\right\|_2^2, \tag*{(36)}

where A†\mathcal{A}^{\dagger} is the pseudo-inverse of A\mathcal{A}. The interpolation weight ωt=(1−σω(t))ϕ\omega_t=(1-\sigma_{\omega}(t))^{\phi} with ϕ=0.8\phi=0.8 transitions from a BP dominated correction at high noise levels to an LS dominated correction as t→0t\to0. For flow matching models, σω(t)=σt\sigma_{\omega}(t)=\sigma_t. For diffusion models, σω(t)=1−αˉt\sigma_{\omega}(t)=1-\bar{\alpha}_t.

Euler update with bounded stochasticity. To preserve the initialization advantage from Stage 1, the next state is obtained by renoising the corrected clean estimate x~0∣t(y)\widetilde{x}_{0\mid t}(y) to the (t+Δt)(t+\Delta t)-manifold with stochasticity injected into the source noise component under the bounded schedule η(t)\eta(t):

xt+Δt=(1−σt+Δt)x~0∣t(y)+σt+Δtx^1∣t+η(t)ϵ,ϵ∼N(0,I).(37)x_{t+\Delta t}=(1-\sigma_{t+\Delta t})\widetilde{x}_{0\mid t}(y)+\sigma_{t+\Delta t}\widehat{x}_{1\mid t}+\eta(t)\epsilon,\qquad\epsilon\sim\mathcal{N}(0,I). \tag*{(37)}

The complete inference procedure is given in Algorithm 1.

FLINT in Diffusion Model

Datasets and Metrics

Quantitative evaluation is conducted on 1,000 high resolution images from the FFHQ dataset [24]. Distortion is measured via PSNR and SSIM [61], and perceptual quality via LPIPS [68] and a patch based FID [20] computed on 128×128128\times128 patches using InceptionV3 features.

Algorithm 2 Truncated Sampling with SDO Shortcut

Require: x1x_1, vθv_\theta, (c,c∅)(c, c_\emptyset), λ\lambda, KK

  1. x←x1x \leftarrow x_1

  2. for i=1,…,K−1i = 1, \ldots, K - 1 do

  3. v←vθ(x,c∅)+λ(vθ(x,c)−vθ(x,c∅))v \leftarrow v_\theta(x, c_\emptyset) + \lambda\left(v_\theta(x, c) - v_\theta(x, c_\emptyset)\right)

  4. if i≠1i \ne1 then

  5. v←stop_grad⁡(v)v \leftarrow\operatorname{stop\_grad}(v) ▷ SDO shortcut: retain graph only at i=1i = 1

  6. end if

  7. x←x+(τi+1−τi)vx \leftarrow x + (\tau_{i+1} - \tau_i)v ▷ Euler update; τi=τi(N)\tau_i = \tau_i^{(N)}

  8. end for

  9. tstop←τK−1t_{\mathrm{stop}} \leftarrow\tau_{K-1}

  10. vtstop←stop_grad⁡(vθ(x,c∅)+λ(vθ(x,c)−vθ(x,c∅)))v_{t_{\mathrm{stop}}} \leftarrow\operatorname{stop\_grad}\left(v_\theta(x, c_\emptyset) + \lambda\left(v_\theta(x, c) - v_\theta(x, c_\emptyset)\right)\right)

  11. x^0←x−tstop⋅vtstop\hat{x}_0 \leftarrow x - t_{\mathrm{stop}} \cdot v_{t_{\mathrm{stop}}} ▷ Tweedie’s formula (Eq. (2))

  12. return x^0\hat{x}_0

Baselines

We evaluate our approach against diffusion based baselines implemented on Stable Diffusion 1.5 (5122512^2, NFE 200), encompassing PSLD [46], ReSample [51], DDPG [19], and TReg [28]. Hyperparameters for each baseline are provided in E.2.

Problem Setting

Diffusion based experiments cover two inverse problems: super-resolution 4×4\times and motion deblurring with a kernel size of 61 and intensity of 0.5. Across all settings, Gaussian noise with standard deviation of 0.03 (1.5% of the pixel range) is added to the measurements.

Experimental Results for Diffusion Model

To evaluate the generalizability of FLINT beyond flow matching frameworks, we extend the proposed method to diffusion models and benchmark it against diffusion based baselines on super resolution ×4\times4 and motion deblurring. As summarized in Table 2, FLINT achieves the best distortion perception trade-off across both tasks, demonstrating that proximal initialization via variational framework and guided posterior sampling with a bounded stochasticity schedule generalize effectively to the diffusion model setting. The qualitative comparisons in Figure S2 corroborate these findings, with FLINT producing reconstructions of higher visual fidelity and structural coherence than competing baselines. Collectively, these results confirm that the core principles of FLINT are not specific to rectified flow priors but transfer robustly across distinct generative mechanisms.

Figure S2. Qualitative comparison for FFHQ dataset on super-resolution 4× and motion deblurring based on diffusion model (SD 1.5).

Implementation Details

Implementation Details for FLINT

Stage 1: Proximal Source Initialization

Optimization setup. The optimization parameters μϕ\mu_\phi are optimized using the Adam optimizer. The regularization coefficients are set to βKL=0.1\beta_{\mathrm{KL}} = 0.1 and λcum=10\lambda_{\mathrm{cum}} = 10 for FFHQ under the flow matching framework, with the learning rate (αlr)(\alpha_{\mathrm{lr}}) set to 0.06. The noise annealing schedule uses σmax⁡=0.5\sigma_{\max} = 0.5 and σmin⁡=0.02\sigma_{\min} = 0.02 throughout all flow matching experiments. Hyperparameters for DIV2K and diffusion model experiments are summarized in Table S1.

FrameworkDatasetβKL\beta_{\mathrm{KL}}λcum\lambda_{\mathrm{cum}}σmax⁡\sigma_{\max}αlr\alpha_{\mathrm{lr}}
Flow Matching (SD3.5-M)FFHQ0.110.00.50.006
Flow Matching (SD3.5-M)DIV2K0.011.00.50.01
Diffusion (SD1.5)FFHQ0.0110.00.020.02

Table S1. Stage 1 hyperparameters across datasets and generative frameworks.

Truncated sampling configuration. For flow matching experiments, we use K=3K = 3 truncated ODE steps per optimization iteration, with 7 optimization iterations in total, yielding NFEStage1=K×7=21\mathrm{NFE}_{\mathrm{Stage1}} = K \times7 = 21 function evaluations. The remaining 29 NFEs are allocated to Stage 2 guided posterior sampling, for a total budget of 50 NFEs. For diffusion model experiments, we use K=10K = 10 truncated ODE steps per optimization iteration with 10 optimization iterations, yielding NFEStage1=K×10=100\mathrm{NFE}_{\mathrm{Stage1}} = K \times10 = 100 function evaluations, with the remaining 100 NFEs allocated to Stage 2, for a total of 200 NFEs.

Calibration for spectrally weighted data consistency. The Wiener filter weight W(ω,tstop)W(\omega, t_{\mathrm{stop}}) in Eq. (8) assumes a pink noise prior Sx0(ω)∝∥ω∥−αS_{x_0}(\omega) \propto\lVert\omega\rVert^{-\alpha} for natural images [50], consistent with the 1/f21/f^2 power spectrum, with α=2.0\alpha= 2.0 and tstop=0.976t_{\mathrm{stop}} = 0.976 fixed across all tasks and datasets. While α\alpha determines the spectral shape of the prior, it leaves the proportionality constant undetermined, causing the transition frequency between near unity and near zero mask values to shift in an uncontrolled manner. Calibration resolves this ambiguity by rescaling the raw mask to attain a prescribed value Wat_cutoffW_{\mathrm{at\_cutoff}} at a designated reference frequency ωc\omega_c, thereby anchoring the transition between reliable and unreliable frequency components as a half power point. We uniformly adopt ωc=0.05\omega_c = 0.05, Wat_cutoff=0.5W_{\mathrm{at\_cutoff}} = 0.5, and α=2.0\alpha= 2.0 across all tasks and datasets without task specific tuning, indicating that the calibration scheme is robust to variations in degradation type and image domain.

Stage 2: Proximity-Preserving Posterior Sampling with Bounded Stochasticity

Stochasticity magnitude. The overall magnitude λs\lambda_s of the bounded stochasticity schedule η(t)\eta(t) in Eq. (10) governs the total amount of noise injected throughout the guided sampling trajectory and is likewise task-dependent. A complete specification of the λs\lambda_s values used across all datasets and inverse problems is provided in Table S2.

FrameworkDatasetSR ×8\times8SR ×12\times12Motion DeblurringGaussian Deblurring
Flow Matching (SD3.5-M)FFHQ0.90.90.60.8
Flow Matching (SD3.5-M)DIV2K0.90.80.90.9
Diffusion (SD1.5)FFHQ0.30.3

Table S2. Stochasticity magnitude λs\lambda_s across tasks and datasets.

Data consistency guidance scale. The time-varying guidance scale β(t)\beta(t) in Eq. (35) controls the step size of the measurement correction at each reverse timestep and is task-dependent. Specifically, β(t)\beta(t) follows a monotonically decreasing schedule interpolating between a minimum value βmin⁡\beta_{\min} and a maximum value βmax⁡\beta_{\max} over the sampling trajectory. The complete set of (βmin⁡,βmax⁡)(\beta_{\min}, \beta_{\max}) values used across all datasets and inverse problems is provided in Table S3.

FrameworkDatasetSR ×8\times8SR ×12\times12Motion DeblurringGaussian Deblurring
Flow Matching (SD3.5-M)FFHQ(70, 130)(30, 130)(110, 130)(60, 140)
Flow Matching (SD3.5-M)DIV2K(125, 50)(120, 0)(450, 250)(160, 100)
Diffusion (SD1.5)FFHQ(10, 100)(50, 20)

Table S3. Data consistency guidance scale (βmin⁡,βmax⁡)(\beta_{\min}, \beta_{\max}) configurations across tasks and datasets.

Implementation Details for Baseline Hyperparameter Settings

Flow Matching Model Baselines For all flow matching evaluations, we utilize Stable Diffusion 3.5-Medium as the generative backbone with the time scheduler shift factor set to 4.0 and the number of function evaluations fixed at 50. All experiments are conducted on a single NVIDIA A100 GPU. The specific configurations for each method are as follows:

  • FlowChef The number of gradient descent steps and the step size serving as the data consistency guidance scale are set to 3 and 1, respectively, via grid search on the calibration set. The CFG scale is fixed at 2.0.

  • FlowDPS FlowDPS is evaluated in its standard configuration with 50 NFE and a CFG scale of 2, using a step size of 15 with 3 gradient descent steps for the inpainting task and a step size of 10 with 3 gradient descent steps for all remaining tasks.

  • FLAIR We employ 15 gradient descent steps for data consistency optimization with a CFG scale of 2.0 in its standard configuration. The learning rate is set to 0.1 for deblurring tasks, consistent with the original paper. For SR ×8\times8 and SR ×12\times12 tasks, the optimal learning rates are determined via grid search on the calibration set: 2 for both tasks on FFHQ, 3 for SR ×8\times8 on DIV2K, and 6 for SR ×12\times12 on DIV2K.

  • Flower We employ 15 steps of gradient descent with a step size of 15 for data consistency optimization via a grid search on the calibration set. Consistent with the original authors, the optimal uncertainty term is found to destabilize restoration, and thus γ\gamma is set to 0 with the CFG scale fixed at 2.0.

  • FlowLPS We employ 6 steps of gradient descent with a step size of 20 for data consistency optimization via a grid search on the calibration set. Consistent with the original paper, we use a fixed number of Langevin-Proximal update steps, Np=15N_p = 15, and a CFG scale of 2.0. A constant step size ζt=10−4\zeta_t = 10^{-4} is used for Langevin dynamics across all timesteps. For the proximal optimization, we utilized the SGD optimizer. We use an initial learning rate of 0.5 for super-resolution and 0.1 for other tasks. To ensure stability during optimization, we apply a learning rate decay schedule: for super-resolution, the learning rate is decayed by a factor of 0.85 every 5 iterations, and for inpainting, by 0.65 every 10 iterations.

  • FLINT We employ 6 steps of gradient descent for the data consistency update by default, increasing to 9 for DIV2K motion deblurring and to 12 for DIV2K SR ×12\times12, with the CFG scale fixed at 1.0. Remaining implementation details follow the setup described in Sec. E.1.

Diffusion Model Baselines For all diffusion-based evaluations, we utilize Stable Diffusion 1.5 as the generative backbone with the NFE fixed at 100. To ensure a competitive comparison, hyperparameters for all baselines are determined via an extensive grid search on a calibration set. All experiments are conducted on a single NVIDIA A100 GPU. Specific configurations for each method are as follows:

  • PSLD We use the paper’s default loss weights ω=1.0\omega= 1.0 (measurement fidelity) and γ=0.1\gamma= 0.1 (gluing), applied identically to both super-resolution and motion deblurring. Following the official implementation, the gluing gradient is added to the DDIM update with no additional step size, and A⊤A^{\top} approximates the pseudo-inverse for all tasks. We disable classifier-free guidance, following PSLD’s official setup with an empty null prompt.

  • Resample We adopt the resampling hyperparameter γ(1−αˉt−1αˉt)(1−αˉtαˉt−1)\gamma\left(\frac{1-\bar{\alpha}_{t-1}}{\bar{\alpha}_{t}}\right)\left(\frac{1-\bar{\alpha}_{t}}{\bar{\alpha}_{t-1}}\right) with γ=40\gamma= 40 as proposed in the original paper. To enforce hard data consistency, the skip step size is set to 1, accompanied by 10 steps of gradient descent for SR×\times4 task and 20 steps of gradient descent for motion deblurring task with a step size of 30. The CFG scale is fixed at 1.0.

  • DDPG We set hyperparameters for SR×\times4 and motion deblurring set to {γ,ζ,η~}={10.0,0.8,0.3}\{\gamma, \zeta, \tilde{\eta}\} = \{10.0, 0.8, 0.3\} and {5.0,0.6,0.6}\{5.0, 0.6, 0.6\}, respectively, with the step size μt\mu_t set to the theoretically safe value μt∗\mu_t^{*}. Here, γ\gamma controls the guidance transition from back-projection to least-squares, ζ\zeta balances stochastic noise injection against reconstruction accuracy, and η~\tilde{\eta} regularizes the back-projection operator to prevent noise amplification.

  • TReg We follow TReg’s algorithmic pipeline (CG-based data-consistency every third sampling step within the first 170 of 200 DDIM steps, corresponding to t≳145t \gtrsim145 on the standard schedule; adaptive negation of the null prompt; no DPS branch). The numerical hyperparameters {CFG scale,λcg,lrnull}={2.0,0.1,10−5}\{\text{CFG scale}, \lambda_{\mathrm{cg}}, \mathrm{lr}_{\mathrm{null}}\} = \{2.0, 0.1, 10^{-5}\} are calibrated for our setting (FFHQ ×\times SD1.5 ×σy=0.03\times\sigma_y = 0.03, SR×\times4 and motion deblurring).

  • FLINT We employ 8 steps of gradient descent for the data consistency update for super-resolution ×\times4 and 6 steps for motion deblurring, with the CFG scale fixed at 1.0. Remaining implementation details follow the setup described in Sec. E.1.

Additional Experiments

Additional Task: Inpainting

Beyond the four inverse problems in § 5.2, we evaluate FLINT on the inpainting task using a flow matching model. As shown in Table S4 and Figure S3, FLINT attains state of the art performance on box inpainting across all metrics. Proximal initialization via variational framework combined with guided posterior sampling under a bounded stochasticity schedule suppresses both boundary artifacts and blurry textures prevalent in baseline posterior sampling approaches. Moreover, FLINT achieves a favorable position on the perception–distortion trade-off, attaining competitive reconstruction fidelity (PSNR, SSIM) while improving perceptual quality (LPIPS, FID).

MethodFFHQ (768 × 768)DIV2K (768 × 768)
PSNR↑SSIM↑FID↓LPIPS↓PSNR↑SSIM↑FID↓LPIPS↓
FlowChef22.820.78557.230.37520.010.60670.080.463
FlowDPS21.740.78333.560.34520.360.61829.970.415
FLAIR28.340.86711.860.14123.740.82612.090.167
Flower<u>27.12</u>0.81137.940.33422.660.68736.360.359
FlowLPS26.650.8299.590.24922.280.7398.170.257
Ours26.520.872<u>10.63</u><u>0.113</u><u>22.91</u><u>0.825</u><u>8.78</u>0.123

Table S4. Quantitative comparison on inpainting based on flow matching model. All metrics are averaged over 1,000 FFHQ and 800 DIV2K samples, with each method allocated 50 NFE under additive Gaussian noise (σy=0.03\sigma_y = 0.03).

Qualitative comparison for DIV2K datasets on inpainting task

Figure S3. Qualitative comparison for DIV2K datasets on inpainting task.

Additional Runtime Comparison

We evaluate the inference efficiency of FLINT by comparing its mean runtime with baselines based on flow matching and diffusion models. As shown in Table S5, we report the per image sampling cost (s/image) averaged over 10 samples.

Flow Matching Model (SD3.5-M)Diffusion Model (SD1.5)
MethodSR ×8\times8 Runtime(s)↓\downarrowSR ×12\times12 Runtime(s)↓\downarrowMotion Deblur Runtime(s)↓\downarrowGaussian Deblur Runtime(s)↓\downarrowMethod
FlowChef8.148.149.288.66PSLD
FlowDPS8.228.189.478.71ReSample
FLAIR20.3320.2822.9421.37DDPG
Flower16.8916.8323.3619.46TReg
FlowLPS16.8416.7822.8219.31FLINT (Ours)
Ours (FFHQ)6.796.816.717.47
Ours (DIV2K)6.799.267.927.41
SR ×4\times4 Runtime(s)↓\downarrow
Motion Deblur Runtime(s)↓\downarrow
65.65
65.49
161.29
289.24
56.98
98.04
18.61
18.74
64.25
49.56

Table S5. Runtime comparison of methods based on flow matching and diffusion models. Sampling time per image, in seconds, is averaged over 10 samples.

Additional Discussion 1: Qualitative Comparison of Sampling Process

Figure S4 visualizes the Tweedie’s estimate at representative intermediate timesteps for FLINT and the competing baselines, complementing the quantitative trajectory analysis in Figure 6. At early timesteps, the baseline Tweedie’s estimates remain dominated by noise and exhibit only weak alignment with the underlying measurement, whereas FLINT’s estimate already reflects the coarse structure of the target reconstruction. As sampling progresses, FLINT’s intermediate estimates progressively refine perceptual detail without disturbing the coarse layout established at initialization, whereas the baselines continue to form the coarse layout itself through much of the sampling trajectory. These patterns visualize, in trajectory form, the two complementary mechanisms identified in § 3: proximal initialization places the sampler within a low-energy posterior region from the outset, and the bounded stochasticity schedule preserves this advantage as detail-level refinement proceeds. Together, they allow FLINT to converge along a noticeably shorter path through the generative manifold than the baselines.

Qualitative comparison of the Tweedie estimate’s along the sampling trajectory for FLINT and competing baselines

Figure S4. Qualitative comparison of the Tweedie estimate’s along the sampling trajectory for FLINT and competing baselines.

Additional Discussion 2: Effect of Cumulant Regularization

The cumulant regularizer R(μϕ)R(\mu_{\phi}) incorporated into the manifold-constrained proximal objective of stage 1 serves to enforce strict adherence of the optimized noise to the statistical characteristics of the Gaussian prior manifold. While the standard KL divergence primarily constrains lower-order statistics such as mean and variance, this regularization term suppresses non-Gaussian drift by penalizing departures in higher-order moments, including skewness and excess kurtosis. Table S6 shows that on motion deblurring (FFHQ, 100 samples), incorporating this term improves perceptual quality metrics, suggesting that controlling higher order statistics keeps the proximal initialization within the valid input support of the pretrained generative model, enabling full utilization of proximity-preserving posterior sampling of stage 2.

MethodPSNR↑SSIM↑KID↓LPIPS↓
λcum=0\lambda_{\mathrm{cum}} = 0 (OFF)30.320.8020.0150.263
λcum=10.0\lambda_{\mathrm{cum}} = 10.0 (ON)30.390.8000.0080.224

Table S6. Ablation on cumulant regularizer R(μϕ)R(\mu_{\phi}) coefficient λcum\lambda_{\mathrm{cum}} for Motion Deblurring, averaged over 100 FFHQ samples under Gaussian noise (σy=0.03\sigma_y = 0.03).

Additional Discussion 3: Comparison with Pseudo-Inverse-Based Initialization Strategies

We compare FLINT against three initialization strategies that derive the starting noise from the pseudo-inverse measurement, with Stage 2 fixed: forward-noising initialization [36, 13], which perturbs the pseudo-inverse via a single linear interpolation; deterministic inversion [15], which integrates the reverse generative ODE; and stochastic inversion [45], which integrates a controlled SDE biased toward typical Gaussian noise. None of these approaches jointly satisfies the two proximal conditions: proximity to a measurement-consistent region of source space and consistency with the prior typical set.

The forward-noising path does not coincide with the generative trajectory and satisfies neither condition. Deterministic inversion faithfully reproduces the pseudo-inverse but propagates the spectral distortions of the degradation operator into source space, yielding atypical noise. Stochastic inversion enforces typicality through its controller, yet the measurement operator enters neither the control objective nor the dynamics, causing the optimized noise to drift toward a generic typical sample without measurement awareness. FLINT’s variational formulation enforces both conditions jointly through a closed-form prior-matching term and a data-fidelity term that explicitly involves the measurement operator. Table S7 confirms this analysis, with FLINT attaining the best score across every metric.

Gaussian Deblurring
MethodPSNR↑SSIM↑KID↓LPIPS↓
Forward-Noising28.640.6160.0200.449
Deterministic-Inv.29.970.7880.0210.231
Stochastic-Inv.29.810.7510.0100.209
Ours30.110.7880.0050.192

Table S7. Quantitative comparison of alternative initialization strategies that derive the initial noise from the pseudo-inverse measurement, with Stage 2 fixed. Gaussian deblurring (FFHQ, 100 samples).

Additional Discussion 4: Excessive Source-Space Optimization

This section examines the effect of prolonged source-space optimization on reconstruction quality, corroborating the proximal-level optimization budget adopted in Stage 1. Excessive source-space optimization pushes the initial noise out-of-distribution (OOD), reducing reconstruction quality. To quantify this, we track the horizontal lag-1 spatial correlation of the optimized noise across optimization steps. As shown in Figure S5(c), the correlation remains stable within the proximal regime and gradually increases beyond it, eventually exceeding the 95% acceptance threshold for i.i.d. N(0,I)\mathcal{N}(0, I), indicating that the optimized noise progressively drifts toward the boundary of the prior’s typical set. This OOD drift manifests directly in reconstruction quality under guided posterior sampling (Figure S5(a)). While prolonged optimization yields marginal fidelity gains (0.36 dB PSNR from step 10 to 40), perceptual quality degrades substantially, with LPIPS increasing by over 35% (from 0.202 to 0.274), as the OOD noise can no longer be rendered into natural image structures by the pretrained generative model. These results corroborate the proximal design choice of Stage 1. Prolonged source-space optimization beyond a proximal level yields limited fidelity gains while reducing perceptual quality. A short proximal initialization is therefore preferable to exhaustive source-space optimization.

Figure S5. Effect of excessive source-space optimization on Gaussian deblurring (FFHQ, 100 samples). (a) PSNR and LPIPS of FLINT reconstructions across noise optimization steps. Beyond the proximal regime (10 steps), PSNR plateaus while LPIPS degrades by over 35%, as the OOD noise can no longer be rendered into natural image structures by the pretrained generative model. (b) PSNR and LPIPS of unconditional sampling rendered directly from the optimized noise (NFE = 29, matched to Stage 2). (c) PSNR, LPIPS, and horizontal lag-1 spatial correlation of the optimized noise on a representative sample. The correlation remains stable within the proximal regime and trends upward beyond it, indicating a gradual drift toward the boundary of the prior’s typical set.

Additional Discussion 5: Posterior Variance

To verify that FLINT does not suffer from mode collapse, we assess the posterior variance Var⁡[x∣y]\operatorname{Var}[x|y] for the super-resolution ×12\times12 task by drawing 50 samples for a fixed observation yy and computing their pixel-wise standard deviation. Figure S6 presents this analysis for FLINT alongside FLAIR, Flower, FlowDPS, and FlowLPS. FLINT maintains meaningful posterior coverage with variance concentrated in high-frequency texture regions, precisely the regions left underdetermined by the likelihood term in the highly ill-posed task, confirming that FLINT does not degenerate into a single-mode solution. This diversity arises from two complementary mechanisms. In Stage 1, the spectrally weighted data consistency loss anchors the low-frequency structure of the proximity-initialized noise to the measurement while suppressing gradients from high-frequency components, leaving uncertainty in fine-grained details. Combined with annealed noise in the variational optimization, this encourages the optimizer to explore a range of measurement-consistent proximal points that share the same coarse layout but differ in their high-frequency realization. In Stage 2, the bounded bell-shaped stochasticity schedule concentrates noise injection in intermediate timesteps where perceptual detail is refined, actively generating varying high-frequency components across samples while keeping the low-frequency structure stable. Together, these results confirm that FLINT reliably explores the posterior rather than collapsing to a single reconstruction.

Posterior variance analysis showing Ground Truth, four posterior samples, posterior mean, and pixel-wise standard deviation for Ours, FlowLPS, FlowDPS, Flower, and FLAIR

Figure S6. Posterior variance analysis for super-resolution ×12\times12. For each method, 50 samples are drawn from the posterior p(x∣y)p(x\mid y) for a fixed observation yy, with four representative samples, the posterior mean E[x∣y]\mathbb{E}[x\mid y], and the pixel-wise standard deviation Std⁡[x∣y]\operatorname{Std}[x\mid y] displayed. FLINT produces diverse posterior samples with meaningful variance in perceptually significant regions, confirming the absence of mode collapse.

Additional Qualitative Results

Additional qualitative comparison for the super resolution tasks

Figure S7. Additional qualitative comparison for the super resolution tasks (super-resolution ×8\times8 and super-resolution ×12\times12) on the FFHQ dataset.

Additional qualitative comparison for motion deblurring and Gaussian deblurring on the FFHQ dataset

Figure S8. Additional qualitative comparison for the deblurring tasks (motion deblurring and gaussian deblurring) on the FFHQ dataset.

Additional qualitative comparison for the super resolution tasks

Figure S9. Additional qualitative comparison for the super resolution tasks (super-resolution ×8\times8 and super-resolution ×12\times12) on the DIV2K dataset.

Additional qualitative comparison grid for motion deblurring and Gaussian deblurring, with columns labeled Measurement, FlowChef, FlowDPS, FLAIR, Flower, FlowLPS, FLINT (Ours), and Ground Truth

Figure S10. Additional qualitative comparison for the deblurring tasks (motion deblurring and gaussian deblurring) on the DIV2K dataset.

Qualitative comparison of Ground Truth and FLINT results on highly complex scenes

Figure S11. Qualitative failure cases of FLINT on highly complex scenes (DIV2K dataset). Increased ill-posedness in dense, multi-object images disrupts the balance between measurement fidelity and the generative prior. This results in either hallucinated structures, where the model generates spurious details to satisfy the prior, or blurry textures, where conflicting updates fail to resolve high-frequency information. These cases highlight the inherited limitations of the pretrained backbone’s capacity for complex out-of-distribution scenes.

NeurIPS Paper Checklist

  1. Claims

Question: Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope?

Answer: [Yes]

Justification: The Abstract and Introduction (§ 1) clearly reflect the paper’s contributions and scope.

Guidelines:

  • The answer [N/A] means that the abstract and introduction do not include the claims made in the paper.

  • The abstract and/or introduction should clearly state the claims made, including the contributions made in the paper and important assumptions and limitations. A [No] or [N/A] answer to this question will not be perceived well by the reviewers.

  • The claims made should match theoretical and experimental results, and reflect how much the results can be expected to generalize to other settings.

  • It is fine to include aspirational goals as motivation as long as it is clear that these goals are not attained by the paper.

  1. Limitations

Question: Does the paper discuss the limitations of the work performed by the authors?

Answer: [Yes]

Justification: This paper discusses the limitations in Sec. 6.

Guidelines:

  • The answer [N/A] means that the paper has no limitation while the answer [No] means that the paper has limitations, but those are not discussed in the paper.

  • The authors are encouraged to create a separate “Limitations” section in their paper.

  • The paper should point out any strong assumptions and how robust the results are to violations of these assumptions (e.g., independence assumptions, noiseless settings, model well-specification, asymptotic approximations only holding locally). The authors should reflect on how these assumptions might be violated in practice and what the implications would be.

  • The authors should reflect on the scope of the claims made, e.g., if the approach was only tested on a few datasets or with a few runs. In general, empirical results often depend on implicit assumptions, which should be articulated.

  • The authors should reflect on the factors that influence the performance of the approach. For example, a facial recognition algorithm may perform poorly when image resolution is low or images are taken in low lighting. Or a speech-to-text system might not be used reliably to provide closed captions for online lectures because it fails to handle technical jargon.

  • The authors should discuss the computational efficiency of the proposed algorithms and how they scale with dataset size.

  • If applicable, the authors should discuss possible limitations of their approach to address problems of privacy and fairness.

  • While the authors might fear that complete honesty about limitations might be used by reviewers as grounds for rejection, a worse outcome might be that reviewers discover limitations that aren’t acknowledged in the paper. The authors should use their best judgment and recognize that individual actions in favor of transparency play an important role in developing norms that preserve the integrity of the community. Reviewers will be specifically instructed to not penalize honesty concerning limitations.

  1. Theory assumptions and proofs

Question: For each theoretical result, does the paper provide the full set of assumptions and a complete (and correct) proof?

Answer: [Yes] Justification: This paper presents a theoretical analysis comprising Proposition 1 in § 3 of the main paper, with their corresponding mathematical proofs and assumptions provided in Appendix Subsec. A.1, Subsec. A.2.

Guidelines:

  • The answer [N/A] means that the paper does not include theoretical results.

  • All the theorems, formulas, and proofs in the paper should be numbered and cross-referenced.

  • All assumptions should be clearly stated or referenced in the statement of any theorems.

  • The proofs can either appear in the main paper or the supplemental material, but if they appear in the supplemental material, the authors are encouraged to provide a short proof sketch to provide intuition.

  • Inversely, any informal proof provided in the core of the paper should be complemented by formal proofs provided in appendix or supplemental material.

  • Theorems and Lemmas that the proof relies upon should be properly referenced.

Experimental result reproducibility

Question: Does the paper fully disclose all the information needed to reproduce the main experimental results of the paper to the extent that it affects the main claims and/or conclusions of the paper (regardless of whether the code and data are provided or not)?

Answer: [Yes]

Justification: This paper provides sufficient information that can reproduce the results of the main experiment in Sec. 5, Sec. E, and additional experiments in Sec. D, Sec. F.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • If the paper includes experiments, a [No] answer to this question will not be perceived well by the reviewers: Making the paper reproducible is important, regardless of whether the code and data are provided or not.

  • If the contribution is a dataset and/or model, the authors should describe the steps taken to make their results reproducible or verifiable.

  • Depending on the contribution, reproducibility can be accomplished in various ways. For example, if the contribution is a novel architecture, describing the architecture fully might suffice, or if the contribution is a specific model and empirical evaluation, it may be necessary to either make it possible for others to replicate the model with the same dataset, or provide access to the model. In general. releasing code and data is often one good way to accomplish this, but reproducibility can also be provided via detailed instructions for how to replicate the results, access to a hosted model (e.g., in the case of a large language model), releasing of a model checkpoint, or other means that are appropriate to the research performed.

  • While NeurIPS does not require releasing code, the conference does require all submissions to provide some reasonable avenue for reproducibility, which may depend on the nature of the contribution. For example (a) If the contribution is primarily a new algorithm, the paper should make it clear how to reproduce that algorithm. (b) If the contribution is primarily a new model architecture, the paper should describe the architecture clearly and fully. (c) If the contribution is a new model (e.g., a large language model), then there should either be a way to access this model for reproducing the results or a way to reproduce the model (e.g., with an open-source dataset or instructions for how to construct the dataset). (d) We recognize that reproducibility may be tricky in some cases, in which case authors are welcome to describe the particular way they provide for reproducibility. In the case of closed-source models, it may be that access to the model is limited in some way (e.g., to registered users), but it should be possible for other researchers to have some path to reproducing or verifying the results.

Open access to data and code

Question: Does the paper provide open access to the data and code, with sufficient instructions to faithfully reproduce the main experimental results, as described in supplemental material?

Answer: [Yes]

Justification: We will release code and sample data to reproduce the experimental results in Sec. 5 upon acceptance of the paper.

Guidelines:

  • The answer [N/A] means that paper does not include experiments requiring code.

  • Please see the NeurIPS code and data submission guidelines (https://neurips.cc/public/guides/CodeSubmissionPolicy) for more details.

  • While we encourage the release of code and data, we understand that this might not be possible, so [No] is an acceptable answer. Papers cannot be rejected simply for not including code, unless this is central to the contribution (e.g., for a new open-source benchmark).

  • The instructions should contain the exact command and environment needed to run to reproduce the results. See the NeurIPS code and data submission guidelines (https://neurips.cc/public/guides/CodeSubmissionPolicy) for more details.

  • The authors should provide instructions on data access and preparation, including how to access the raw data, preprocessed data, intermediate data, and generated data, etc.

  • The authors should provide scripts to reproduce all experimental results for the new proposed method and baselines. If only a subset of experiments are reproducible, they should state which ones are omitted from the script and why.

  • At submission time, to preserve anonymity, the authors should release anonymized versions (if applicable).

  • Providing as much information as possible in supplemental material (appended to the paper) is recommended, but including URLs to data and code is permitted.

Experimental setting/details

Question: Does the paper specify all the training and test details (e.g., data splits, hyperparameters, how they were chosen, type of optimizer) necessary to understand the results?

Answer: [Yes]

Justification: This paper provides the details of the experiments sufficiently in Sec. 5, Sec. E, and Sec. D.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • The experimental setting should be presented in the core of the paper to a level of detail that is necessary to appreciate the results and make sense of them.

  • The full details can be provided either with the code, in appendix, or as supplemental material.

Experiment statistical significance

Question: Does the paper report error bars suitably and correctly defined or other appropriate information about the statistical significance of the experiments?

Answer: [Yes]

Justification: This paper offers several tables for quantitative comparison and figures for qualitative comparison in the main paper as well as the Appendix.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • The authors should answer [Yes] if the results are accompanied by error bars, confidence intervals, or statistical significance tests, at least for the experiments that support the main claims of the paper.

  • The factors of variability that the error bars are capturing should be clearly stated (for example, train/test split, initialization, random drawing of some parameter, or overall run with given experimental conditions).

  • The method for calculating the error bars should be explained (closed form formula, call to a library function, bootstrap, etc.)

  • The assumptions made should be given (e.g., Normally distributed errors).

  • It should be clear whether the error bar is the standard deviation or the standard error of the mean.

  • It is OK to report 1-sigma error bars, but one should state it. The authors should preferably report a 2-sigma error bar than state that they have a 96% CI, if the hypothesis of Normality of errors is not verified.

  • For asymmetric distributions, the authors should be careful not to show in tables or figures symmetric error bars that would yield results that are out of range (e.g., negative error rates).

  • If error bars are reported in tables or plots, the authors should explain in the text how they were calculated and reference the corresponding figures or tables in the text.

Experiments compute resources

Question: For each experiment, does the paper provide sufficient information on the computer resources (type of compute workers, memory, time of execution) needed to reproduce the experiments?

Answer: [Yes]

Justification: This paper provides the details of computing resources and time of execution in Figure 4 and Table S5.

Guidelines:

  • The answer [N/A] means that the paper does not include experiments.

  • The paper should indicate the type of compute workers CPU or GPU, internal cluster, or cloud provider, including relevant memory and storage.

  • The paper should provide the amount of compute required for each of the individual experimental runs as well as estimate the total compute.

  • The paper should disclose whether the full research project required more compute than the experiments reported in the paper (e.g., preliminary or failed experiments that didn’t make it into the paper).

Code of ethics

Question: Does the research conducted in the paper conform, in every respect, with the NeurIPS Code of Ethics https://neurips.cc/public/EthicsGuidelines?

Answer: [Yes]

Justification: This paper fully complies with the NeurIPS code of ethics.

Guidelines:

  • The answer [N/A] means that the authors have not reviewed the NeurIPS Code of Ethics.

  • If the authors answer [No], they should explain the special circumstances that require a deviation from the Code of Ethics.

  • The authors should make sure to preserve anonymity (e.g., if there is a special consideration due to laws or regulations in their jurisdiction).

Broader impacts

Question: Does the paper discuss both potential positive societal impacts and negative societal impacts of the work performed?

Answer: [Yes]

Justification: In § 1 and Sec. 6 of the main paper, we emphasize that the our work opens a new perspective on the design of flow-based inverse problem solvers, that combines source space warmup initialization via variational framework with guided sampling under a bounded stochasticity schedule.

Guidelines:

  • The answer [N/A] means that there is no societal impact of the work performed.

  • If the authors answer [N/A] or [No], they should explain why their work has no societal impact or why the paper does not address societal impact.

  • Examples of negative societal impacts include potential malicious or unintended uses (e.g., disinformation, generating fake profiles, surveillance), fairness considerations (e.g., deployment of technologies that could make decisions that unfairly impact specific groups), privacy considerations, and security considerations.

  • The conference expects that many papers will be foundational research and not tied to particular applications, let alone deployments. However, if there is a direct path to any negative applications, the authors should point it out. For example, it is legitimate to point out that an improvement in the quality of generative models could be used to generate Deepfakes for disinformation. On the other hand, it is not needed to point out that a generic algorithm for optimizing neural networks could enable people to train models that generate Deepfakes faster.

  • The authors should consider possible harms that could arise when the technology is being used as intended and functioning correctly, harms that could arise when the technology is being used as intended but gives incorrect results, and harms following from (intentional or unintentional) misuse of the technology.

  • If there are negative societal impacts, the authors could also discuss possible mitigation strategies (e.g., gated release of models, providing defenses in addition to attacks, mechanisms for monitoring misuse, mechanisms to monitor how a system learns from feedback over time, improving the efficiency and accessibility of ML).

Safeguards

Question: Does the paper describe safeguards that have been put in place for responsible release of data or models that have a high risk for misuse (e.g., pre-trained language models, image generators, or scraped datasets)?

Answer: [N/A]

Justification: This paper poses no such risks.

Guidelines:

  • The answer [N/A] means that the paper poses no such risks.

  • Released models that have a high risk for misuse or dual-use should be released with necessary safeguards to allow for controlled use of the model, for example by requiring that users adhere to usage guidelines or restrictions to access the model or implementing safety filters.

  • Datasets that have been scraped from the Internet could pose safety risks. The authors should describe how they avoided releasing unsafe images.

  • We recognize that providing effective safeguards is challenging, and many papers do not require this, but we encourage authors to take this into account and make a best faith effort.

Licenses for existing assets

Question: Are the creators or original owners of assets (e.g., code, data, models), used in the paper, properly credited and are the license and terms of use explicitly mentioned and properly respected?

Answer: [Yes]

Justification: We have fully cited all methods, datasets, and pre-trained foundation models utilized in this paper.

Guidelines:

  • The answer [N/A] means that the paper does not use existing assets.

  • The authors should cite the original paper that produced the code package or dataset.

  • The authors should state which version of the asset is used and, if possible, include a URL.

  • The name of the license (e.g., CC-BY 4.0) should be included for each asset.

  • For scraped data from a particular source (e.g., website), the copyright and terms of service of that source should be provided.

  • If assets are released, the license, copyright information, and terms of use in the package should be provided. For popular datasets, paperswithcode.com/datasets has curated licenses for some datasets. Their licensing guide can help determine the license of a dataset.

  • For existing datasets that are re-packaged, both the original license and the license of the derived asset (if it has changed) should be provided.

  • If this information is not available online, the authors are encouraged to reach out to the asset’s creators.

New assets

Question: Are new assets introduced in the paper well documented and is the documentation provided alongside the assets?

Answer: [Yes]

Justification: The assets introduced in this paper have been documented, and we publicly plan to release the code in the future.

Guidelines:

  • The answer [N/A] means that the paper does not release new assets.

  • Researchers should communicate the details of the dataset/code/model as part of their submissions via structured templates. This includes details about training, license, limitations, etc.

  • The paper should discuss whether and how consent was obtained from people whose asset is used.

  • At submission time, remember to anonymize your assets (if applicable). You can either create an anonymized URL or include an anonymized zip file.

Crowdsourcing and research with human subjects

Question: For crowdsourcing experiments and research with human subjects, does the paper include the full text of instructions given to participants and screenshots, if applicable, as well as details about compensation (if any)?

Answer: [N/A]

Justification: Our study does not involve crowdsourcing or research with human subjects.

Guidelines:

  • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects.

  • Including this information in the supplemental material is fine, but if the main contribution of the paper involves human subjects, then as much detail as possible should be included in the main paper.

  • According to the NeurIPS Code of Ethics, workers involved in data collection, curation, or other labor should be paid at least the minimum wage in the country of the data collector.

Institutional review board (IRB) approvals or equivalent for research with human subjects

Question: Does the paper describe potential risks incurred by study participants, whether such risks were disclosed to the subjects, and whether Institutional Review Board (IRB) approvals (or an equivalent approval/review based on the requirements of your country or institution) were obtained?

Answer: [N/A]

Justification: No new data collection or direct interaction with human subjects was conducted in this study.

Guidelines:

  • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects.

  • Depending on the country in which research is conducted, IRB approval (or equivalent) may be required for any human subjects research. If you obtained IRB approval, you should clearly state this in the paper.

  • We recognize that the procedures for this may vary significantly between institutions and locations, and we expect authors to adhere to the NeurIPS Code of Ethics and the guidelines for their institution.

  • For initial submissions, do not include any information that would break anonymity (if applicable), such as the institution conducting the review.

Declaration of LLM usage

Question: Does the paper describe the usage of LLMs if it is an important, original, or non-standard component of the core methods in this research? Note that if the LLM is used only for writing, editing, or formatting purposes and does not impact the core methodology, scientific rigor, or originality of the research, declaration is not required.

Answer: [N/A]

Justification: The core method on this paper does not involve LLMs as any important, original, or non-standard components.

Guidelines:

  • The answer [N/A] means that the core method development in this research does not involve LLMs as any important, original, or non-standard components.

  • Please refer to our LLM policy in the NeurIPS handbook for what should or should not be described.

References

  1. [1]Eirikur Agustsson and Radu Timofte. Ntire 2017 challenge on single image super-resolution: Dataset and study. In CVPRW, 2017.DOI
  2. [2]Brian DO Anderson. Reverse-time diffusion equation models. Stochastic Processes and their Applications, 12(3):313–326, 1982.DOI
  3. [3]Junseo Bang, Dong Ju Mun, Hoigi Seo, Seongmin Hong, and Se Young Chun. Triadic dynamics aware diffusion posterior sampling for inverse problems: Optimizing guidance and stochasticity schedules. In ICML, 2026.arxiv.org/abs/2605.26470
  4. [4]Heli Ben-Hamu, Omri Puny, Itai Gat, Brian Karrer, Uriel Singer, and Yaron Lipman. D-flow: Differentiating through flows for controlled generation. In ICML, 2024.
  5. [5]Mario Bertero, Patrizia Boccacci, and Christine De Mol. Introduction to inverse problems in imaging. CRC press, 2021.
  6. [6]Mikołaj Bińkowski, Danica J Sutherland, Michael Arbel, and Arthur Gretton. Demystifying mmd gans. In International Conference on Learning Representations, 2018.arxiv.org/abs/1801.01401
  7. [7]Tianqi Chen, Bing Xu, Chiyuan Zhang, and Carlos Guestrin. Training deep nets with sublinear memory cost. arXiv preprint arXiv:1604.06174, 2016.arxiv.org/abs/1604.06174
  8. [8]Hamadi Chihouai, Abdelhak Lemkhenber, and Paolo Favaro. Blind image restoration via fast diffusion inversion. NeurIPS, 2024.
  9. [9]Jooyoung Choi, Jungbeom Lee, Chaehun Shin, Sungwon Kim, Hyunwoo Kim, and Sungroh Yoon. Perception prioritized training of diffusion models. In CVPR, 2022.arxiv.org/abs/2204.00227
  10. [10]Hyungjin Chung, Jeongsol Kim, Sehui Kim, and Jong Chul Ye. Parallel diffusion models of operator and image for blind inverse problems. In CVPR, 2023.arxiv.org/abs/2211.10656
  11. [11]Hyungjin Chung, Jeongsol Kim, Michael T Mccann, Marc L Klasky, and Jong Chul Ye. Diffusion posterior sampling for general noisy inverse problems. In ICLR, 2023.arxiv.org/abs/2209.14687
  12. [12]Hyungjin Chung, Byeongsu Sim, Dohoon Ryu, and Jong Chul Ye. Improving diffusion models for inverse problems using manifold constraints. NeurIPS, 2022.
  13. [13]Hyungjin Chung, Byeongsu Sim, and Jong Chul Ye. Come-closer-diffuse-faster: Accelerating conditional diffusion models for inverse problems through stochastic contraction. In CVPR, 2022.
  14. [14]Kevin Clark, Paul Vicol, Kevin Swersky, and David J. Fleet. Directly fine-tuning diffusion models on differentiable rewards. In ICLR, 2024.arxiv.org/abs/2309.17400
  15. [15]Yingying Deng, Xiangyu He, Changwang Mei, Peisong Wang, and Fan Tang. Fireflow: Fast inversion of rectified flow for image semantic editing. In ICML, 2025.
  16. [16]Hongkun Dou, Zeyu Li, Xingyu Jiang, Hongjue Li, Lijun Yang, Wen Yao, and Yue Deng. You only look one step: Accelerating backpropagation in diffusion sampling with gradient shortcuts. IEEE TPAMI, 2025.
  17. [17]Julius Erbach, Dominik Narnhofer, Andreas Robert Dombos, Bernt Schiele, Jan Eric Lenssen, and Konrad Schindler. Solving inverse problems with FLAIR. In NeurIPS, 2025.
  18. [18]Patrick Esser, Sumith Kulal, Andreas Blattmann, Rahim Entezari, Jonas Müller, Harry Saini, Yam Levi, Dominik Lorenz, Axel Sauer, Frederic Boesel, et al. Scaling rectified flow transformers for high-resolution image synthesis. In ICML, 2024.
  19. [19]Tomer Garber and Tom Tiren. Image restoration by denoising diffusion models with iteratively precondi-tioned guidance. In CVPR, 2024.
  20. [20]Martin Heusel, Hubert Ramsauer, Thomas Unterthiner, Bernhard Nessler, and Sepp Hochreiter. Gans trained by a two time-scale update rule converge to a local nash equilibrium. NeurIPS, 2017.
  21. [21]Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models. NeurIPS, 2020.arxiv.org/abs/2006.11239
  22. [22]Jari P Kaipio and Erkki Somersalo. Statistical and computational inverse problems. Springer, 2005.DOI
  23. [23]Adhithyan Kalaivan, Zheng Zhao, Jens Sjölund, and Fredrik Lindsten. Ess-flow: Training-free guidance of flow-based models as inference in source space. arXiv preprint arXiv:2510.05849, 2025.
  24. [24]Tero Karras, Samuli Laine, and Timo Aila. A style-based generator architecture for generative adversarial networks. In CVPR, 2019.DOI
  25. [25]Bahjat Kawar, Michael Elad, Stefano Ermon, and Jiaming Song. Denoising diffusion restoration models. NeurIPS, 35, 2022.arxiv.org/abs/2201.11793
  26. [26]Jeongsol Kim, Bryan Sangwoo Kim, and Jong Chul Ye. Flowdps : Flow-driven posterior sampling for inverse problems. In ICCV, 2025.arxiv.org/abs/2503.08136
  27. [27]Jeongsol Kim, Bryan Sangwoo Kim, and Jong Chul Ye. Flowdps: Flow-driven posterior sampling for inverse problems. In ICCV, 2025.arxiv.org/abs/2503.08136
  28. [28]Jeongsol Kim, Geon Yeong Park, Hyungjin Chung, and Jong Chul Ye. Regularization by texts for latent diffusion inverse solvers. In ICLR, 2025.
  29. [29]Minwoo Kim, Seunghyeok Shin, and Hongki Lim. FAST-DIPS: Adjoint-free analytic steps and hard-constrained likelihood correction for diffusion-prior inverse problems. In ICLR, 2026.
  30. [30]Haechang Lee, Dong Ju Mun, Hyunwoo Lee, Kyung Chul Lee, Seongmin Hong, Gwanghyun Kim, Seung Ah Lee, and Se Young Chun. Fidelity-preserving zero-shot diffusion models for highly ill-posed inverse problems in lensless imaging. Image and Vision Computing, 165:105786, 2026.DOI
  31. [31]Sangyun Lee, Yilun Xu, Tomas Geffner, Giulia Fanti, Karsten Kreis, Arash Vahdat, and Weili Nie. Truncated consistency models. In ICLR, 2025.arxiv.org/abs/2410.14895
  32. [32]Yaron Lipman, Ricky T. Q. Chen, Heli Ben-Hamu, Maximilian Nickel, and Matthew Le. Flow matching for generative modeling. In ICLR, 2023.arxiv.org/abs/2210.02747
  33. [33]Xingchao Liu, Chengyue Gong, and qiang liu. Flow straight and fast: Learning to generate and transfer data with rectified flow. In ICLR, 2023.arxiv.org/abs/2209.03003
  34. [34]Michael T McCann, Kyong Hwan Jin, and Michael Unser. Convolutional neural networks for inverse problems in imaging: A review. IEEE Signal Process. Mag., 2017.DOI
  35. [35]Peter McCullagh. Tensor methods in statistics: Monographs on statistics and applied probability. Chapman and Hall/CRC, 2018.
  36. [36]Chenlin Meng, Yutong He, Yang Song, Jiaming Song, Jiajun Wu, Jun-Yan Zhu, and Stefano Ermon. SDEdit: Guided image synthesis and editing with stochastic differential equations. In ICLR, 2022.arxiv.org/abs/2108.01073
  37. [37]Gregory Ongie, Ajil Jalal, Christopher A Metzler, Richard G Baraniuk, Alexandros G Dimakis, and Rebecca Willett. Deep learning techniques for inverse problems in imaging. IEEE JSAIT, 2020.arxiv.org/abs/2005.06001
  38. [38]Jiachun Pan, Jun Hao Liew, Vincent Tan, Jiashi Feng, and Hanshu Yan. AdjointDPM: Adjoint sensitivity method for gradient backpropagation of diffusion probabilistic models. In ICLR, 2024.arxiv.org/abs/2307.10711
  39. [39]Meet Hemant Parikh, Yaqin Chen, and Jian-Xun Wang. D-flow sgld: Source-space posterior sampling for scientific inverse problems with flow matching. arXiv preprint arXiv:2602.21469, 2026.arxiv.org/abs/2602.21469
  40. [40]Jonghyun Park and Jong Chul Ye. Flowpls: Langevin-proximal sampling for flow-based inverse problem solvers. arXiv preprint arXiv:2512.07150, 2025.arxiv.org/abs/2512.07150
  41. [41]Maitreya Patel, Song Wen, Dimitris N. Metaxas, and Yehzou Yang. Flowchef: Steering of rectified flow models for controlled generations. In ICCV, 2025.DOI
  42. [42]Mehrsa Pourya, Bassam El Rawas, and Michael Unser. FLOWER: A flow-matching solver for inverse problems. In ICLR, 2026.arxiv.org/abs/2509.26287
  43. [43]Mihir Prabhudesai, Anirudh Goyal, Deepak Pathak, and Katerina Fragkiadaki. Aligning text-to-image diffusion models with reward backpropagation. arXiv preprint arXiv:2310.03739, 2023.arxiv.org/abs/2310.03739
  44. [44]Vishal Purohit, Matthew Repasky, Jianfeng Lu, Qiang Qiu, Yao Xie, and Xiuyuan Cheng. Posterior sampling via langevin dynamics based on generative priors. arXiv preprint arXiv:2410.02078, 2024.arxiv.org/abs/2410.02078
  45. [45]Litu Rout, Yujia Chen, Nataniel Ruiz, Constantine Caramanis, Sanjay Shakkottai, and Wen-Sheng Chu. Semantic image inversion and editing using rectified stochastic differential equations. In ICLR, 2025.arxiv.org/abs/2410.10792
  46. [46]Litu Rout, Negin Raoof, Giannis Daras, Constantine Caramanis, Alex Dimakis, and Sanjay Shakkottai. Solving linear inverse problems provably via posterior sampling with latent diffusion models. NeurIPS, 2023.arxiv.org/abs/2307.00619
  47. [47]François Rozet, Gérôme Andry, François Lanusse, and Gilles Louppe. Learning diffusion priors from observations by expectation maximization. NeurIPS, 2024.arxiv.org/abs/2405.13712
  48. [48]Leonid I Rudin, Stanley Osher, and Emad Fatemi. Nonlinear total variation based noise removal algorithms. Physica D: nonlinear phenomena, 1992.DOI
  49. [49]Youssef Shehata, Benjamin Holzschuh, and Nils Thurey. Improved sampling of diffusion models in fluid dynamics with tweedie’s formula. In ICLR, 2025.
  50. [50]Eero P Simoncelli and Bruno A Olshausen. Natural image statistics and neural representation. Annual review of neuroscience, 2001.pubmed.ncbi.nlm.nih.gov/11520932
  51. [51]Bowen Song, Soo Min Kwon, Zecheng Zhang, Xinyu Hu, Qing Qu, and Liyue Shen. Solving inverse problems with latent diffusion models via hard data consistency. In ICLR, 2024.arxiv.org/abs/2307.08123
  52. [52]Jiaming Song, Arash Vahdat, Morteza Mardani, and Jan Kautz. Pseudoinverse-guided diffusion models for inverse problems. In ICLR, 2023.
  53. [53]Yang Song, Liyue Shen, Lei Xing, and Stefano Ermon. Solving inverse problems in medical imaging with score-based generative models. In ICLR, 2022.arxiv.org/abs/2111.08005
  54. [54]Yang Song, Jascha Sohl-Dickstein, Diederik P Kingma, Abhishek Kumar, Stefano Ermon, and Ben Poole. Score-based generative modeling through stochastic differential equations. In ICLR, 2021.
  55. [55]Andrei N Tikhonov. Solution of incorrectly formulated problems and the regularization method. Sov Dok, 1963.
  56. [56]Dmitry Ulyanov, Andrea Vedaldi, and Victor Lempitsky. Deep image prior. In CVPR, 2018.
  57. [57]Siganallur V. Venkatakrishnan, Charles A. Bouman, and Brendt Wohlberg. Plug-and-play priors for model based reconstruction. In IEEE Global Conference on Signal and Information Processing, 2013.
  58. [58]Bram Wallace, Akash Gokul, Stefano Ermon, and Nikhil Naik. End-to-end diffusion latent optimization improves classifier guidance. In ICCV, 2023.arxiv.org/abs/2303.13703
  59. [59]Wolfgang Walter. Ordinary Differential Equations, volume 182 of Graduate Texts in Mathematics. Springer, 1st edition, 1998.
  60. [60]Hengkang Wang, Xu Zhang, Taihui Li, Yuxiang Wan, Tiancong Chen, and Ju Sun. Dmplug: A plug-in method for solving inverse problems with diffusion models. NeurIPS, 2024.arxiv.org/abs/2405.16749
  61. [61]Zhou Wang, Alan C Bovik, Hamid R Sheikh, and Eero P Simoncelli. Image quality assessment: from error visibility to structural similarity. IEEE TIP, 2004.pubmed.ncbi.nlm.nih.gov/15376593
  62. [62]Zifan Wang, Alice Harting, Matthieu Barreau, Michael M. Zavlanos, and Karl Henrik Johansson. Source-guided flow matching. In ICLR, 2026.arxiv.org/abs/2508.14807
  63. [63]Norbert Wiener. Extrapolation, interpolation, and smoothing of stationary time series: with engineering applications. The MIT press, 1949.
  64. [64]Rongyuan Wu, Tao Yang, Lingchen Sun, Zhengqiang Zhang, Shuai Li, and Lei Zhang. Seesr: Towards semantics-aware real-world image super-resolution. In CVPR, 2024.arxiv.org/abs/2311.16518
  65. [65]Yingzhi Xia, Setthakorn Tanomkiattikun, Liangli Zhen, and ZAIWANG GU. Noise-adaptive diffusion sampling for inverse problems without task-specific tuning. In ICLR, 2026.arxiv.org/abs/2604.16919
  66. [66]Bingliang Zhang, Wenda Chu, Julius Berner, Chenlin Meng, Anima Anandkumar, and Yang Song. Improving diffusion inverse problem solving with decoupled noise annealing. In CVPR, 2025.DOI
  67. [67]Kai Zhang, Wangmeng Zuo, Yunjin Chen, Deyu Meng, and Lei Zhang. Beyond a gaussian denoiser: Residual learning of deep cnn for image denoising. IEEE TIP, 2017.DOI
  68. [68]Richard Zhang, Phillip Isola, Alexei A Efros, Eli Shechtman, and Oliver Wang. The unreasonable effectiveness of deep features as a perceptual metric. In CVPR, 2018.arxiv.org/abs/1801.03924

Paper details

vlnc:W_au9xpeq8
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents