Equivariant Flow Matching for 3D Molecule Generation with Hybrid Probability Path Transport
Yuxuan Song*, Jingjing Gong*, Minkai Xu, Ziyao Cao, Yanyan Lan, Stefano Ermon, Hao Zhou, Wei-Ying Ma
AIR, Tsinghua University & Stanford University
April. 2024
1
Overview
2
Overview
3
Geometric Graph Generation
4
Catalysis Systems
Protein Design
Structure-based Drug Design
With pocket condition
With lattice matrix
RNA/DNA
Applications
General Formulation
Molecule Geometric graph could represent the information of topology, chemical property and conformation of the molecular.
As large graphs
Overview
5
Challenges and Limitations
6
Structure Constraint
Image data
The information in image data could be decomposed by adding multi-level noises which results to a coarse-to-fine modeling order
Curves of bond length and energy of H-H
Structure information is very sensitive to perturbation
Diffusion Models
Challenges and Limitations
7
Structure Constraint
Image data
The information in image data could be decomposed by adding multi-level noises which results to a coarse-to-fine modeling order
Curves of bond length and energy of H-H
Structure information is very sensitive to perturbation
Diffusion Models
EDM
GeoLDM
Challenges and Limitations
8
Multi-modality
Hydrogen
[1]
Discrete atom types
Discretised Charges
Geometric Symmetry
The learned density function should be roto-translational invariant.
Overview
9
Normalizing Flows
10
Continuous Normalizing Flow
We could model a continuous-in-time transformation:
11
Change of Variable
ODE solver
Flow Matching
12
Flow Matching for Generative Modeling
13
P0(x|x1) = P(x) (N(0,1))
P1(x|x1) = N(x1,0.0001)
P0(x|x1) = P(x)
Flow Matching for Generative Modeling
14
“Marginal Field Generate Marginal Path”
Flow Matching
15
Linear interpolations
Learned vector field
https://www.cs.utexas.edu/~lqiang/rectflow/html/intro.html
Overview
16
Intuition for EquiFM
17
Learn the vector field and then generate by solving the ODE.
Simple objective and
Stable generation
Overview
18
Equivariant Optimal Transport
19
Diffusion Models
OT Flow Matching
Could we minimize the transport distance during generation?
Equivariant Optimal Transport
20
[1]. Equivariant Flow Matching with Hybrid Probability Transport for 3D Molecule Generation. Song et al NeurIPS2023
[2]. Equivariant Flow Matching. Klein et al NeurIPS2023
Essentially an non isotropic Gaussian Prior/structure prior
Equivariant Optimal Transport
21
[1]. Equivariant Flow Matching with Hybrid Probability Transport for 3D Molecule Generation. Song et al NeurIPS2023
[2]. Equivariant Flow Matching. Klein et al NeurIPS2023
Overview
22
Hybrid Probability Path
23
[0.2,0.1,0.8,0.5,-0.1]
If we conduct linear interpolation, the MAX category would be only changed once on the interpolation path in approximate middle timestep. (~t=0.5)
Could we have better designed paths?
Hybrid Probability Path
24
Intuition: Make the information emergence of different modality, i.e. coordinate and atom type, in the same speed
Observation: Determine the Atom types when the structure is good.
Overview
25
Theoretical Property
26
Key steps:
The Jacobian matrix is being equivariant.
Overview
27
Empirical Results
28
Superior Performance on Several Benchmarks,
[1]. Equivariant Flow Matching with Hybrid Probability Transport for 3D Molecule Generation. Yuxuan Song et al NeurIPS2023
Diffusion Models
Flow Matching
Eot Flow Matching
Empirical Results
29
4.75 speed-up with Dopri5
Equivariant Flow Matching with Hybrid Probability Transport[2]
30
Exploring the best generation path for Geometry Graphs
Generation of EquiFM could enjoy the benefit of adaptive ODE solvers:SOTA results with 4.75 times speed up
[1]. Equivariant Flow Matching with Hybrid Probability Transport for 3D Molecule Generation. Song et al NeurIPS2023
Overview
31
Future Directions
32
Thanks
33
Some Related Works
�
34