cs.LGOct 15, 2024

Hessian-Informed Flow Matching

Authors: Christopher Iliffe Sprague, Mert Can Kurucu, Riccardo Tedoldi, Alessandro Tibo, Jon Paul Janet, Hossein Azizpour

Organizations: SciLifeLab & KTH Stockholm · KTH Stockholm

Abstract

Data from physical systems often concentrate near stable states corresponding to minima of an energy function. Around these states, the curvature of the energy landscape shapes the local covariance structure of the data, which is often highly anisotropic: small perturbations around a data point raise its energy more sharply in some directions than in others. However, standard flow matching commonly connects noise to target data through isotropic conditional paths that do not explicitly follow this physical structure. We introduce Hessian-Informed Flow Matching (HI-FM), which uses the energy Hessian at each data sample to encode this local curvature in the conditional probability paths used for training. By locally linearizing energy-driven dynamics, we derive anisotropic paths that move samples toward their targets at different rates in different directions, without changing the standard flow matching objective. We evaluate HI-FM through molecular generation on Hessian-QM9 and GEOM-Drugs, using SemlaFlow as a shared backbone. With Hessians calculated offline only for the training data, across both datasets, HI-FM improves the physical and geometric quality of generated molecules while maintaining comparable chemical validity. Under a matched optimizer-update budget, HI-FM trained with only 10%10\% of Hessian-QM9 achieves lower mean energy, strain, and bond-length W1W_1 than the full-data SemlaFlow baseline. The results support local energy curvature as a useful inductive bias for flow matching.

Figures & tables

Appendix figures & tables9 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Feb 25, 2026

Flow Matching is Adaptive to Manifold Structures

Flow matching has emerged as a simulation-free alternative to diffusion-based generative modeling, producing samples by solving an ODE whose time-dependent velocity field is learned along an interpolation between a simple source distribution (e.g., a standard normal) and a target data distribution. Flow-based methods often exhibit greater training stability and have achieved strong empirical performance in high-dimensional settings where data concentrate near a low-dimensional manifold, such as text-to-image synthesis, video generation, and molecular structure generation. Despite this success, existing theoretical analyses of flow matching assume target distributions with smooth, full-dimensional densities, leaving its effectiveness in manifold-supported settings largely unexplained. To this end, we theoretically analyze flow matching with linear interpolation when the target distribution is supported on a smooth manifold. We establish a non-asymptotic convergence guarantee for the learned velocity field, and then propagate this estimation error through the ODE to obtain statistical consistency of the implicit density estimator induced by the flow-matching objective. The resulting convergence rate is near minimax-optimal, depends only on the intrinsic dimension, and reflects the smoothness of both the manifold and the target distribution. Together, these results provide a principled explanation for how flow matching adapts to intrinsic data geometry and circumvents the curse of dimensionality.
Apr 6, 2026

Isokinetic Flow Matching for Pathwise Straightening of Generative Flows

Flow Matching (FM) constructs linear conditional probability paths, but the learned marginal velocity field inevitably exhibits strong curvature due to trajectory superposition. This curvature severely inflates numerical truncation errors, bottlenecking few-step sampling. To overcome this, we introduce Isokinetic Flow Matching (Iso-FM), a lightweight, Jacobian-free dynamical regularizer that directly penalizes pathwise acceleration. By using a self-guided finite-difference approximation of the material derivative Dv/Dt, Iso-FM enforces local velocity consistency without requiring auxiliary encoders or expensive second-order autodifferentiation. Operating as a pure plug-and-play addition to single-stage FM training, Iso-FM dramatically improves few-step generation. On CIFAR-10 (DiT-S/2), Iso-FM slashes conditional non-OT FID at 2 steps from 78.82 to 27.13 - a 2.9x relative efficiency gain - and reaches a best-observed FID at 4 steps of 10.23. These results firmly establish acceleration regularization as a principled, compute-efficient mechanism for fast generative sampling.
May 1, 2026

Posterior Augmented Flow Matching

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.