arXiv Machine Learning By Francesco M. Ruscio, Timothy James Hitge, Fred Zhangzhi Peng, Danyal Rehman, Zander W. Blasingame, Nicholas M. Boffi, Michael M. Bronstein, Alexander Tong, Avishek Joey Bose

Normalizing Flow Maps

Read the original on arXiv Machine Learning →

The paper introduces Normalizing Flow Maps (NFM), a new class of exactly invertible pushforward maps that extend normalizing flows and flow maps by learning the integrator of an underlying dynamical system while enabling efficient exact likelihood evaluation. NFMs incorporate two consistency axes—pointwise matching for β1-based regression losses and distributional matching for aligning pushforward distributions with a forward process—allowing scalable training. Experiments on CIFAR-10, ImageNet-64, and Boltzmann Generators demonstrate that NFMs achieve state‑of‑the‑art sample quality among parameter‑matched normalizing flows and outperform prior normalizing flows on peptide benchmarks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Oct 7

A perspective note on likelihood approximation and inference for complex simulation models using a chain of aggregated normalizing flows

The paper proposes a new approach to likelihood approximation for complex simulation models using a chain of aggregated normalizing flows. It describes a sequential estimation strategy where each set of bijective transformations is optimized independently, enabling scalable and controllable simulation routines for large‑scale data analysis. The framework also offers a surrogate model that facilitates sample generation, Bayesian inference, hypothesis testing, and uncertainty quantification.

By Getachew K Befekadu
arXiv Machine Learning
Oct 16

On the Stability and Convergence of Flow Map Training

The paper investigates the training dynamics of flow map models, which convert diffusion trajectories into one‑step samplers for efficient probabilistic generation. It provides a theoretical analysis of the functional gradient flow induced by MeanFlow and Lagrangian losses, proving their convergence to the true flow map and identifying the risk of unbounded updates. The authors show that adaptive normalization and a specific reweighting scheme not only bound updates but also guarantee convergence to a neighborhood of the solution, and they confirm these findings with synthetic experiments and image‑generation benchmarks.

By Ishan Nath, Tom Stanic, Avishek Joey Bose, Gauthier Gidel, Quentin Bertrand
arXiv Machine Learning
Aug 19

Composing Flow-Matching Energies with Known Physics: Generation, OOD Detection, and Inversion on PDE Fields

The paper presents a method that combines flow‑matching models with energy‑based modeling to explicitly construct scalar energy functions for physical fields. These energies are derived from a matching regression objective on a linear Gaussian interpolation, avoiding variational approximations or extra MCMC steps, and can be used for energy‑corrected data generation, out‑of‑distribution detection, and posterior sampling in inverse problems. The approach enables general MCMC samplers that reduce PDE residuals and spectral distance, and it demonstrates that combining data‑driven and physics‑based energies improves OOD detection accuracy.

By Yixuan Sun, Anirban Samaddar, Sandeep Madireddy