Flow-Matching Prior Rectification (FMPR)

• The paper FMPR introduces a mechanism that transports a low-quality prior embedding toward a privileged training prior, achieving measurable gains in PSNR, LPIPS, and FID.
• FMPR encompasses various implementations that refine image, graph, and latent representations by learning flow transport corrections across degraded estimates.
• The method's design balances fidelity and artifact suppression, highlighting trade-offs in local refinement versus global prior alignment.

Flow-Matching Prior Rectification (FMPR) denotes a class of procedures in which a flow-matching model is not used as a standalone unconditional generator, but as a mechanism for correcting, transporting, or constraining an initial estimate toward a more desirable target distribution. In its explicit form, PRISM defines FMPR as a module that “constructs a privileged training-time prior from paired low-quality/high-quality latents and learns a flow matching that transports degraded embeddings toward this restoration-oriented prior space” for text image super-resolution (Xu et al., 13 May 2026). In a broader comparative sense, closely related mechanisms appear across recent work as truncated flow-matching refinement, prior-informed rectified transport, posterior-guided flow correction, source-prior calibration, or exposure-bias rectification, all of which use flow matching to rectify an estimate, trajectory, or prior rather than to replace the entire reconstruction or generation pipeline (Li et al., 19 Jun 2025, Chen et al., 29 Jan 2026, Wan et al., 1 Aug 2025, Kim et al., 4 Mar 2026, Chen et al., 15 May 2026, Huang et al., 26 Jun 2026).

1. Terminology and conceptual scope

In the supplied literature, the term FMPR is explicit only in PRISM, where it is a named component of a single-step diffusion-based text image super-resolution system. There, FMPR addresses the unreliability of text conditions extracted from heavily degraded inputs by learning a transport in a text-aware prior embedding space from an LQ-derived prior $c_l$ toward a privileged training-time prior $c^\star$ computed from paired low-quality and high-quality latents (Xu et al., 13 May 2026).

Elsewhere, the same functional role appears under different names. In "MoiréXNet," the paper states that the term FMPR is never used explicitly; the closest corresponding concept is the Truncated Flow Matching Prior (TFMP), which acts as a post-hoc prior-based correction stage that refines a supervised demoiréing output by aligning it with the clean image distribution (Li et al., 19 Jun 2025). In "Prior-Informed Flow Matching for Graph Reconstruction," the method is described as starting from an informed adjacency estimate and then learning a rectified flow that transports this estimate toward the clean-graph distribution; the paper explicitly notes that this is very close in spirit to what one might call FMPR (Chen et al., 29 Jan 2026).

This suggests a useful encyclopedic distinction between a strict and a broad use of the term. In the strict sense, FMPR refers to PRISM’s named embedding-space prior-transport module. In the broad sense, it denotes any flow-matching-based rectifier that starts from a prior estimate, degraded observation, or pretrained flow trajectory and then applies a learned transport or correction so that the resulting state is better aligned with a clean-image, clean-graph, or reward-regularized target distribution (Xu et al., 13 May 2026, Chen et al., 29 Jan 2026, Liu et al., 4 Dec 2025).

2. Mathematical structure

Across the supplied papers, flow-matching prior rectification is implemented in several mathematically distinct but structurally related forms. One form is embedding-space transport. In PRISM, the privileged prior is defined by

$$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$

the interpolation path is

$$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$

and inference uses Euler updates

$$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$

with $K=16$ in the reported implementation (Xu et al., 13 May 2026).

A second form is local ODE refinement in image space. TFMP in "MoiréXNet" is described through the learned velocity field

$\frac{\partial x_t}{\partial t} = v(x_t, t),$

with inference update

$x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$

The crucial truncation is that refinement starts from the supervised estimate $\tilde x$, initializes at a late time such as $t=0.95$, and refines only over a short interval such as $c^\star$0 with a small number of iterations (Li et al., 19 Jun 2025).

