Iterative Proportional Flow-Matching (IPFM)

• IPFM is a family of iterative correction schemes that realigns flow-matching models to reduce distributional mismatches during integration.
• It employs methodologies such as end-path correction and gradual refinement to adjust learned velocity fields for enhanced generative modeling.
• In discrete-time Schrödinger bridge training, IPFM leverages schedule-dependent scaling to improve image fidelity and reduce sampling artifacts.

Searching arXiv for the cited and related papers to ground the article. Iterative Proportional Flow-Matching (IPFM) denotes an iterative class of generative transport procedures in which a learned flow is repeatedly corrected toward a target distribution. In the current literature, the term has two related but distinct usages. In "Iterative Flow Matching -- Path Correction and Gradual Refinement for Enhanced Generative Modeling" (Haber et al., 23 Feb 2025), the term is an alignment of terminology for an iterative flow matching framework built from end-path correction and gradual refinement; the paper explicitly states that it did not use the specific term "Iterative Proportional Flow-Matching." In "Incorporating Pre-trained Diffusion Models in Solving the Schrödinger Bridge Problem" (Tang et al., 25 Aug 2025), IPFM is an explicit reparameterization for Schrödinger bridge training that matches terminus-directed flow targets scaled proportionally by the remaining schedule. In both settings, the central mechanism is iterative re-anchoring of transport dynamics to reduce mismatch between the distributions seen during training and those induced by actual integration.

1. Terminology and scope

The term IPFM is not yet fully standardized. One line of work uses it as a convenient label for an iterative enhancement of continuous-time flow matching, while another introduces it as a discrete-time Schrödinger bridge reparameterization within a unified SB–SGM framework (Haber et al., 23 Feb 2025, Tang et al., 25 Aug 2025). This suggests that IPFM should presently be understood as a family of closely related iterative correction schemes rather than a single canonical algorithm.

Usage of IPFM	Problem setting	Meaning of “proportional”
Iterative flow matching	Image generative modeling via probability flow ODEs	Time-rescaling factor $\frac{1}{1-t_j}$ in gradual refinement; optional discrepancy-based loss reweighting was not used in the reported experiments
SB reparameterization	Discrete-time Schrödinger bridge training with Gaussian conditionals	Schedule-dependent factors $\frac{1}{\bar{\gamma}_{k+1}}$ and $\frac{1}{1-\bar{\gamma}_k}$ in terminus-directed flow targets

The first formulation is organized around correcting the pushforward distribution produced by a flow-matching model. The second is organized around alternating forward and backward bridge training, with flow targets derived from endpoint-conditioned Gaussian bridge identities. The overlap is structural: both repeatedly replace idealized training paths with targets anchored to actually generated states.

2. Mathematical setting and transport viewpoint

In the iterative flow-matching formulation, a base distribution $\pi_0$ is transported to a target distribution $\pi_T$ by learning a velocity field $\mathbf{v}_\theta(\mathbf{x},t)$ in the probability flow ODE

$$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$

with induced density path $\{\rho_t\}$ satisfying the continuity equation

$$\partial_t \rho_t(\mathbf{x}) + \nabla \cdot \big(\rho_t(\mathbf{x})\,\mathbf{v}_t(\mathbf{x})\big) = 0.$$

The default path parameterization is the linear homotopy

$$\mathbf{x}_t = t\,\mathbf{x}_T + (1-t)\,\mathbf{x}_0,$$

with target velocity

$\frac{1}{\bar{\gamma}_{k+1}}$0

The standard flow-matching loss is least-squares regression on homotopy samples:

$\frac{1}{\bar{\gamma}_{k+1}}$1

In low-dimensional latent settings, the same paper also instantiates $\frac{1}{\bar{\gamma}_{k+1}}$2 as an RBF interpolant with Tikhonov regularization (Haber et al., 23 Feb 2025).

In the Schrödinger bridge formulation, the starting point is the path-space KL problem

$\frac{1}{\bar{\gamma}_{k+1}}$3

where the reference path measure factorizes as a discrete forward Markov chain with Gaussian transitions

$\frac{1}{\bar{\gamma}_{k+1}}$4

That paper uses the continuity equation only as intuition for “flow” learning; the implemented objectives are discrete-time and are tied to Gaussian bridge updates rather than an explicit PDE formulation (Tang et al., 25 Aug 2025).

