Inverse Poisson Flow Matching (IPFM)

• Inverse Poisson Flow Matching is a distillation framework that trains a generator by aligning its induced electrostatic field with that of a pretrained teacher.
• It employs an inverse problem formulation where the generator is optimized to replicate the teacher’s field rather than following trajectories directly.
• Empirical studies on datasets like CIFAR-10 and FFHQ show that IPFM achieves competitive FID scores with few generation steps and efficient convergence across auxiliary dimensions.

Searching arXiv for papers on Inverse Poisson Flow Matching and closely related flow-matching inverse formulations. Inverse Poisson Flow Matching (IPFM) is a distillation framework for electrostatic generative models, introduced in the context of PFGM++ and formulated as an inverse problem: the objective is to learn a generator whose induced electrostatic field matches that of a pretrained teacher (Shlenskii et al., 26 Sep 2025). In this usage, “Poisson flow” refers to the electrostatic flow defined in the augmented-space formulation of PFGM++, and “inverse” denotes solving the reverse problem of finding a distribution or generator whose field reproduces the teacher field rather than matching trajectories directly (Shlenskii et al., 26 Sep 2025). The framework is defined for all auxiliary dimensions $D$, recovers a diffusion-model regime as $D\to\infty$, and is motivated by the high ODE cost of teacher sampling in electrostatic generative models (Shlenskii et al., 26 Sep 2025).

1. Electrostatic generative models and the Poisson-flow setting

IPFM is built on the electrostatic formulation of PFGM++, where data $\mathbf{y}\in\mathbb{R}^N$ are embedded into an augmented space $\mathbb{R}^{N+D}$ by appending $D$ auxiliary coordinates. Each data point is placed at

$$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$

and the electrostatic field in augmented space is

$$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$

with $\tilde{\mathbf{x}}=(\mathbf{x},\mathbf{z})$ (Shlenskii et al., 26 Sep 2025). PFGM++ exploits rotational symmetry in the auxiliary coordinates by tracking the scalar radius

$r=\|\mathbf{z}\|_2,$

and uses the normalized flow

$$\frac{d\mathbf{x}}{dr}=\frac{\mathbf{E}(\tilde{\mathbf{x}})_{\mathbf{x}}}{\mathbf{E}(\tilde{\mathbf{x}})_r}.$$

Sampling starts from a high-noise prior at $D\to\infty$0 (Shlenskii et al., 26 Sep 2025).

The associated training problem is denoising-style regression under a heavy-tailed perturbation kernel,

$D\to\infty$1

with a field estimator $D\to\infty$2 trained to predict the normalized field direction (Shlenskii et al., 26 Sep 2025). In practice, PFGM++ commonly uses the denoising parameterization

$D\to\infty$3

which converts the field-learning problem into regression to clean data (Shlenskii et al., 26 Sep 2025).

This electrostatic construction is the immediate mathematical substrate of IPFM. The distillation problem is not posed in pixel space alone, nor as a generic consistency objective, but in terms of the field induced by a student distribution in the same augmented electrostatic geometry as the teacher.

2. IPFM as an inverse problem over induced fields

The defining move in IPFM is to treat distillation as an inverse problem. Let $D\to\infty$4 denote the teacher’s true renormalized Poisson flow induced by the real data distribution $D\to\infty$5. IPFM trains a generator $D\to\infty$6 so that the student distribution $D\to\infty$7 induces a student field $D\to\infty$8 that matches $D\to\infty$9 (Shlenskii et al., 26 Sep 2025).

The corresponding constrained problem is written as

$\mathbf{y}\in\mathbb{R}^N$0

subject to

$\mathbf{y}\in\mathbb{R}^N$1

where $\mathbf{y}\in\mathbb{R}^N$2, $\mathbf{y}\in\mathbb{R}^N$3, and $\mathbf{y}\in\mathbb{R}^N$4 (Shlenskii et al., 26 Sep 2025). The inner problem trains a student denoiser or field estimator on samples produced by the current generator, while the outer problem updates the generator so that the field induced by its samples approaches the teacher field.

The paper’s central theorem is a tractable minimax reformulation. For any positive weighting $\mathbf{y}\in\mathbb{R}^N$5,