A third form is source-to-target transport from an informed initializer. In PIFM, the source graph is not Gaussian noise but

$c^\star$1

the path is

$c^\star$2

and the rectified-flow loss is

$c^\star$3

Inference then integrates the learned ODE by Euler steps from the prior-informed start (Chen et al., 29 Jan 2026).

A fourth form is posterior-guided velocity correction. In MPFlow, the unconditional rectified-flow prior is retained, but the velocity field is rectified online by measurement and auxiliary-modality gradients: $c^\star$4

$c^\star$5

Here rectification is not applied to the source prior itself but to the instantaneous transport field during sampling (Kim et al., 4 Mar 2026).

A fifth form is velocity-space residual control. In VGG-Flow, the aligned field is written as

$c^\star$6

with optimal correction

$c^\star$7

This is a prior-preserving alignment formulation in which the pretrained flow acts as a base prior and the rectification is the value-gradient correction field (Liu et al., 4 Dec 2025).

3. Sites of rectification

The supplied literature rectifies different objects: prior embeddings, image estimates, graph adjacencies, latent source states, velocity fields, and training losses. The following table summarizes those loci.

Method	Rectified object	Mechanism
PRISM FMPR	LQ prior embedding $c^\star$8	Flow transport toward privileged prior $c^\star$9
TFMP in MoiréXNet	Supervised restored image $$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$0	Truncated ODE refinement in image space
PIFM	Prior-filled adjacency $$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$1	Rectified flow from informed source to clean graph
FMPlug	Source/trajectory for pretrained FM prior	Time-adaptive warm-up and Gaussian-shell constraint
MPFlow	Unconditional velocity field $$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$2	Posterior-gradient correction during sampling
FMCT / EFMCT	Prior-driven CT trajectory	Data-consistency correction after each flow step
MFFM	Source distribution $$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$3	Residual-calibrated and locally correlated source
DEFAR / ReflexFlow	Off-path training states and losses	Anti-drift target rectification and frequency reweighting

These variants support a common interpretation: a flow prior becomes most useful when it is coupled to an additional mechanism that corrects either its initialization, its local drift, or its target state. In PRISM the correction target is a privileged prior space; in TFMP it is the clean-image manifold; in PIFM it is the clean-graph distribution; in FMPlug it is the region of latent space where the pretrained FM model is statistically trustworthy; and in MPFlow it is the posterior induced by measurements and auxiliary anatomy (Xu et al., 13 May 2026, Li et al., 19 Jun 2025, Chen et al., 29 Jan 2026, Wan et al., 1 Aug 2025, Kim et al., 4 Mar 2026, Shi et al., 27 Feb 2026, Chen et al., 15 May 2026, Huang et al., 26 Jun 2026).

4. Representative instantiations across domains

In text image super-resolution, FMPR is a training-time privileged-prior transport. PRISM first constructs $$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$4 from $$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$5, then learns a recoverable LQ-only prior $$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$6, then transports $$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$7 toward $$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$8 and uses the recovered prior $$c^{\star} = \mathcal{E}_{\mathrm{p}}([z_l;z_h]), \qquad c^{\star}\in\mathbb{R}^{N\times D},$$9 as the text-aware cross-attention condition for a one-step diffusion restorer. The paper explicitly separates global prior rectification from local structure refinement: FMPR handles global text identity and coarse glyph structure, whereas SURE handles local stroke boundaries and topology (Xu et al., 13 May 2026).

In image and video demoiréing, TFMP is a post-hoc rectifier layered on top of a supervised RAW-to-sRGB backbone. The backbone absorbs the nonlinear inversion, while TFMP performs a short prior-driven refinement from a late time point such as $$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$0, motivated by the claim that applying plug-and-play flow matching directly to nonlinear moiré inputs can introduce artifacts such as bullring effects (Li et al., 19 Jun 2025).

