1 of 18

Introduction to Diffusion-based Generative Models

​

Biomolecular Diffusion Reading Group

Meeting 1: 09/13/2023

2 of 18

Meeting Outline

  • Introduction to the Biomolecular Diffusion Reading Group (BDRG)!
    • Logistics, schedule, and future topics

​

  • Overview of diffusion-based generative models (DGMs)
    • What is diffusion and how does it work?
    • Some details: forward diffusion, variance schedule, reverse diffusion, example training and sampling algorithms, extensions
    • Summary: key points, takeaways, and recommended readings

​

2

3 of 18

BDRG Logistics

  • Meet every 2 weeks
    • Next meeting planned for Wed, Sept 27th at 11 am EDT (UTC-4)
    • Topic (?): Practical considerations and more math
      • Karras et al. (2022) Elucidating the Design Space of Diffusion-Based Generative Models. [paper] [code]

​

  • Future meetings will look at specific papers, dive into the methods, and discuss the results
    • If possible, include author(s) from paper in discussion

​

  • Polls to vote on and select papers for discussion!

​

3

4 of 18

Potential protein-related papers to discuss

4

5 of 18

Why diffusion-based generative models?

5

an astronaut riding a horse in photorealistic style.

DALL-E 2 (2022)

a propaganda poster depicting a cat dressed as french emperor napoleon holding a piece of cheese

Stable Diffusion (2022)

vibrant California poppies

Midjourney (2022)

6 of 18

Why diffusion-based generative models?

6

Stable Diffusion (2022)

https://yang-song.net/blog/2021/score/

7 of 18

DGMs for proteins

7

RFDiffusion1 (2022)

Genie2 (2023)

1Watson et al. (2022); 2Lin & AlQuraishi (2023)

8 of 18

What is diffusion? How does it work?

8

Forward Diffusion

Reverse Diffusion*

 

 

 

 

 

random prior

Sohl-Dickstein et al. (2015); Yang & Ermon (2019); Ho et al. (2020); Song et al. (2021)

Main Idea:

Data is iteratively corrupted with noise and a model learns to denoise or reverse this process

 

 

9 of 18

Forward diffusion iteratively corrupts the data distribution towards a simple prior distribution

9

 

 

 

 

 

Sohl-Dickstein et al. (2015)

Forward Diffusion

 

 

random prior

 

 

 

 

 

 

 

 

Forward diffusion injects Gaussian noise

 

 

 

 

 

 

 

 

 

 

 

 

10 of 18

Forward diffusion iteratively corrupts the data distribution towards a simple prior distribution

10

 

 

 

 

 

Sohl-Dickstein et al. (2015)

Forward Diffusion

 

 

random prior

 

 

 

 

 

 

 

 

 

Forward diffusion injects Gaussian noise

 

 

 

 

11 of 18

 

11

12 of 18

The Diffusion Process

12

Forward Diffusion

Reverse Diffusion*

 

Sohl-Dickstein et al. (2015); Yang & Ermon (2019); Ho et al. (2020); Song et al. (2021)

 

 

 

 

random prior

 

 

13 of 18

Reverse diffusion denoises corrupted data to generate new samples from the data distribution

13

 

 

 

 

Reverse Diffusion*

 

 

 

 

 

 

 

 

 

 

Forward Diffusion:

 

 

 

 

 

 

Reverse Diffusion:

 

(1)

 

 

 

(2)

 

 

14 of 18

Reverse diffusion denoises corrupted data to generate new samples from the data distribution

14

Training Objective (ELBO):

 

Reconstruction Term

Prior Term

Denoising Step Term

Forward Diffusion:

 

 

 

 

 

 

Reverse Diffusion:

 

(1)

 

 

 

(2)

 

 

Ho et al. (2020)

 

MSE Loss on Predicted Noise

 

 

15 of 18

Example training and sampling algorithms for DGMs

15

Ho et al. (2020)

 

Compute predicted noise

Take a step to remove the noise

Get example from dataset

Get time

Get noise

 

Compute loss and backprop

(inference)

 

 

 

 

16 of 18

Extensions to DGMs

  • Conditional generation
    • Diffusion models can be guided towards producing samples of specific classes using either “classifier guided diffusion” or “classifier-free guidance”.

​

  • Stochastic differential equations
    • Rather a set of discrete noise distributions, a diffusion process formulated as a SDE with Brownian motion can evolve a continuum of noise distributions.

​

  • Denoising diffusion implicit models (DDIMs)
    • Sampling diffusion models can be slow, especially when there are thousands of time steps. Instead, with DDIMs sampling uses only a subset of the time steps

​

  • Riemannian manifolds
    • Many real-world data distributions do not live on Euclidean spaces (i.e., “flat geometry”). Diffusion processes on the Riemannian manifolds can better capture distributions of high-order data

16

Nichol & Dhariwal 2021; Dhariwal & Nichol 2021; Ho & Salimans 2021; Nichol, Dhariwal, & Ramesh 2022; Song et al. 2021; De Bortoli et al. 2022

17 of 18

Summary and Takeaways for DGMs

  •  

17

18 of 18

Recommended Readings

Papers:

​

Blogs:

​

18