Canonical Diffusion: Foundations & Applications

• Canonical Diffusion is a framework that defines a unique, reversible diffusion process using symmetry and stochastic evolution to maintain an intrinsic target density.
• It employs canonicalization to map equivariant data to a representative slice, effectively reducing estimation variance in complex generative tasks such as molecular dynamics and computer vision.
• Metric tools like the Sum of Squared Autocorrelations (SSA) and Dominant Autocorrelation directions (DA) provide practical measures for assessing mode separation and metastability in high-dimensional distributions.

Canonical diffusion is a unifying principle and toolset in probability, generative modeling, and stochastic processes. At its core, canonical diffusion leverages the action of symmetries, reversibility, and stochastic evolution to either (i) define an intrinsic diffusion process for a target density or (ii) canonicalize representations in equivariant modeling and structured data generation. Current research explores canonical diffusion both as a measurement device for geometric properties of distributions—such as mode separation—and as a methodological tool for breaking symmetries in generative models, molecular dynamics, and computer vision (Tolkovsky et al., 9 May 2026, Zhou et al., 16 Feb 2026, Behrens et al., 11 Dec 2025, Monthus, 2023).

1. Canonical Diffusion Processes: Definition and Properties

Given a target density $f:\mathbb{R}^d\to(0, \infty)$, the canonical diffusion associated with $f$ is the unique stationary, reversible Itô diffusion that maintains a constant (scalar) diffusion coefficient matching the average variance of $f$. Its stochastic differential equation is

$$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$

where $$\sigma_f^2 = \frac{1}{d} \operatorname{Tr} \operatorname{Cov}_f(X)$$ and $W_t$ is standard Brownian motion in $\mathbb{R}^d$ (Tolkovsky et al., 9 May 2026). The drift term is one-half the product of the diffusion matrix and the score function, $\nabla \log f(x)$. The Fokker–Planck equation of this process ensures that $f$ is the stationary density.

The existence and uniqueness theorem states that if $f$ is strictly positive, smooth, and has sufficiently light tails, then among all reversible diffusions with constant diffusion matrix $f$0, the drift is uniquely determined as $f$1 (Tolkovsky et al., 9 May 2026).

In the context of stochastic path conditioning, canonical conditioning connects two different Markov process generators—such as two Fokker–Planck operators—by exponentially tilting trajectory probabilities with a time-local functional, provided both share the same diffusion tensor. The canonical conditioning preserves the diffusion coefficient and alters only the drift component (Monthus, 2023).

2. Symmetry, Canonicalization, and Canonical Diffusion on Slices

For data invariant under a compact group $f$2 (e.g., permutations, Euclidean transformations), canonicalization refers to mapping each data point to a deterministic representative of its $f$3-orbit using a canonicalizer $f$4. This partitioning induces a canonical slice $f$5. Canonical diffusion on $f$6 consists of training an unconstrained (non-equivariant) diffusion (or flow) on such canonicalized data, subsequently restoring full $f$7-invariance at sampling by applying a random group transformation sampled from Haar measure (Zhou et al., 16 Feb 2026).

The formal quotient-space perspective underpins the correctness and universality of this procedure: for any $f$8-invariant probability $f$9 on $f$0, the pushforward measure on $f$1 encodes all necessary information, and one reconstructs $f$2 by randomizing over $f$3 after generation. This approach yields provable expressivity and allows the use of unrestricted generative backbones, sidestepping the power limitations of strictly equivariant architectures.

Variance reduction is a key effect: in the canonicalized slice, score fields and flow-matching objectives avoid complex mixture structures caused by symmetry-induced ambiguity. This produces lower estimation variance and improved sample efficiency.

3. Mode Separation Metrics via Canonical Diffusion

The “canonical diffusion” provides a strictly defined procedure to probe the geometric fragmentation (mode separation) of a density $f$4 through the lagged autocovariance of its stationary process. The autocovariance $f$5 is defined as

$f$6

The eigen-decomposition of $f$7 reveals the timescales of metastable transitions between well-separated modes, independent of overall dispersion or mixture decomposition (Tolkovsky et al., 9 May 2026).

Two core readouts are derived:

• Sum of Squared Autocorrelations (SSA): A barrier-sensitive scalar defined as $f$8, where $f$9. This measure captures how long autocorrelations persist, increasing as clusters become more metastable.
• Dominant Autocorrelation directions (DA): At a chosen lag, the eigenvectors $$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$0 of $$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$1 identify linear projections in state space ordered by their autocorrelation persistence, which align with slow (metastable) directions rather than directions of maximal variance as in PCA. As $$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$2, these DA directions converge to the eigenspaces corresponding to the smallest nonzero generator eigenvalues.

