Normalizing Flows for Probabilistic Modeling and Inference

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 2327 papers359 conceptsfrozen 2026-10-04

In machine learning, we often need to answer two fundamental questions about data: "How likely is this specific example?" (density estimation) and "Can you show me more examples like this?" (sampling). While Generative Adversarial Networks (GANs) are excellent at sampling and Variational Autoencoders (VAEs) provide a framework for latent representation, both struggle with providing exact, tractable probability densities.

Normalizing flows offer a solution by constructing a bridge between simple and complex worlds. As George Papamakarios and colleagues explain in their comprehensive review, these models use a sequence of invertible transformations to warp a simple "base" distribution (like a standard Gaussian) into a complex, multi-modal density that matches real-world data.

The Geometry of Warping Space

The core intuition behind a normalizing flow is the change of variables formula. Imagine a sheet of rubber representing a probability distribution. A standard Gaussian distribution is a simple, symmetric mound in the center of the sheet. To model complex data—like the distribution of human poses or the noise in a camera sensor—we must stretch, fold, and warp this sheet.

Scott Saobing Chen and Ramesh A. Gopinath pioneered this with Gaussianization, an iterative algorithm that alternates between linear rotations and non-linear warping. By ensuring every "stretch" is invertible and differentiable, we can track exactly how the volume of the space changes at every point. This change in volume is captured by the Jacobian determinant.

Because the transformation is bijective (one-to-one), we can calculate the exact probability of a data point in the complex space by simply mapping it back to the Gaussian space and adjusting for the "stretching" factor. This bypasses the "blurry" results often seen in VAEs and the training instabilities of GANs, as noted by Christina Winkler and her team in their work on Conditional Normalizing Flows.

Conditional Flows and Structured Prediction

The power of normalizing flows increases significantly when we condition the transformation on external information. In structured prediction tasks, we don't just want to model a distribution; we want to model a distribution given an input.

For example, in MotionFlow, Ali Etemad and colleagues use conditional normalizing flows to predict human motion. By conditioning the flow on past frames, the model learns a distribution of possible future movements. Similarly, You Lu and Bert Huang introduced c-Glow, which applies this to structured outputs, allowing for exact likelihood computation without the intractable "partition functions" required by traditional models like Conditional Random Fields.

This conditioning allows the model to handle multi-modality—situations where there is more than one "right" answer. In 3D human pose recovery, Nikos Kolotouros and his team developed ProHMR, which uses flows to represent the full distribution of plausible poses from a single 2D image, capturing the inherent ambiguity of the task.

Amortized Inference in the Physical Sciences

Beyond computer vision, normalizing flows have become a cornerstone of Simulation-Based Inference (SBI). In many scientific fields, we have simulators that can generate data from parameters, but we cannot easily write down the likelihood function needed for Bayesian inference.

Researchers like Antoine Wehenkel have applied this to cardiovascular modeling and power systems. By training a flow to map simulated data to the parameters that created them, we "amortize" the cost of inference. Once trained, the model can provide a full posterior distribution for new observations in milliseconds.

This has led to breakthroughs in:

Robustness and Uncertainty

A final critical advantage of normalizing flows is their ability to quantify uncertainty. Because they provide exact log-likelihoods, they are naturally suited for Out-of-Distribution (OOD) detection. Nert Keser and colleagues demonstrated this by using flows to monitor inputs in autonomous driving systems, identifying when a sensor encounters a scene it wasn't trained to handle.

By moving away from the rigid assumption that all noise or uncertainty must follow a simple Gaussian bell curve, normalizing flows allow neural networks to represent the world's true complexity. Whether it is the non-linear noise of an sRGB camera or the multi-modal "forks in the road" in regression tasks, flows provide the mathematical flexibility to model the "shape" of uncertainty accurately.

Papers in this version

Showing 60 of 327 papers.

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 581 papers
  2. Version 1 · 2026-10-04 · 327 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_normalizing_flows_65380992,
  title = {normalizing flows},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/normalizing-flows/rdr_6538099253f54c3e8801740cba002250},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 1, frozen text):

@misc{lacuna_normalizing_flows_for_probabilistic_mode_65380992_v1,
  title = {Normalizing Flows for Probabilistic Modeling and Inference},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/normalizing-flows-for-probabilistic-modeling-and-inference/rdr_6538099253f54c3e8801740cba002250/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}