Both lines of work connect IPFM to transport. The iterative flow-matching paper relates the continuity equation and kinetic energy integral to the Benamou–Brenier formulation of $\frac{1}{\bar{\gamma}_{k+1}}$5, while the Schrödinger bridge paper places IPFM inside entropic optimal transport over path measures (Haber et al., 23 Feb 2025, Tang et al., 25 Aug 2025).

3. Iterative correction in flow matching

A central claim of the iterative flow-matching formulation is that hallucinations arise because training and inference follow different intermediate distributions. Training samples lie on straight homotopy lines between paired $\frac{1}{\bar{\gamma}_{k+1}}$6, but inference integrates the learned field globally. As a result, the ODE can produce bent trajectories whose intermediate states follow $\frac{1}{\bar{\gamma}_{k+1}}$7, generating covariate shift: the model is accurate on $\frac{1}{\bar{\gamma}_{k+1}}$8 but must generalize off-path to $\frac{1}{\bar{\gamma}_{k+1}}$9. Endpoint deviations $\frac{1}{1-\bar{\gamma}_k}$0 then produce out-of-distribution samples or “hallucinations” (Haber et al., 23 Feb 2025).

This mismatch can be written through the trajectory residual

$\frac{1}{1-\bar{\gamma}_k}$1

with dynamics

$\frac{1}{1-\bar{\gamma}_k}$2

The paper argues that this residual accumulates interpolation error and off-path extrapolation, especially when homotopy lines intersect or nearly intersect near $\frac{1}{1-\bar{\gamma}_k}$3 (Haber et al., 23 Feb 2025).

Two correction mechanisms are then defined.

End-path correction retrains a flow from the current pushforward distribution to the target. Given $\frac{1}{1-\bar{\gamma}_k}$4, the iteration trains

$\frac{1}{1-\bar{\gamma}_k}$5

where

$\frac{1}{1-\bar{\gamma}_k}$6

and then integrates

$\frac{1}{1-\bar{\gamma}_k}$7

The resulting fixed-point viewpoint is

$\frac{1}{1-\bar{\gamma}_k}$8

with ideal contractive behavior

$\frac{1}{1-\bar{\gamma}_k}$9

Gradual refinement partitions time into checkpoints $\pi_0$0 and retrains on short corrected segments. On segment $\pi_0$1, the homotopy is re-anchored at the actual integrated state:

$\pi_0$2

with scaled target velocity

$\pi_0$3

Its objective is

$\pi_0$4

Here the term “proportional” refers explicitly to the factor $\pi_0$5, which rescales the segment velocity by the remaining time to the terminal point. The paper also allows an optional reweighting

$\pi_0$6

but states that such adaptive weights were not used in the reported experiments (Haber et al., 23 Feb 2025).

The theoretical motivation combines three ingredients: a contractivity assumption for the flow-matching update, Talagrand-based control of $\pi_0$7 by KL when $\pi_0$8 is log-concave, and an RBF approximation estimate

$\pi_0$9

showing that smaller transport velocity norms lower approximation complexity. The intended consequence is that iterative correction both shrinks the required velocity magnitude and aligns training with the actual marginals encountered during integration (Haber et al., 23 Feb 2025).

4. IPFM within Schrödinger bridge training

In the Schrödinger bridge paper, IPFM is defined directly as an iterative reparameterization of the bridge objectives. The learned quantities are discrete-time flow predictors pointing from an intermediate state toward the relevant terminus, scaled by the remaining fraction of the schedule. Specifically, at time index $\pi_T$0 the targets are

$\pi_T$1

where

$\pi_T$2

The corresponding losses are

$\pi_T$3

and

$\pi_T$4

These are the “proportional” targets of this formulation (Tang et al., 25 Aug 2025).

IPFM is related to two companion reparameterizations introduced in the same paper. IPMM predicts next-step means directly, and IPTM predicts the termini themselves. IPFM connects to IPMM by

$\pi_T$5

$\pi_T$6

Thus, the IPFM velocity multiplied by the local step size yields the mean update for the Gaussian bridge conditional (Tang et al., 25 Aug 2025).

