Posterior Augmented Flow Matching

• URL: http://arxiv.org/abs/2605.00825v1
• Date: Fri, 01 May 2026 17:59:59 GMT
• Title: Posterior Augmented Flow Matching
• Abstract summary: Posterior-Augmented Flow Matching (PAFM) is a generalization of flow matching (FM)<n>We show that PAFM improves over FM by up to 3.4 FID50K across different model scales.
• Score: 64.1559809786948
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Flow matching (FM) trains a time-dependent vector field that transports samples from a simple prior to a complex data distribution. However, for high-dimensional images, each training sample supervises only a single trajectory and intermediate point, yielding an extremely sparse and high-variance training signal. This under-constrained supervision can cause flow collapse, where the learned dynamics memorize specific source-target pairings, mapping diverse inputs to overly similar outputs, failing to generalize. We introduce Posterior-Augmented Flow Matching (PAFM), a theoretically grounded generalization of FM that replaces single-target supervision with an expectation over an approximate posterior of valid target completions for a given intermediate state and condition. PAFM factorizes this intractable posterior into (i) the likelihood of the intermediate under a hypothesized endpoint and (ii) the prior probability of that endpoint under the condition, and uses an importance sampling scheme to construct a mixture over multiple candidate targets. We prove that PAFM yields an unbiased estimator of the original FM objective while substantially reducing gradient variance during training by aggregating information from many plausible continuation trajectories per intermediate. Finally, we show that PAFM improves over FM by up to 3.4 FID50K across different model scales (SiT-B/2 and SiT-XL/2), different architectures (SiT and MMDiT), and in both class and text conditioned benchmarks (ImageNet and CC12M), with a negligible increase in the compute overhead. Code: https://github.com/gstoica27/PAFM.git.

Related papers

• One-Sided Quantile Coupling for Flow Matching [8.295726579539016]
  Flow Matching trains continuous-time generative models by regressing the velocity field of a probability path between a simple source distribution and a target data distribution.<n>We propose Quantile Coupling Flow Matching (QC-FM), a lightweight one-sided coupling that samples only the data batch and constructs each paired source directly.<n>QC-FM improves over the Baseline under matched training budgets, reducing FID by up to 12.9%, and outperforms OT-CFM on all four datasets.
  arXiv  Detail & Related papers  (2026-08-02T04:03:59Z)
• Earth System Foundation Model (ESFM): A unified framework for heterogeneous data integration and forecasting [52.53742727060265]
  Foundation models (FMs) for the Earth system learn statistical relationships between physical variables across massive datasets.<n>Here, we introduce Earth System Foundation Model (ESFM), a fully open model building on the 3Dwin UNet backbone of the pioneering model.<n>We present findings using dense gridded data (ERA5, CMIP6), regionally masked dense data, sparse gridded MODIS satellite data, and station data.<n>Results demonstrate competitive or superior performance relative to state-of-the-art benchmarks.
  arXiv  Detail & Related papers  (2026-04-20T11:40:39Z)
• COT-FM: Cluster-wise Optimal Transport Flow Matching [5.771040439456201]
  Flow Matching models often produce curved trajectories due to random or batchwise couplings.<n>COT-FM fixes this by clustering target samples and assigning each cluster a dedicated source distribution.<n>As a plug-and-play approach, COT-FM consistently accelerates sampling and improves generation quality across 2D datasets, image generation benchmarks, and robotic manipulation tasks.
  arXiv  Detail & Related papers  (2026-03-11T13:52:17Z)
• Riemannian MeanFlow for One-Step Generation on Manifolds [54.09734511705173]
  Flow Matching enables simulation-free training of generative models.<n>MeanFlow can be extended to manifold-valued generation where velocities lie in location-dependent tangent spaces.<n>Experiments on spheres, tori, and SO(3) demonstrate competitive one-step sampling with improved quality-efficiency trade-offs and substantially reduced sampling cost.
  arXiv  Detail & Related papers  (2026-03-11T12:41:46Z)
• Risk-Entropic Flow Matching [0.0]
  Tilted (entropic) risk, obtained by applying a log-exponential transform to a base loss, is a well established tool in statistics and machine learning.<n>We apply the standard risk-sensitive (log-exponential) transform to the conditional FM loss and show that the resulting tilted risk loss is a natural upper-bound on a meaningful conditional entropic FM objective.
  arXiv  Detail & Related papers  (2025-11-28T00:37:37Z)
• How and Why: Taming Flow Matching for Unsupervised Anomaly Detection and Localization [15.283777345273089]
  We formalize the concept of time-reversed Flow Matching as a vector field regression.<n>We show that FM with linear probability paths is inherently non-invertible.<n>We present the first successful application of FM for the unsupervised anomaly detection task.
  arXiv  Detail & Related papers  (2025-08-07T15:02:07Z)
• DFM: Interpolant-free Dual Flow Matching [0.8192907805418583]
  We propose an interpolant-free dual flow matching (DFM) approach without explicit assumptions about the modeled vector field. Experiments with the SMAP unsupervised anomaly detection show advantages of DFM when compared to the CNF trained with either maximum likelihood or FM objectives.
  arXiv  Detail & Related papers  (2024-10-11T20:46:04Z)
• Stream-level flow matching with Gaussian processes [4.935875591615496]
  Conditional flow matching (CFM) is a family of training algorithms for fitting continuous normalizing flows (CNFs)<n>We extend the CFM algorithm by defining conditional probability paths along streams'', instances of latent paths that connect data pairs of source and target.<n>We show that this generalization of the CFM can effectively reduce the variance in the estimated marginal vector field at a moderate computational cost.
  arXiv  Detail & Related papers  (2024-09-30T15:47:22Z)
• Flow matching achieves almost minimax optimal convergence [50.38891696297888]
  Flow matching (FM) has gained significant attention as a simulation-free generative model. This paper discusses the convergence properties of FM for large sample size under the $p$-Wasserstein distance. We establish that FM can achieve an almost minimax optimal convergence rate for $1 leq p leq 2$, presenting the first theoretical evidence that FM can reach convergence rates comparable to those of diffusion models.
  arXiv  Detail & Related papers  (2024-05-31T14:54:51Z)
• Diffusion Generative Flow Samplers: Improving learning signals through partial trajectory optimization [87.21285093582446]
  Diffusion Generative Flow Samplers (DGFS) is a sampling-based framework where the learning process can be tractably broken down into short partial trajectory segments. Our method takes inspiration from the theory developed for generative flow networks (GFlowNets)
  arXiv  Detail & Related papers  (2023-10-04T09:39:05Z)
• FPCR-Net: Feature Pyramidal Correlation and Residual Reconstruction for Optical Flow Estimation [72.41370576242116]
  We propose a semi-supervised Feature Pyramidal Correlation and Residual Reconstruction Network (FPCR-Net) for optical flow estimation from frame pairs. It consists of two main modules: pyramid correlation mapping and residual reconstruction. Experiment results show that the proposed scheme achieves the state-of-the-art performance, with improvement by 0.80, 1.15 and 0.10 in terms of average end-point error (AEE) against competing baseline methods.
  arXiv  Detail & Related papers  (2020-01-17T07:13:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.