$\mathbf{y}\in\mathbb{R}^N$6

In denoising form, using

$\mathbf{y}\in\mathbb{R}^N$7

the objective becomes

$\mathbf{y}\in\mathbb{R}^N$8

which is the implementation form reported in the paper (Shlenskii et al., 26 Sep 2025).

Conceptually, IPFM does not ask the student to replay a teacher trajectory pointwise. Instead, it asks for a student distribution whose own optimal denoiser induces the same electrostatic field. That distinction is the precise sense in which the method is “inverse.”

3. Diffusion limit and relation to Score Identity Distillation

A central structural feature of IPFM is its continuity with diffusion models. In PFGM++, setting

$\mathbf{y}\in\mathbb{R}^N$9

and taking $\mathbb{R}^{N+D}$0 yields the diffusion-model limit: the perturbation kernel becomes Gaussian,

$\mathbb{R}^{N+D}$1

and the PFGM++ ODE converges to the diffusion ODE (Shlenskii et al., 26 Sep 2025).

In this limit, the IPFM objective becomes

$\mathbb{R}^{N+D}$2

The paper proves a close relationship to Score Identity Distillation (SiD): $\mathbb{R}^{N+D}$3 Accordingly, IPFM and SiD are tightly related but not identical. The paper further states that SiD with regularization $\mathbb{R}^{N+D}$4 corresponds exactly to the $\mathbb{R}^{N+D}$5 IPFM objective up to a constant factor (Shlenskii et al., 26 Sep 2025).

This diffusion-limit result situates IPFM as a finite-$\mathbb{R}^{N+D}$6 generalization of diffusion distillation. The formulation is not merely analogous to SiD; it is asymptotically connected to it through the electrostatic-to-diffusion limit of PFGM++.

4. Regularization, optimization, and sampling procedure

The paper transfers SiD-style regularization into finite-$\mathbb{R}^{N+D}$7 IPFM through

$\mathbb{R}^{N+D}$8

Empirically, $\mathbb{R}^{N+D}$9 is reported to work well and to be stable across settings, whereas $D$0 can destabilize training depending on architecture and $D$1 (Shlenskii et al., 26 Sep 2025).

The optimization scheme alternates between two networks, a generator $D$2 and a student denoiser $D$3, both initialized from pretrained teacher weights $D$4 (Shlenskii et al., 26 Sep 2025). The student update samples $D$5, perturbs it to $D$6, and minimizes a denoising loss

$D$7

The generator update again samples $D$8 and optimizes

$D$9

Training is stopped when FID plateaus or the budget is exhausted (Shlenskii et al., 26 Sep 2025).

Although the distilled generator can sample in one step, the paper also uses a multi-step refinement scheme at inference. The procedure starts from a high-noise prior at $$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$0, alternates denoising with $$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$1 and re-noising to the next level using the PFGM++ kernel, and returns the final denoised output (Shlenskii et al., 26 Sep 2025). This makes IPFM compatible with both one-step and few-step generation regimes.

5. Empirical behavior across auxiliary dimension $$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$2

The empirical study in the IPFM paper uses CIFAR-10 and FFHQ $$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$3, with FID evaluated on 50k generated samples and the minimum taken over three runs (Shlenskii et al., 26 Sep 2025). The principal reported result is that IPFM distills expensive PFGM++ teachers into very few-step generators: on CIFAR-10, a 4-step IPFM generator matches the 35-NFE teacher, and on FFHQ $$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$4, a 2-step IPFM generator surpasses the 79-NFE teacher (Shlenskii et al., 26 Sep 2025).

Regularization improves both convergence and final quality. The paper reports, for CIFAR-10 with $$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$5 and 4 steps, FID $$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$6 without regularization and FID $$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$7 with $$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$8. For FFHQ $$\tilde{\mathbf{y}}=(\mathbf{y},\mathbf{0})\in\mathbb{R}^{N+D},$$9 with $$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$0 and 2 steps, it reports FID $$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$1 without regularization and FID $$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$2 with $$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$3 (Shlenskii et al., 26 Sep 2025). These examples are presented as representative of a broader pattern in which regularized IPFM often outperforms the corresponding PFGM++ teachers in few-step settings.