In graph reconstruction, PIFM first forms an approximate posterior-mean adjacency estimate using graphons, GraphSAGE, or node2vec, then uses rectified flow matching to transport that informed estimate toward the clean-graph distribution. The paper grounds this in a distortion–perception viewpoint: the prior gives a local or MMSE-like estimate, and the flow learns a global coupling that repairs dependence structure missed by the prior (Chen et al., 29 Jan 2026).

In inverse problems with pretrained foundation FM models, FMPlug reframes rectification as correcting how a generic pretrained flow prior is entered. Its warm-start optimization

$$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$1

injects the observation into an intermediate point of the FM trajectory, and its “sharp Gaussianity regularization” constrains $$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$2 to remain on the high-dimensional Gaussian shell where the model was trained. The later “Saving Foundation Flow-Matching Priors” version extends the same interpretation to scientific inverse problems including linear inverse scattering and MRI (Wan et al., 1 Aug 2025, Wan et al., 20 Nov 2025).

In zero-shot MRI reconstruction, MPFlow leaves the rectified-flow prior unchanged and instead rectifies the sampling field using measurement consistency and PAMRI feature alignment with an auxiliary registered modality. This is an explicitly posterior-guided rectification of the velocity field, intended to reduce intrinsic and extrinsic hallucinations without retraining the prior (Kim et al., 4 Mar 2026).

In sparse-view CT reconstruction, FMCT alternates deterministic flow transport

$$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$3

with data-consistency correction based on an extrapolated endpoint estimate

$$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$4

EFMCT further reuses previously predicted velocities when residual growth remains controlled, so rectification is combined with a specific efficiency strategy (Shi et al., 27 Feb 2026).

In multi-fidelity PDE refinement, MFFM rectifies not the trajectory after training but the source distribution used in conditional flow matching. White noise is blurred, normalized, and scaled by empirical residual standard deviations,

$$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$5

so the flow starts from a residual-calibrated, locally correlated source rather than an isotropic Gaussian. The paper presents this as a design choice for improving “flow-matching training geometry” in residual refinement (Chen et al., 15 May 2026).

In protein pocket generation, PocketFlow does not alter the flow-matching path during training, but it rectifies the learned sampler at inference by adding affinity and geometry guidance to the vector field. In beam prediction, rectification appears instead as a terminal flow constraint

$$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$6

that corrects endpoint mismatch under coarse Euler integration (Zhang et al., 2024, Zheng et al., 25 Nov 2025).

In exposure-bias mitigation, DEFAR and ReflexFlow are not prior-rectification methods in the narrow source-distribution sense. They instead rectify the effective intermediate-state distribution encountered at inference by training on one-step drifted states and imposing anti-drift directional supervision plus frequency-aware loss reweighting. This is a training-time path-rectification view of FMPR-like behavior (Huang et al., 26 Jun 2026, Huang et al., 4 Dec 2025).

5. Empirical behavior and observed trade-offs

The supplied literature consistently presents rectification as a modest but meaningful improvement over an unrectified flow prior or initializer. In PRISM, the “Flow Matching” prior-learning variant improves over the base model on RealCE-val from PSNR $$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$7 to $$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$8, LPIPS $$c(t) = (1-t)c_l+t c^{\star}, \quad \mathcal{V}_{\mathrm{FM}}(c(t),t) = \frac{d c(t)}{d t} = c^{\star} - c_l,$$9 to $$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$0, FID $$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$1 to $$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$2, ACC $$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$3 to $$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$4, and NED $$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$5 to $$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$6; the privileged reference $$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$7 is stronger still, which the paper interprets as an upper bound for prior recovery (Xu et al., 13 May 2026).