Practical estimation proceeds exclusively from samples and a score oracle, which are efficiently provided by score-based generative models via Tweedie’s identity (Tolkovsky et al., 9 May 2026).

4. Canonical Diffusion in Symmetry-Aware Generative Modeling

Canonical diffusion as a generative modeling paradigm is central to recent advances in symmetry-aware tasks, notably molecular graph generation. The methodology is:

1. Canonicalization: For each data sample, a deterministic map $$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$3 selects a representative from the $$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$4-orbit.
2. Training: An unrestricted diffusion or flow model is trained on these canonical samples; no equivariant constraints are imposed on the model backbone.
3. Restoration: At generation time, a random $$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$5 is sampled (via Haar measure) and applied to the generated output, restoring the desired $$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$6-invariance (Zhou et al., 16 Feb 2026).

The approach reduces both the score-field and flow-matching variance due to symmetry ambiguity. When combined with aligned priors (moment-matched Gaussians) and optionally optimal-transport couplings, this achieves strict variance minimization.

Empirical results for molecular generation under $$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$7 symmetries show that canonical diffusion architectures such as Canon and CanonFlow outperform equivariant and noncanonical models in both full-step and few-step regimes on datasets such as GEOM-DRUG (Zhou et al., 16 Feb 2026).

5. Canonicalization and Depth-Free Diffusion in Computer Vision

A related form of canonicalization is used in vision applications, particularly in view synthesis and stereo generation. In “StereoSpace,” all views are mapped into a single rectified canonical rig configuration before feeding into a standard latent diffusion model (Behrens et al., 11 Dec 2025). This enables the model to internalize geometric reasoning without explicit depth prediction at test time.

Viewpoint conditioning is performed on per-pixel Plücker-ray embeddings, without explicit geometric correspondence or warping during inference. The U-Net backbone leverages this canonicalization, producing competitive or superior geometric consistency and perceptual comfort compared to methods using explicit depth or warping. The canonical rig construction enables a unified handling of all baselines and focal lengths, as a single backbone operates in the rectified coordinate space.

Evaluation emphasizes metrics (e.g., iSQoE, MEt³R) designed to capture perceptual and geometric plausibility, rather than pure photometric fidelity (Behrens et al., 11 Dec 2025).

6. Theoretical Foundations and Conditioning in Stochastic Processes

Canonical conditioning in stochastic processes contexts involves constructing new Markov generators by exponential tilting of path measures with a time-local observable, provided the original and target processes share the same diffusion coefficient. The resulting generator is given by

$$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$8

where $$dX_t = \frac{1}{2}\sigma_f^2 \nabla\log f(X_t)\,dt + \sigma_f\,dW_t,$$9 is the tilted Fokker–Planck generator and $$\sigma_f^2 = \frac{1}{d} \operatorname{Tr} \operatorname{Cov}_f(X)$$0 is the leading right eigenfunction. This construction preserves the diffusion tensor and adds a drift “twist” via $$\sigma_f^2 = \frac{1}{d} \operatorname{Tr} \operatorname{Cov}_f(X)$$1, with $$\sigma_f^2 = \frac{1}{d} \operatorname{Tr} \operatorname{Cov}_f(X)$$2 the diffusion coefficient (Monthus, 2023). Applications include generating non-equilibrium steady states and interpreting nonequilibrium processes as canonical conditionings of reversible dynamics.

7. Practical Algorithms and Applications

Practical estimation of canonical diffusion readouts proceeds as follows (Tolkovsky et al., 9 May 2026):

• Estimate mean and variance from data samples.
• Simulate the canonical diffusion using samples and the score oracle.
• Compute empirical lagged autocovariances, symmetrize as needed.
• Calculate SSA as a sum over lag autocorrelation squares, and DA directions via eigendecomposition after thresholding against an analytically predicted null edge from free probability theory under the Gaussian null.
• Apply to settings such as synthetic GMMs (mode detection), SDXL generations (latent structural analysis), and molecular dynamics (extraction of slow collective variables).

The approach demonstrates that canonical diffusion detects fragmentation and metastability in distributions, with both theoretical and experimentally validated spectral criteria for assessing statistical significance and algorithmic lag selection.

---

References: (Tolkovsky et al., 9 May 2026, Zhou et al., 16 Feb 2026, Monthus, 2023, Behrens et al., 11 Dec 2025).