A distinctive observation concerns the role of finite $$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$4. The paper reports results for $$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$5, $$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$6, and $$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$7, and concludes that IPFM works across all values of $$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$8, but that finite $$\mathbf{E}(\tilde{\mathbf{x}})=\frac{1}{S_{N+D-1}}\int \frac{\tilde{\mathbf{x}}-\tilde{\mathbf{y}}}{\|\tilde{\mathbf{x}}-\tilde{\mathbf{y}}\|_2^{N+D}}\,p(\mathbf{y})\,d\mathbf{y},$$9 often converges more efficiently than the diffusion limit (Shlenskii et al., 26 Sep 2025). The explanation offered in the paper is that finite-$\tilde{\mathbf{x}}=(\mathbf{x},\mathbf{z})$0 perturbation kernels are heavier-tailed, teachers at lower $\tilde{\mathbf{x}}=(\mathbf{x},\mathbf{z})$1 are more robust to distribution shift, and therefore early in training the teacher sees less out-of-distribution generator samples and provides a cleaner signal (Shlenskii et al., 26 Sep 2025). The same source states that this effect is strongest in one-step generation.

This empirical pattern is specific to electrostatic generative models. It does not merely assert that finite $\tilde{\mathbf{x}}=(\mathbf{x},\mathbf{z})$2 is different from diffusion; it identifies a concrete optimization advantage for distillation in the electrostatic regime.

6. Terminological scope, related usages, and open theoretical context

The label “inverse” is used in multiple, only partially overlapping senses in recent flow literature. In the IPFM paper, it denotes distillation by recovering a generator from field information (Shlenskii et al., 26 Sep 2025). In the mathematically oriented paper “On the Inverse Flow Matching Problem in the One-Dimensional and Gaussian Cases,” the inverse problem is instead identifiability of the coupling $\tilde{\mathbf{x}}=(\mathbf{x},\mathbf{z})$3 from induced flow information; uniqueness is established in one dimension and in the Gaussian case, while the general multidimensional problem remains open (Korotin et al., 29 Dec 2025). This suggests that rigorous identifiability theory for inverse flow constructions is presently strongest in restricted settings rather than in full multivariate generality.

The acronym landscape also requires care. “PPFM: Image denoising in photon-counting CT using single-step posterior sampling Poisson flow generative models” uses the term PPFM for a conditional version of PFGM++ aimed at posterior sampling in CT inverse problems, with hijacking and regularization enabling NFE $\tilde{\mathbf{x}}=(\mathbf{x},\mathbf{z})$4; it is a Poisson-flow generative model for inverse problems, but it is not the same method as IPFM (Hein et al., 2023). Likewise, “Guided Flow Matching for Forward and Inverse PDE Problems with Sparse Observations” does not use the name IPFM, yet its FM4PDE framework is directly relevant to Poisson-type inverse recovery because Poisson is one of its benchmark PDEs and the guidance loss includes a PDE residual term (Zhang et al., 25 May 2026). “FLOWER: A Flow-Matching Solver for Inverse Problems” develops a flow-matching inverse-problem solver for linear Gaussian inverse problems, not a Poisson-noise model, and is therefore best understood as a closely related inverse-solver template rather than a direct IPFM method (Pourya et al., 30 Sep 2025).

These distinctions matter because “Inverse Poisson Flow Matching” can otherwise be conflated with at least three adjacent ideas: inverse identifiability for flow matching, posterior sampling with Poisson-flow generative models, and Poisson-type PDE inverse recovery. In the literature summarized here, IPFM in the strict sense refers to the distillation framework for electrostatic generative models introduced in (Shlenskii et al., 26 Sep 2025).

A plausible implication is that IPFM occupies a bridge position between electrostatic generative modeling and broader inverse-flow research. It inherits the augmented-space Poisson-flow structure of PFGM++, connects asymptotically to diffusion distillation through SiD, and sits alongside a growing body of work that uses flow matching for inverse recovery, posterior sampling, and identifiability analysis (Shlenskii et al., 26 Sep 2025). The open multidimensional identifiability questions emphasized in inverse FM theory indicate that a complete general theory of inverse Poisson-flow constructions remains unfinished (Korotin et al., 29 Dec 2025).