In MoiréXNet, adding TFMP on top of the INN+LFEF-enhanced backbone improves PSNR/SSIM from $$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$8 to $$c^{k+1}=c^k+\frac{1}{K}\mathcal{V}_{\mathrm{FM}}\!\left(c^k,\frac{k}{K}\right), \qquad \hat c=c^K,$$9, summarized as $K=16$0 dB PSNR and $K=16$1 SSIM. The paper also reports RawVDemoiré results in which the refined version reaches $K=16$2 and $K=16$3, while cautioning that flow-based refinement can sometimes raise LPIPS or introduce visually unnatural artifacts if overused (Li et al., 19 Jun 2025).

In graph reconstruction, PIFM shows the clearest “prior improvement” pattern. At $K=16$4 masking on IMDB-B, GraphSAGE prior achieves AUC $K=16$5, Flow with Gaussian prior $K=16$6, and PIFM(GraphSAGE) $K=16$7. On PROTEINS at $K=16$8 masking, GraphSAGE prior gives AUC $K=16$9, Flow with Gaussian prior $\frac{\partial x_t}{\partial t} = v(x_t, t),$0, and PIFM(GraphSAGE) $\frac{\partial x_t}{\partial t} = v(x_t, t),$1. The paper explicitly emphasizes that the flow improves the base priors rather than merely reproducing them (Chen et al., 29 Jan 2026).

In inverse problems, FMPlug reports consistent gains over D-Flow. For DIV2K super-resolution, D-Flow obtains $\frac{\partial x_t}{\partial t} = v(x_t, t),$2 in PSNR/SSIM/LPIPS/CLIPIQA, whereas FMPlug-W-R improves to $\frac{\partial x_t}{\partial t} = v(x_t, t),$3. On AFHQ super-resolution, D-Flow gives $\frac{\partial x_t}{\partial t} = v(x_t, t),$4, and FMPlug-W-R gives $\frac{\partial x_t}{\partial t} = v(x_t, t),$5. The paper attributes the first gain to warm-start rectification and the additional gain to sharp Gaussianity regularization (Wan et al., 1 Aug 2025).

In MRI, MPFlow reports that on HCP and BraTS it matches diffusion baselines on image quality using only $\frac{\partial x_t}{\partial t} = v(x_t, t),$6 of sampling steps, and that tumor hallucinations are reduced by more than $\frac{\partial x_t}{\partial t} = v(x_t, t),$7 in segmentation Dice score. At $\frac{\partial x_t}{\partial t} = v(x_t, t),$8, the hallucination analysis reports BraTS measurement loss improving from $\frac{\partial x_t}{\partial t} = v(x_t, t),$9 to $x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$0 and tumor segmentation Dice improving from $x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$1 to $x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$2 when the full posterior-guided formulation is used (Kim et al., 4 Mar 2026).

In PDE refinement, MFFM shows that source calibration matters: replacing the calibrated source with IID noise degrades, for example, Navier–Stokes from $x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$3 to $x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$4, Shear-P from $x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$5 to $x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$6, and Darcy from $x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$7 to $x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$8. Removing Gaussian blur gives a smaller but mostly consistent degradation, which the paper interprets as evidence that matching both residual scale and local correlation improves training geometry (Chen et al., 15 May 2026).

In exposure-bias rectification, DEFAR and ReflexFlow report large FID reductions relative to SiT baselines. ReflexFlow reports unconditional CelebA-64 FID improving from $x_{t-1} = x_t + \Delta t \cdot v(x_t, t).$9 to $\tilde x$0, a $\tilde x$1 reduction, and conditional ImageNet-256 FID improving from $\tilde x$2 to $\tilde x$3 without classifier-free guidance. DEFAR reports unconditional CelebA-64 improving from $\tilde x$4 to $\tilde x$5 as training proceeds and emphasizes that both ADR and FC contribute, with stronger low-frequency recovery at early high-noise stages (Huang et al., 4 Dec 2025, Huang et al., 26 Jun 2026).

