P RO GAE: A G EOMETRIC A UTOENCODER - BASED G ENERATIVE M ODEL FOR D ISENTANGLING P ROTEIN C ONFORMATIONAL S PACE
Anonymous authors
Paper under double-blind review
A BSTRACT
Understanding the protein conformational landscape is critical, as protein function, as well as modulations thereof due to ligand binding or changes in environment, are intimately connected with structural variations.
This work focuses on learning a generative neural network on a simulated ensemble of protein structures obtained using molecular simulation to characterize the distinct structural ﬂuctuations of a protein bound to various drug molecules.
Speciﬁcally, we use a geometric autoencoder framework to learn separate latent space encodings of the intrinsic and extrinsic geometries of the system.
For this purpose, the proposed Protein Geometric AutoEncoder (ProGAE) model is trained on the length of the alpha-carbon pseudobonds and the orientation of the backbone bonds of the protein.
Using ProGAE latent embeddings, we reconstruct and generate the conformational ensemble of a protein at or near the experimental resolution.
Empowered by the disentangled latent space learning, the intrinsic latent embedding help in geometric error correction, whereas the extrinsic latent embedding is successfully used for classiﬁcation or property prediction of different drugs bound to a speciﬁc protein.
Additionally, ProGAE is able to be transferred to the structures of a different state of the same protein or to a completely different protein of different size, where only the dense layer decoding from the latent representation needs to be retrained.
Results show that our geometric learning-based method enjoys both accuracy and efﬁciency for generating complex structural variations, charting the path toward scalable and improved approaches for analyzing and enhancing molecular simulations.
I NTRODUCTION
The complex and time-consuming calculations in molecular simulations have been signiﬁcantly impacted by the application of machine learning techniques in recent years.
In particular, deep learning has been applied to analysis and simulation of molecular trajectories to address diverse problems, such as estimating free energy surfaces, deﬁning optimal reaction coordinates, constructing Markov
State Models, and enhancing molecular sampling.
For a comprehensive review of deep learning methods for analyzing and enhancing molecular simulations, see (No´e et al., 2020a) and (No´e et al., 2020b).
Speciﬁcally, there has been interest in modeling the underlying conformational space of proteins by using deep generative models, e.g. (Ramaswamy et al., 2020) and (Bhowmik et al., 2018;
Guo et al., 2020; Varolg¨unes¸ et al., 2020).
This line of work has mainly attempted to respect the domain geometry by using convolutional AEs on features extracted from 3D structures.
In parallel, learning directly from 3D structure has recently developed into an exciting and promising application area for deep learning.
In this work, we learn the protein conformational space from a set of protein simulations using geometric deep learning.
We also investigate how the geometry of a protein itself can assist learning and improve latent conformational space interpretability.
Namely, we consider the inﬂuence of intrinsic and extrinsic geometry, where intrinsic geometry is independent of 3D embedding and extrinsic is not.
Intrinsic geometric protein properties can be thought to be robust to conformation.
To this end, we propose a Protein Geometric Autoencoder model, named ProGAE, to separately encode intrinsic and extrinsic protein geometries.
The main contributions of this work are summarized:
• Inspired by recent unsupervised geometric disentanglement learning works (Tatro et al., 2020; Wu et al., 2019; Yang et al., 2020), we propose a novel geometric autoencoder named ProGAE that directly learns from 3D protein structures via separately encoding intrinsic and extrinsic geometries into disjoint latent spaces used to generate protein structures.
• We further propose a novel formulation, in which network intrinsic input is taken as the C
α -C α pseudo-bond distances, and the extrinsic input is the backbone bond orientations.
• Analysis shows that the learned extrinsic geometric latent space can be used for drug classiﬁcation and drug property prediction, where the drug is bound to the given protein.
• We ﬁnd that the intrinsic geometric latent space, even with small variation in the intrinsic input signal, is important for reducing geometric errors in reconstructed proteins.
• We also demonstrate that the learned ProGAE can be transferred to a trajectory of the protein in a different state or a trajectory of a different protein all-together.
1. R ELATED W ORK
Recently, a body of work has used deep learning to learn from protein structures (Graves et al., 2020;
Jing et al., 2020; Klicpera et al., 2020).
For example, Gainza et al.
(2019) uses geometric deep learning to predict docking sites for protein interactions.
Ingraham et al. (2019a) solves the inverse folding problem using a graph transformer on the protein backbone.
Degiacomi (2019) uses an AE to generate candidate proteins for docking.
Hermosilla et al.
(2020) leverages the notion of intrinsic and extrinsic geometry to deﬁne an architecture for a fold classiﬁcation task.
Additionally, there has been focus on directly learning the temporal aspects of molecular dynamics from simulation trajectories, which is not directly related to the current work.
Please see Appendix
A.1 for a detailed discussion.
There is an existing body of recent works that use AE-based approaches for either analyzing and/or generating structures from from the latent space (Bhowmik et al., 2018; Guo et al., 2020;
Ramaswamy et al., 2020; Varolg ¨ unes¸ et al., 2020), which are most closely related to this work.
(Bhowmik et al., 2018) and (Guo et al., 2020) aim at learning from and generating protein contact maps, while ProGAE directly deals with 3D structures.
Therefore a direct comparison of ProGAE with these methods is not possible.
Ramaswamy et al.
(2019) uses a 1D CNN autoencoder trained on backbone coordinates and uses a loss objective comprised of geometric MSE error and physicsbased (bond length, bond angle, etc.) error.
Due to the unavailability of code or pre-trained model, we were unable to perform a direct comparison.
Varolg¨unes¸ et al. (2020) uses a VAE with a Gaussian Mixture Prior for performing clustering of high-dimensional input conﬁgurations in the learned latent space.
While the method works well on toy models and a standard Alanine Dipeptide benchmark, its performance drops as the size of the protein system grows to 15 amino acids, which is approximately an order smaller than the protein systems studied here.
Also, their approach is likely not going to scale well to larger systems due to the use of fully-connected layers in the encoder.
These mentioned works have not considered explicit disentangling of intrinsic and extrinsic geometries.
To our knowledge, this work is the ﬁrst to propose an autoencoder for the unsupervised modeling of the geometric disentanglement of protein conformational space captured in molecular simulations.
This representation provides better interpretability of the latent space, in terms of the physico-chemical and geometric attributes, results in more geometrically accurate protein conformations, as well as scales and transfers well to larger protein systems.
P RO GAE FOR P ROTEIN C ONFORMATIONAL S PACE
First, we introduce the input signal for our novel geometric autoencoder, ProGAE.
We then discuss how ProGAE utilizes this signal to generate the conformational space of a protein.
Geometric Features of Protein as Network Input ProGAE functions by separately encoding intrinsic and extrinsic geometry with the goal of achieving better latent space interpretability.
We clarify these geometric notions.
Mathematically, we can consider a manifold (i.e. surface) independent of its embedding in Euclidean space.
Properties that do not depend on this embedding are known as intrinsic geometric properties, while properties that do are referred to as extrinsic.
As an example, given two atoms of a protein, the intrinsic distance between them is the minimum sum of bond lengths in the bond path connecting them, whereas the extrinsic distance is their Euclidean distance in R 3 .
For an in-depth review of geometry, we refer the reader to (Do Carmo, 2016).
As we will train ProGAE to learn the conformational space of a given protein, the protein primary structure is implicit.
Then in treating it as a geometric object, we view the protein at the level of its backbone, which speciﬁes its shape.
Given primary structure, reconstructing the protein backbone is sufﬁcient for reconstructing the entire protein.
Of importance in the backbone are the C α atoms, which are the centers of amino acids in the protein.
Then a coarse-level description of the backbone is the C α atoms connected linearly in terms of the protein sequence.
This is known as the trace of the protein.
We will use the backbone and trace as domains on which to deﬁne our signals.
Both the protein backbone and its trace can be viewed as polygonal chain in Euclidean space.
They are depicted in Figure 1 with their geometric features as network input.
We can see that a polygonal chain can be determined up to translation given both the length and orientation of its line segments.
Then it follows that the protein backbone can be determined given the length and orientation of its bonds.
Here the length of these bonds is intrinsic while the orientation is extrinsic.
Thus, to decouple the intrinsic and extrinsic geometry, we can consider encoding these signals.
The length of covalent bonds undergo very little change during a simulation performed using an empirical force-ﬁeld, like the simulations considered in this work.
A standard deviation of less than 0 .
059 ˚A from target bond lengths is common in PDB structures (Jaskolski et al., 2007).
To this end, we instead consider intrinsic geometry at a coarse level, so that the resulting signal has more variability.
Speciﬁcally, we use length of the C α -C α pseudobonds in the trace as a representative of the intrinsic protein geometry, where as backbone bond orientations capture extrinsic geometry.
We model the backbone by the graph, G b =
( V b , E b ) , and the backbone trace by the graph, G t =
( V t , E t ) .
Then our intrinsic and extrinsic signals, Int : E t → R and Ext : E
b → R 3 are deﬁned:
[Equation]
Network Architecture With the network inputs deﬁned, we discuss the architecture of ProGAE.
The core idea is to create an intrinsic latent space, L I ∈ R n i , and an extrinsic latent space, L E ∈ R n e , via separately encoding the intrinsic and extrinsic signals.
Consequently, our network contains two encoders, Enc i and Enc e where:
[Equation]
We then jointly decode these latent vectors to recover the coordinates of the atoms in the protein backbone.
Thus, we formally deﬁne the decoder:
[Equation]
This high level structure of ProGAE is depicted in Figure 1.
We provide additional details on the encoders and decoders.
As these edge-based signals are deﬁned on a geometric domain, it is sensible to learn feature representations using geometric convolution that respects the geometry of the data.
The intrinsic encoder is simple, as the signal is deﬁned on the backbone trace, which corresponds to a set of discrete curves.
Here each curve corresponds to a protein fragment.
Then we deﬁne Enc i to be a series of 1D convolutions operating on each protein fragment.
Each convolution is taken to have a kernel size of 3 and a stride of 2, being followed with batch normalization layers and ReLU.
In contrast, the extrinsic encoder operates on the backbone, which we associate with a graph.
So the layers of graph attention networks (GATs) introduced in (Veliˇckovi´c et al., 2017) are a natural tool to use, albeit with some modiﬁcation.
Since the input signal is deﬁned only on the edges of the graph, E b , we deﬁne a signal on the graph vertices, V b , as the average value of its incident edges,
[Equation]
Then the ﬁrst layer of the extrinsic encoder uses the edge-convolution operator of (Gong & Cheng, 2019) to map this graph signal to a signal deﬁned exclusively on the graph vertices, V b .
The rest of the encoder contains successive graph attention layers with sparsity deﬁned by a given neighborhood radius.
At each layer, the signal is downsampled by a factor of two based on farthest point sampling.
Given L layers, this deﬁnes a sequence of graphs, {G b,i } Li =0 , with increasing decimation.
As with
Enc i , each layer is followed with batch normalization and ReLU.
Summarily, for l = 1 , 2 , ..., L , f l = σ ◦ BN ◦ GAT ( d l − 1 ) where d l − 1 = DS ( f l − 1 ; 2) , f 1 ( v i ) :
= GAT ( f 0 ( V b ) , Ext ( E b )) .
Global average pooling is applied to the encoder outputs to introduce invariance to size of V t and V b .
Dense layers then map each result to their respective latent spaces, L I and L E .
The Tanh function is applied to bound the latent space.
This produces the intrinsic and extrinsic latent codes, z i and z e .
The latent code z is taken as the concatenation of the two latent codes, [ z i , z e ] .
A dense layer maps z to the a signal deﬁned on the most decimated backbone graph, G b,L .
The structure of the decoder,
Dec , is then analogous to Enc e , though the convolutions are transposed.
The output of Dec is the point cloud, ˆ P , corresponding to the predicted coordinates of the backbone atoms, V b ≈ P .
Loss Function
The ﬁrst term in the loss function is a basic reconstruction loss, where P and ˆ P are taken to be the true and predicted coordinates of the protein backbone atoms.
Namely, we evaluate their difference using Smooth- L 1 loss.
This loss is deﬁned, with δ = 2 , as
SmoothL 1 ( x , y ) :
= # x (cid:88) i =
z i , where z i = min (cid:18)
[Equation] [Equation]
(cid:19) , (6)
This loss function modiﬁes L 2 loss to be more robust to outliers (Girshick, 2015).
As the reconstruction loss depends on the embedding of the protein in Euclidean space, it may not best measure if intrinsic geometry is faithfully reconstructed.
To address this, we consider two encoded proteins with latent codes, [ z i, 1 , z e, 1 ] and
[ z i, 2 , z e, 2 ] .
Then we form a new latent variable,
[Equation]
Each of these latent variable decodes to some point cloud ˆ P .
We let Int ( ˆ E t,β ) , Int ( ˆ E t, 1 ) , and
Int ( ˆ E t, 2 ) be the lengths of the C
α -C α pseudobonds of the generated proteins from the interpolated latent code and the two given latent codes.
We then introduce a bond length penalty given by,
[Equation]
The blue and red structures correspond to the reconstructed and ground truth structures.
They are superimposed for
The corresponding backbones can be found in Figures 6a and 6b
[Table]
This penalty can be viewed as promoting faithful reconstruction of the pseudobond length between
C α atoms
[Table]
as well as a smooth interpolation of these lengths along paths in L I , that is independent of L E .
This penalty is analogous to the metric preservation regularizer introduced in (Cosmo et al., 2020) for 3D meshes.
Thus, the loss function L for ProGAE is,
[Equation]
E XPERIMENTAL S ETUP
In this section, we describe the setup of our numerical experiments that conﬁrm the usefulness of
ProGAE in generating the protein conformational space.
For each dataset, we train three models, each from a different random seed, and report both mean and standard deviation in our results.
Details on the choice of network hyperparameters can be found in the Appendix A.3.
Datasets Datasets used in this work are atomistic simulation trajectories 1 (D.E. Shaw Research, 2020).
The two main datasets we use are simulations of proteins in presence of FDA approved or under-investigation molecules, as we aim to test the performance of ProGAE on capturing druginduced structural variations.
These datasets are: (1) 50 independent trajectories, each simulating the SARS-CoV-2 trimeric spike protein (S protein) in the presence of a distinct drug for 2 µ s.
The simulation is limited to 3 receptor binding domains (RBDs) of the protein, as well as a short region needed for the system to maintain a trimer assembly; (2) 75 independent trajectories, each simulating the ectodomain protein of human ACE2 (hACE2) in the presence of a distinct drug for 2 µ s.
The backbones of the S protein and the hACE2 protein contain 3,690 atoms and 2,386 atoms, respectively.
The time resolution is 1,200 ps.
We use the ﬁrst 70% of frames from each trajectory to
[Table] [Table]
form the training set.
The next 10% and the last 20% of frames form the validation and test sets.
The train and sets are intentionally kept temporally disjoint to better assess generalization.
For transfer learning, we also consider two trajectories of the entire S protein containing 13, backbone atoms.
One trajectory is initiated from a closed state, while the other from a partially open state.
We use the ﬁrst 2.5 µs of these 10 µs simulations, corresponding to 2,001 frames with a resolution of 1,200 ps.
Additionally, we utilize the ﬁrst 10 µs of a 100 µs simulation of the main
Protease of SARS-CoV-2, a sequence of 10,001 frames with a 1,000 ps resolution.
R ESULTS
Structure Reconstruction Figure 2 displays the ability of ProGAE to accurately reconstruct protein conformations.
The backbones are visible with atom-wise error in Figures 6a and 6b in the appendix.
From the visualized atom-wise L 2 reconstruction error, it is clear that our network can capture and reconstruct notable conformational changes of a protein.
Figures 8a and 8b in the appendix display these reconstructions with color denoting fragment instead of L 2 error for clarity.
Consistent with the low RMSD error, visually the reconstructed structures appear consistent with ground truths, with larger RMSDs observed in the ﬂexible loop and turn regions.
Table 1 contains performance metrics of ProGAE on training and test sets.
Generalization is measured by the L 2 reconstruction error of the backbone atom coordinates, as well as RMSD (root mean square distance) after alignment.
For hACE2, we achieve sub-Angstrom performance on the test set.
In either case, the RMSD of the reconstruction is within the experimental resolution of the associated PDB ﬁles; 6VXX/6VW1 for the S protein and 6VW1 for hACE2.
Additionally, the average error in the length of the pseudobonds is also sub-Angstrom.
Thus, it is evident that ProGAE is able to reconstruct proteins within meaningful resolution.
Utility of the Extrinsic Latent Space With the reconstruction capabilities of ProGAE veriﬁed, we consider the beneﬁt of having separate intrinsic and extrinsic latent spaces.
First, we explore the statistical relationship between the learned intrinsic latent space and the extrinsic latent space.
Canonical correlation analysis (CCA) is a natural approach to assess if a linear relationship exists (Hardoon et al., 2004).
We include background on CCA in Appendix A.2.
Table 2 includes the leading correlation between the intrinsic and extrinsic latent spaces for each dataset.
Note this correlation is very low, implying that there is a negligible linear relationship be-
[Figure]
[Table]
tween the intrinsic and extrinsic latent spaces.
Learning a disentangled latent representation is often desired for better interpretability, which is typically measured using a generalization of mutual information such as total correlation as in (Chen et al., 2018).
While structural conditions may prevent the intrinsic and extrinsic embeddings from being completely independent, Table 2 indicates absence of a linear relationship between intrinsic and extrinsic latent vectors in our learned model, conﬁrming a notable level of disentanglement that has been explicitly encoded in our model architecture.
As stated earlier, each simulation trajectory in the dataset corresponds to the S or hACE2 protein bound to a speciﬁc drug.
Then it is natural to investigate if this distinct drug information is encoded in the two disentangled latent spaces.
Table 2 contains the performance of a linear classiﬁer trained on the different latent spaces to classify the drug present in each frame.
It is clear that the drug molecule can be almost perfectly classiﬁed in the extrinsic latent space, while such classiﬁcation is random in the intrinsic latent space.
Figures 3a and 3b display the embeddings of the test set in the latent spaces, projected to the ﬁrst two canonical components.
In these ﬁgures, color denotes the identity of the drug that the protein is bound to.
Even in the 2D projection of the extrinsic latent space, clustering by the drug identity is apparent, which is not the case for the intrinsic embedding.
Next, we consider if this linear separation is chemically meaningful.
We train a linear regression model on the extrinsic latent space to predict physico-chemical properties of a drug binding to a protein.
Table 3 displays the performance of the model at predicting the properties of molecular weight, hydrogen bond donor count, and topological polar surface area.
For comparison to our latent embedding, we train a linear regression model on the ﬁrst n e principal component scores of the PCA of the extrinsic signal on each element of the test dataset.
The latent regression outperforms that of
PCA, indicating that the the extrinsic latent embedding captures more physico-chemical information about the bound drug.
We believe this linear regression is appropriate as it prevents overﬁtting.
Utility of the Intrinsic Latent Space Having conﬁrmed the utility of a separate extrinsic latent space, we weigh the beneﬁts of including the intrinsic latent space in the model.
This is nontrivial, as the mean pseudo-bond length is 3 . 86 ˚A with a deviation of 0 . 06 .
We ﬁnd the inclusion of the intrinsic latent space improves the geometric validity of the reconstructed protein as seen in the
[Figure] [Figure]
Examples of the structures along the interpolation path can be found in the appendix in Figure 7.
following ablation study.
We trained a model that only encodes the extrinsic signal to reconstruct the protein.
While it was comparable in performance regarding L 2 error, we found this extrinsiconly model resulted in a higher percentage of erroneous bonds.
This is shown in Table 4.
Here we deﬁne a erroneous bond, if the bond length deviates by more than 10% from the minimum of the ground truth distribution, as such deviations will result in steric clashes.
We also trained a model on only the intrinsic signal, but did not analyze the model further due to poor performance ( > 3 . 0 ˚A).
These results are found within the appendix in Table 6.
Geometry of the Generated Structural Ensemble As a generative model, it is important to consider if paths in the latent space meet our expectations.
One way by which we measure this is how the pairwise distance matrix between non-bonded atoms in a generated protein changes as the latent variables change.
Speciﬁcally,we are interested in the distance between non-bonded atoms.
In Figures 4a and 4b, we plot the norm of the difference between these distance matrices for the generated protein and that of the protein at its initiation.
We sample the latent space along two principal components, while setting others to 0.
So in these ﬁgures 4a and 4b, we see three different cross sections of this space.
It is immediately apparent that a change in the extrinsic latent code dominates changes in the non-bonded distance.
This is a desired behavior of a disentangled geometric
[Table]
autoencoder, where large-scale changes are captured in the extrinsic latent space, while small-scale changes in local distance are controlled by the intrinsic latent space.
We also evaluate the performance of linear interpolations in the learned latent space.
Given two protein conformations from different trajectories (i.e. in the context of two different drugs), we generate a path between them by generating the linear interpolation of their latent codes.
This provides a path of structural variation that does not exist in the training data.
The results of this interpolation in terms of RMSD is shown in Figure 5.
As expected, we see a smooth exchange in the RMSD error of the generated protein from the ﬁrst protein and from the second protein.
Transfer Learning– Extension to Different Proteins To check the generalization of ProGAE, we investigate transfer learning to simulations of different proteins.
We begin with models trained on the S protein comprised of the 3 RBDs and on hACE2.
These results are summarized in Table 5.
We transfer learned ProGAE models to trajectories of the closed and partially open state of the entire
S protein, as well as SARS-COV-2 main Protease, which provides insight into the generalization capability of the convolutional ﬁlters that we have learned.
As a result, six scenarios of the transfer learning, in addition to three random baselines, are reported in Table 5.
When transferring the model trained on the 3 RBDs of the S protein to the S protein in the closed state, we are transferring the model learned on a partial structure to the entire protein that is much larger in size .
Model transfer to the S protein in the partially open state deals with a scenario where the conformational state of the protein is notably different (closed vs partially open) .
Transferring the model trained on hACE to the S protein datasets studies the knowledge transfer to an entirely different protein, but one which hACE2 is known to interact with .
Finally, transferring both S protein and hACE2 models to the main
Protease simulation allows us to study the transfer of the models to a completely different protein without notable interaction with the source protein.
Given performing long time-scale simulations of large protein systems at high resolution is a computationally expensive process, our method appears beneﬁcial, as ProGAE transfers well to non-related proteins of larger size.
The only incompatible layer is the dense layer mapping from the latent spaces.
To investigate transfer learning, we train just this dense layer for 10 epochs.
As a baseline, we train the same layer of a randomly initialized model.
In all cases, the transferred model performs better than the baseline.
Thus the learned ﬁlters generalize to trajectories of completely different protein systems.
C ONCLUSION
In this work we introduce a novel geometric autoencoder named ProGAE for learning meaningful disentangled representations of the protein conformational space.
Our model accurately reconstructs protein structure.
The autoencoder separately encodes intrinsic and extrinsic geometries to ensure better latent space interpretability.
The extrinsic latent space can classify the protein structures with respect to the bound drug molecules, as well as can predict the drug properties.
The intrinsic latent space assists in improving the validity of the bond geometry in the reconstructions.
We also show that the geometric convolutional ﬁlters learned in training can be successfully transferred to trajectories of different protein systems, irrespective of system size, conformational state, or presence of protein-protein interaction.
These results on learning, predicting, and generating protein conformations suggest that the proposed framework can serve as the ﬁrst step towards bridging geometric deep learning with molecular simulations.