A Variance-Preserving Process is a specific parameterization of the forward diffusion process in generative models where the total variance of the noisy sample is constrained to remain constant (typically 1) across all timesteps. This is achieved by carefully balancing the noise schedule parameters (beta) that control the amount of added Gaussian noise with a complementary scaling factor for the data. This constraint ensures the process smoothly transitions data to a unit-variance Gaussian prior without variance explosion or collapse.
Glossary
Variance-Preserving Process

What is a Variance-Preserving Process?
A core parameterization for the forward diffusion process in generative models.
This formulation is central to models like Denoising Diffusion Probabilistic Models (DDPMs). By preserving variance, the reverse process for sampling is simplified, as the model learns to predict the noise component from a consistently scaled input. It provides a stable, well-defined trajectory from complex data distributions to a simple, tractable noise distribution, facilitating effective training of the noise prediction network or score function estimator.
Key Characteristics of a Variance-Preserving Process
A Variance-Preserving (VP) process is a specific parameterization of the forward diffusion process where the total variance of the noisy sample is constrained to remain constant across timesteps. This design choice simplifies the mathematical formulation and is foundational to models like Denoising Diffusion Probabilistic Models (DDPMs).
Constant Total Variance
The defining property of a VP process is that the total variance of the noisy sample (\mathbf{x}_t) is constrained to remain constant (typically 1) for all timesteps (t). This is enforced by ensuring the sum of the signal variance (from the original data) and the noise variance equals 1. Formally, if (\mathbf{x}_0) is the original data and (\epsilon) is standard Gaussian noise, the forward process is defined as:
[\mathbf{x}_t = \sqrt{\bar{\alpha}_t} \mathbf{x}_0 + \sqrt{1 - \bar{\alpha}_t} \epsilon]
where the coefficients satisfy (\sqrt{\bar{\alpha}_t}^2 + (\sqrt{1 - \bar{\alpha}_t})^2 = 1). This ensures (\text{Var}(\mathbf{x}_t) = 1) if (\text{Var}(\mathbf{x}_0) = 1).
Parameterization via Alpha and Beta
The process is governed by a noise schedule defined by sequences (\beta_t) and (\bar{\alpha}_t).
- (\beta_t): The variance of the noise added at step (t).
- (\bar{\alpha}_t): The cumulative product of the signal retention factors, defined as (\bar{\alpha}t = \prod{s=1}^{t} (1 - \beta_s)).
The VP constraint directly links these: (\bar{\alpha}_t + (1 - \bar{\alpha}_t) = 1), which is inherently true. The critical design choice is that (\beta_t) is scheduled such that (\bar{\alpha}_T \approx 0) at the final timestep (T), transforming the data into nearly pure Gaussian noise while preserving total variance throughout.
Contrast with Variance-Exploding (VE)
The VP process is one of two main parameterizations for diffusion, the other being the Variance-Exploding (VE) process.
Key Differences:
- VP: Total variance is constant. Noise is added, but signal is proportionally decayed.
- VE: Signal is kept constant ((\mathbf{x}_t = \mathbf{x}_0 + \sigma_t \epsilon)), allowing total variance to explode to infinity as (t) increases.
Practical Implication: VP processes are more common in image generation (e.g., DDPM) because they operate with normalized data and bounded variance, which can be more numerically stable. VE processes are often used in continuous-time formulations via Stochastic Differential Equations (SDEs).
Simplified Training Objective
The constant variance property leads to a simplified and stable training loss. The model (often a U-Net) is typically trained as a noise prediction network. Given a noisy sample (\mathbf{x}t), the model (\epsilon\theta) is trained to predict the noise component (\epsilon) that was added.
The simplified mean-squared error loss is: [L_\text{simple} = \mathbb{E}_{t, \mathbf{x}0, \epsilon} \left[ | \epsilon - \epsilon\theta(\mathbf{x}_t, t) |^2 \right]] This objective is equivalent to learning the score function (gradient of the log data density) under the VP parameterization, but the noise prediction form is often more straightforward to optimize.
Sampling and the Reverse Process
To generate new data, the model reverses the VP process through iterative denoising. Starting from pure noise (\mathbf{x}_T \sim \mathcal{N}(0, I)), the reverse step is:
[\mathbf{x}_{t-1} = \frac{1}{\sqrt{1 - \beta_t}} \left( \mathbf{x}_t - \frac{\beta_t}{\sqrt{1 - \bar{\alpha}t}} \epsilon\theta(\mathbf{x}_t, t) \right) + \sigma_t \mathbf{z}] where (\mathbf{z} \sim \mathcal{N}(0, I)) and (\sigma_t) is the reverse process variance. For DDPM, this is set to (\tilde{\beta}t = \frac{1 - \bar{\alpha}{t-1}}{1 - \bar{\alpha}_t} \beta_t). This iterative procedure gradually removes predicted noise, reconstructing a data sample from the learned distribution.
Primary Use Case: Denoising Diffusion Probabilistic Models (DDPM)
The VP process is the standard forward process for the foundational DDPM architecture. Its characteristics directly enable DDPM's reliable training and high-quality generation.
Why DDPM uses VP:
- Normalized Data: Assumes input data is scaled to have unit variance (e.g., images in [-1, 1]).
- Stable Training: The bounded variance and simple noise-prediction loss prevent gradient issues.
- Progressive Transformation: Provides a clear, smooth path from data to a tractable noise distribution (standard Gaussian). This parameterization was instrumental in demonstrating the practical potential of diffusion models for high-fidelity image synthesis.
Variance-Preserving vs. Variance-Exploding Processes
A comparison of the two primary mathematical frameworks for defining the forward noise-adding process in diffusion-based generative models.
| Feature / Property | Variance-Preserving (VP) Process | Variance-Exploding (VE) Process |
|---|---|---|
Core Constraint | Total variance of the noisy sample is constrained (e.g., to 1). | Variance of the noise grows without bound over time. |
Forward Process SDE | dx = -0.5 β(t) x dt + sqrt(β(t)) dw | dx = sqrt(d[σ²(t)]/dt) dw |
Noise Schedule | Defines β(t), where 0 < β(t) < 1. | Defines σ(t), where σ(t) → ∞ as t → T. |
Data Scaling | Input data x₀ is typically scaled to have unit variance. | Input data x₀ can have its original variance. |
Terminal Distribution (as t→T) | Approaches a standard Gaussian: N(0, I). | Approaches N(0, ∞ * I) (pure, infinite-variance noise). |
Common Model Implementation | Denoising Diffusion Probabilistic Models (DDPM). | Score-Based Generative Modeling (SGM) / NCSN. |
Reverse Process Training | Trains a network to predict the added noise (ε). | Trains a score network to estimate ∇ log p_t(x). |
Sampling Stability | Generally more stable due to bounded variance. | Can be more sensitive to numerical precision and discretization. |
Frequently Asked Questions
A Variance-Preserving (VP) Process is a specific parameterization of the forward diffusion process in generative models where the total variance of the noisy sample is constrained to remain constant across timesteps.
A Variance-Preserving (VP) Process is a specific mathematical formulation for the forward diffusion process in a diffusion model where the total variance of the noisy data sample is constrained to remain constant (typically normalized to 1) across all timesteps. This is achieved by carefully balancing the amount of signal retained from the original data and the amount of noise added at each step. The process is defined by a noise schedule where the variance of the added Gaussian noise (beta_t) and the scaling factor for the data (alpha_t) satisfy the constraint alpha_t^2 + beta_t^2 = 1. This design ensures the noisy latent variables maintain a stable statistical scale, which simplifies the model's learning objective and the reverse sampling process.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Related Terms
A Variance-Preserving Process is one parameterization of the forward diffusion process. These related terms define the core mechanisms, alternative formulations, and evaluation metrics within the diffusion model framework.
Forward Process
The fixed Markov chain in a diffusion model that gradually adds Gaussian noise to a data sample over a series of timesteps, transforming it into pure noise. It is defined by a noise schedule. In a Variance-Preserving Process, this schedule is specifically designed so the total variance of the noisy sample remains constant (e.g., at 1) across all timesteps, unlike a Variance-Exploding process where variance increases.
Noise Schedule
A predefined function that controls the amount of variance (beta_t) of the Gaussian noise added at each timestep during the forward diffusion process. It determines the progression from data to noise.
- Key Parameter: The schedule of β_t values, typically increasing from near 0 to near 1.
- Variance-Preserving Connection: For VP processes, the schedule is constrained such that the product of all (1 - β_t) terms results in a final variance of 1. This is often implemented using a continuous function like β_t = 0.1 + (19.9 * t) for t in [0, 1] in some formulations.
Denoising Diffusion Probabilistic Model (DDPM)
A foundational class of generative model that learns to reverse a fixed forward process of gradually adding Gaussian noise to data. DDPMs popularized the noise prediction parameterization and the use of a simplified training objective. The original DDPM formulation uses a forward process that is a type of Variance-Preserving Process, where the variance of the noise is carefully scaled to ensure the final sample is approximately unit-variance Gaussian noise.
Score Matching
A training objective for generative models where a neural network (a score network) is trained to estimate the gradient (score) of the log probability density of the data distribution. In the context of diffusion models, the score function is proportional to the negative of the noise to be removed. Training a model via noise prediction (as in DDPM) is a practical, weighted form of score matching. The Variance-Preserving Process defines a specific continuous-time SDE whose score function the model learns to approximate.
Stochastic Differential Equation (SDE)
A continuous-time framework for modeling the forward and reverse processes in diffusion models, where data corruption and generation are described by differential equations with a stochastic (noise) component.
- Variance-Preserving SDE: Corresponds to the Variance Preserving (VP) SDE, often written as
dx = -0.5 β(t) x dt + sqrt(β(t)) dw, whereβ(t)is the noise schedule. This SDE ensures the marginal variance ofx(t)remains constant. - Alternative: The Variance Exploding (VE) SDE, where variance grows unbounded.
Probability Flow ODE
An ordinary differential equation (ODE) derived from the reverse-time stochastic differential equation (SDE) of a diffusion model. It describes a deterministic sampling trajectory that shares the same marginal probability distributions as the stochastic reverse process. For every diffusion process (including the Variance-Preserving SDE), there exists a corresponding Probability Flow ODE. This enables the use of fast, deterministic ODE solvers for sampling, trading off some potential diversity for faster and more consistent generation.

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us