Subscribe
Topic

Diffusion Models

Diffusion and flow-based generative models, from theory to open-source tools. Posts explain flow matching, classifier-free guidance, discrete diffusion for language and Diffusion Transformers, and compare text-to-image models like FLUX.1 and SD 3.5.

Articles

1-5
  1. Open-Source Text-to-Image Diffusion Models in Production: Comparing FLUX.1, Stable Diffusion 3.5, PixArt-Sigma, and Sana

    Production deployments of text-to-image generative systems have undergone a structural transition over the past two years. The classical convolutional U-Net architectures that powered Stable Diffusion 1.5 and Stable Diffusion XL have largely been superseded by transformer-based backbones. Modern open-weight models rely on Diffusion Transformers (DiT), Multimodal Diffusion Transformers (MMDiT), Linear DiTs, and Flow Matching formulations. Choosing an open-source text-to-image foundation model fo

    AI
    8 min read
  2. Diffusion Transformers (DiT): Mathematical Foundations, Patchification, Adaptive LayerNorm (adaLN-Zero), and Latent Diffusion Scaling

    Diffusion Transformers (DiT), introduced by William Peebles and Saining Xie in their 2023 paper Scalable Diffusion Models with Transformers, established a structural departure in generative visual modeling. For years, diffusion pipelines relied almost exclusively on convolutional U-Net backbones derived from Denoising Diffusion Probabilistic Models (DDPM) and Latent Diffusion Models (LDM). DiT replaced these multi-scale convolutional networks with standard isotropic Transformer architectures ope

    AI
    5 min read
  3. Discrete Diffusion in Large Language Models: How Continuous-Time Markov Chains, Absorbing States, and Score Entropy Challenge Autoregressive Generation

    The dominance of autoregressive architectures in large language models rests on a fundamental mathematical formulation: the chain rule of probability. By factoring the joint distribution of a sequence into a product of conditional probabilities, $p(x) = \prod_{i=1}^N p(x_i \mid x_{<i})$, autoregressive models reduce text generation to sequential next-token prediction. While this left-to-right causal factorization has scaled effectively across compute regimes, it imposes rigid operational constr

    AI
    8 min read
  4. Flow Matching for Generative Modeling: How Continuous Normalizing Flows and Optimal Transport Paths Replace Diffusion SDEs

    Generative modeling underwent a structural shift with the introduction of Flow Matching (FM), formulated independently by Lipman et al. (2022), Albergo and Vanden-Eijnden (2022), and Liu et al. (2022). While Denoising Diffusion Probabilistic Models (DDPM) and score-based Stochastic Differential Equations (SDEs) established state-of-the-art sample quality across vision and audio domains, their sampling dynamics rely on curved stochastic trajectories that require extensive numerical integration st

    AI
    8 min read
  5. Classifier-Free Guidance: How Score Extrapolation and Implicit Classification Steer Generative Models

    Conditional generative models face an inherent tension between mode coverage and prompt adherence. When a model is trained to maximize data log-likelihood, its learned distribution matches the broad, messy variety of the underlying dataset. In unconditional generation, this diversity is desirable. In conditional generation, however, unconditional priors dilute the prompt: models generate generic, average samples that only weakly align with nuanced text descriptions, spatial layouts, or class lab

    AI
    9 min read