The paper’s alternating scheme uses current backward trajectories to train the forward model and current forward trajectories to train the backward model. Proposition 1 states that the IPMM mean-matching losses are approximately equivalent to the original DSB losses under Gaussian conditional models. Proposition 2 derives proportional Gaussian bridge means of the form

$\pi_T$7

and

$\pi_T$8

which justify the IPTM and IPFM targets (Tang et al., 25 Aug 2025).

Conceptually, this version of IPFM is the one closest to a bridge between SB and continuous-time flow matching. The paper explicitly describes it as “flow-matching-like” within the SB framework, but still discrete-time, alternating, and tied to Gaussian bridge transitions rather than standard rectified-flow or continuous FM training (Tang et al., 25 Aug 2025).

5. Initialization, algorithms, and implementation regimes

The two IPFM lineages differ sharply in how they are instantiated.

In iterative flow matching, the algorithmic structure is stagewise correction. End-path correction initializes with samples $\pi_T$9, trains a standard FM model, integrates to obtain $\mathbf{v}_\theta(\mathbf{x},t)$0, computes a discrepancy $\mathbf{v}_\theta(\mathbf{x},t)$1, and repeats until $\mathbf{v}_\theta(\mathbf{x},t)$2. Gradual refinement instead iterates over temporal checkpoints, training and integrating on each corrected segment. The paper recommends choosing a discrepancy metric aligned with the data space, such as FID/IS in image space or ICP/transport-cost in latent space, and stopping when the discrepancy plateaus near the target’s internal self-similarity level (Haber et al., 23 Feb 2025).

That paper reports two main implementation regimes. One uses neural $\mathbf{v}_\theta(\mathbf{x},t)$3 in pixel or latent space for high-dimensional settings. The other uses an RBF interpolant in moderate-dimensional latent spaces with Gaussian kernel smoothing and ridge parameter $\mathbf{v}_\theta(\mathbf{x},t)$4. For images, the reported settings are MNIST with an autoencoder to 32-D latent space and CIFAR-10 with an autoencoder to 64-D latent space. End-path correction uses the linear schedule $\mathbf{v}_\theta(\mathbf{x},t)$5, while gradual refinement uses uniform partitions such as $\mathbf{v}_\theta(\mathbf{x},t)$6 equal segments (Haber et al., 23 Feb 2025).

In the Schrödinger bridge formulation, the algorithm is an alternating forward/backward training loop over $\mathbf{v}_\theta(\mathbf{x},t)$7 epochs and $\mathbf{v}_\theta(\mathbf{x},t)$8 timesteps with noise schedule $\mathbf{v}_\theta(\mathbf{x},t)$9 satisfying $$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$0. A key practical contribution is plug-and-play initialization from pre-trained SGMs. For a pre-trained flow-matching-style model $$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$1, the backward bridge mean predictor is initialized as

$$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$2

For high-resolution bidirectional tasks, the paper also uses dual initialization

$$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$3

The stated rationale is that the IPMM, IPTM, and IPFM targets align with common SGM targets, whereas naïve initialization of the original DSB objective suffers from time-state misalignment (Tang et al., 25 Aug 2025).

The reported hyperparameters for the SB experiments are Adam with learning rate $$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$4, $$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$5, no weight decay, and batch size $$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$6. The paper uses $$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$7 timesteps for CelebA $$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$8, a symmetric $$\frac{d\mathbf{x}_t}{dt} = \mathbf{v}_\theta(\mathbf{x}_t, t),\quad \mathbf{x}_0\sim \pi_0,$$9 schedule that grows then decays, and ADM or LDM backbones depending on the image setting (Tang et al., 25 Aug 2025).

6. Empirical behavior, limitations, and current interpretation

The iterative flow-matching paper reports that, in a Gaussian mixture example, after $\{\rho_t\}$0 end-path corrections the transport-cost metric dropped by roughly two orders of magnitude. For MNIST, FID decreased monotonically with iteration in latent space, approaching the dataset’s internal self-similarity. For CIFAR-10, the similarity metric in latent space decreased across iterations, with qualitative sample quality improving. The same paper states that end-path correction consistently improved fidelity and reduced out-of-distribution artifacts, while gradual refinement achieved similar endpoints but was less robust near $\{\rho_t\}$1; it attributes this sensitivity to the first segment, where many homotopy lines intersect and the target velocity points toward a center-of-mass direction (Haber et al., 23 Feb 2025).