These results also expose a recurring trade-off. Rectification improves fidelity, realism, or alignment when it remains local or well-calibrated; overly strong correction can overshoot, collapse diversity, or create artifacts. That trade-off is explicit in TFMP’s late-time truncation, FMPlug’s shell constraint, MPFlow’s guidance weights and seed search, PocketFlow’s guidance-strength study, and VGG-Flow’s $\tilde x$6 alignment–preservation balance (Li et al., 19 Jun 2025, Wan et al., 1 Aug 2025, Kim et al., 4 Mar 2026, Zhang et al., 2024, Liu et al., 4 Dec 2025).

6. Limitations, controversies, and open directions

A recurring limitation is incomplete specification. "MoiréXNet" gives the TFMP ODE and update equations, initialization time $\tilde x$7, and the interpretation that PSNR peaks around iteration 15, but it does not specify the flow-prior architecture, the exact training loss, the interpolation/path construction, or whether the prior is trained jointly or separately. The paper explicitly states that any statement beyond the provided ODE and update equations would be an inference from standard flow-matching practice rather than a direct extraction (Li et al., 19 Jun 2025).

A second limitation is dependence on side information or domain assumptions. PRISM requires paired LQ/HQ supervision during training and is evaluated on text-line super-resolution rather than full-scene text restoration. MPFlow assumes a registered auxiliary modality and notes that misregistration or anatomically inconsistent modalities can bias the reconstruction. FMPlug assumes that the degraded observation $\tilde x$8 is close to the desired $\tilde x$9, or else that a small set of relevant exemplars is available. PIFM is currently limited to homogeneous graphs. MFFM assumes paired low- and high-fidelity fields on aligned grids. These constraints delimit when FMPR-style methods are plausible (Xu et al., 13 May 2026, Kim et al., 4 Mar 2026, Wan et al., 1 Aug 2025, Chen et al., 29 Jan 2026, Chen et al., 15 May 2026).

A third issue is what exactly is being rectified. Some papers rectify a source prior, as in MFFM’s residual-calibrated source distribution. Others rectify an initial estimate, as in PRISM, TFMP, and PIFM. Others rectify the vector field online, as in MPFlow and FMCT. Others rectify training-time exposure bias, as in DEFAR and ReflexFlow. This plurality of mechanisms means that FMPR is better regarded as a family of constructions than as a single canonical algorithm (Chen et al., 15 May 2026, Xu et al., 13 May 2026, Li et al., 19 Jun 2025, Chen et al., 29 Jan 2026, Kim et al., 4 Mar 2026, Shi et al., 27 Feb 2026, Huang et al., 26 Jun 2026, Huang et al., 4 Dec 2025).

A fourth limitation concerns theoretical exactness. ICTM for linear inverse problems offers an approximate MAP decomposition into local MAP objectives and a Tweedie-based local score formula, but it is explicit that the argument depends on interpolation-path compliance and converges in the $t=0.95$0 limit. VGG-Flow derives a prior-preserving alignment rule from HJB optimal control and gives $t=0.95$1 and KL-related bounds, yet it still optimizes a velocity-space proxy rather than an exact posterior path measure. PocketFlow similarly resembles prior rectification at inference time, but its priors enter mainly through guidance and interaction supervision rather than a modified CFM objective (Zhang et al., 2024, Liu et al., 4 Dec 2025, Zhang et al., 2024).

A final misconception addressed by the literature is that a stronger flow prior alone is sufficient. Several papers argue the opposite. Generic plug-and-play flow matching can fail on nonlinear moiré degradation; broad foundation FM priors can underperform even untrained priors unless their entry trajectory is rectified; and standard FM training can suffer from exposure bias even when the base model is strong. The emerging lesson is narrower: the utility of flow matching in restoration, reconstruction, and alignment often depends less on the unconditional prior in isolation than on the mechanism used to rectify its source state, transport path, or local field (Li et al., 19 Jun 2025, Wan et al., 1 Aug 2025, Wan et al., 20 Nov 2025, Huang et al., 26 Jun 2026, Huang et al., 4 Dec 2025).