The Schrödinger bridge paper reports stronger image-quality numbers for its own IPFM formulation. On Gaussian bridges, averaged $\{\rho_t\}$2 across times shows that from scratch IPFM, IPTM, and IPMM outperform DSB and several other baselines; for example, at $\{\rho_t\}$3, IPFM is reported as approximately $\{\rho_t\}$4 versus approximately $\{\rho_t\}$5 for DSB, and with SGM initialization improves further to approximately $\{\rho_t\}$6. On unconditional CelebA $\{\rho_t\}$7, IPFM achieves FID approximately $\{\rho_t\}$8, compared with approximately $\{\rho_t\}$9 for SGM. On AFHQ $$\partial_t \rho_t(\mathbf{x}) + \nabla \cdot \big(\rho_t(\mathbf{x})\,\mathbf{v}_t(\mathbf{x})\big) = 0.$$0 cat$$\partial_t \rho_t(\mathbf{x}) + \nabla \cdot \big(\rho_t(\mathbf{x})\,\mathbf{v}_t(\mathbf{x})\big) = 0.$$1dog translation, IPFM achieves FID approximately $$\partial_t \rho_t(\mathbf{x}) + \nabla \cdot \big(\rho_t(\mathbf{x})\,\mathbf{v}_t(\mathbf{x})\big) = 0.$$2, compared with approximately $$\partial_t \rho_t(\mathbf{x}) + \nabla \cdot \big(\rho_t(\mathbf{x})\,\mathbf{v}_t(\mathbf{x})\big) = 0.$$3 for the pre-trained SGM and approximately $$\partial_t \rho_t(\mathbf{x}) + \nabla \cdot \big(\rho_t(\mathbf{x})\,\mathbf{v}_t(\mathbf{x})\big) = 0.$$4–$$\partial_t \rho_t(\mathbf{x}) + \nabla \cdot \big(\rho_t(\mathbf{x})\,\mathbf{v}_t(\mathbf{x})\big) = 0.$$5 for SB baselines. The paper also states that IPFM consistently improves FID on Horse$$\partial_t \rho_t(\mathbf{x}) + \nabla \cdot \big(\rho_t(\mathbf{x})\,\mathbf{v}_t(\mathbf{x})\big) = 0.$$6Zebra and Selfie$$\partial_t \rho_t(\mathbf{x}) + \nabla \cdot \big(\rho_t(\mathbf{x})\,\mathbf{v}_t(\mathbf{x})\big) = 0.$$7Anime tasks (Tang et al., 25 Aug 2025).

Several limitations recur across both formulations. In iterative flow matching, computational overhead scales roughly linearly with the number of IPFM iterations $$\partial_t \rho_t(\mathbf{x}) + \nabla \cdot \big(\rho_t(\mathbf{x})\,\mathbf{v}_t(\mathbf{x})\big) = 0.$$8, and sampling cost scales with the number of stages and ODE steps. Extremely high-dimensional raw spaces can challenge velocity interpolation, especially for RBFs, and the paper recommends latent-space training for images (Haber et al., 23 Feb 2025). In the Schrödinger bridge setting, convergence depends strongly on initialization quality; poor initialization yields inaccurate trajectories and slow convergence, and the paper explicitly notes that its analysis provides equivalence propositions and empirical evidence rather than full continuous-time convergence proofs (Tang et al., 25 Aug 2025).

A common misconception is to treat IPFM as a single fully settled method. The current literature does not support that reading. One formulation is an iterative correction scheme for standard flow matching, and the other is a proportional reparameterization of discrete Schrödinger bridge training. Another misconception is that “proportional” always means adaptive discrepancy weighting. In the iterative flow-matching paper, the reported experiments did not use adaptive weighting and used “proportional” only through the time-rescaling factor in gradual refinement. In the Schrödinger bridge paper, “proportional” refers to schedule-normalized terminus-directed targets (Haber et al., 23 Feb 2025, Tang et al., 25 Aug 2025).

Taken together, these works define IPFM as a technically coherent but terminologically bifurcated research direction. Its shared principle is iterative correction of transport targets using the actually induced distributions or bridge trajectories, with explicit proportional scaling that makes the learned direction field compatible with the remaining time or noise schedule.