Year: 2020

Abstract:
Molecular graph generation is a fundamental problem for drug discovery and has been attracting growing attention. The problem is challenging since it requires not only generating chemically valid molecular structures but also optimizing their chemical properties in the meantime. Inspired by the recent progress in deep generative models, in this paper we propose a flow-based autoregressive model for graph generation called GraphAF. GraphAF combines the advantages of both autoregressive and flow-based approaches and enjoys: (1) high model flexibility for data density estimation; (2) efficient parallel computation for training; (3) an iterative sampling process, which allows leveraging chemical domain knowledge for valency checking. Experimental results show that GraphAF is able to generate 68% chemically valid molecules even without chemical knowledge rules and 100% valid molecules with chemical rules. The training process of GraphAF is two times faster than the existing state-of-the-art approach GCPN. After fine-tuning the model for goal-directed property optimization with reinforcement learning, GraphAF achieves state-of-the-art performance on both chemical property optimization and constrained property optimization.1

heading: 1 INTRODUCTION
text: Designing novel molecular structures with desired properties is a fundamental problem in a variety of applications such as drug discovery and material science. The problem is very challenging, since the chemical space is discrete by nature, and the entire search space is huge, which is believed to be as large as 1033 (Polishchuk et al., 2013). Machine learning techniques have seen a big opportunity in molecular design thanks to the large amount of data in these domains. Recently, there are increasing efforts in developing machine learning algorithms that can automatically generate chemically valid molecular structures and meanwhile optimize their properties.
Specifically, significant progress has been achieved by representing molecular structures as graphs and generating graph structures with deep generative models, e.g., Variational Autoencoders (VAEs) (Kingma & Welling, 2013), Generative Adversarial Networks (GANs) (Goodfellow et al., 2014) and Autoregressive Models (Van Oord et al., 2016). For example, Jin et al. (2018) proposed a Junction Tree VAE (JT-VAE) for molecular structure encoding and decoding. De Cao & Kipf (2018) studied how to use GANs for molecular graph generation. You et al. (2018a) proposed an approach called Graph Convolutional Policy Network (GCPN), which formulated molecular graph generation as a sequential decision process and dynamically generates the nodes and edges based on the
∗Equal contribution, with order determined by flipping a coin. Work was done during internship at Mila. 1Code is available at https://github.com/DeepGraphLearning/GraphAF
existing graph substructures. They used reinforcement learning to optimize the properties of generated graph structures. Recently, another very related work called MolecularRNN (MRNN) (Popova et al., 2019) proposed to use an autoregressive model for molecular graph generation. The autoregressive based approaches including both GCPN and MRNN have demonstrated very competitive performance in a variety of tasks on molecular graph generation.
Recently, besides the aforementioned three types of generative models, normalizing flows have made significant progress and have been successfully applied to a variety of tasks including density estimation (Dinh et al., 2016; Papamakarios et al., 2017), variational inference (Kingma et al., 2016; Louizos & Welling, 2017; Rezende & Mohamed, 2015), and image generation (Kingma & Dhariwal, 2018). Flow-based approaches define invertible transformations between a latent base distribution (e.g. Gaussian distribution) and real-world high-dimensional data (e.g. images and speech). Such an invertible mapping allows the calculation of the exact data likelihood. Meanwhile, by using multiple layers of non-linear transformation between the hidden space and observation space, flows have a high capacity to model the data density. Moreover, different architectures can be designed to promote fast training (Papamakarios et al., 2017) or fast sampling (Kingma et al., 2016) depending on the requirement of different applications.
Inspired by existing work on autoregressive models and recent progress of deep generative models with normalizing flows, we propose a flow-based autoregressive model called GraphAF for molecular graph generation. GraphAF effectively combines the advantages of autoregressive and flow-based approaches. It has a high model capacity and hence is capable of modeling the density of real-world molecule data. The sampling process of GraphAF is designed as an autoregressive model, which dynamically generates the nodes and edges based on existing sub-graph structures. Similar to existing models such as GCPN and MRNN, such a sequential generation process allows leveraging chemical domain knowledge and valency checking in each generation step, which guarantees the validity of generated molecular structures. Meanwhile, different from GCPN and MRNN as an autoregressive model during training, GraphAF defines a feedforward neural network from molecular graph structures to the base distribution and is therefore able to compute the exact data likelihood in parallel. As a result, the training process of GraphAF is very efficient.
We conduct extensive experiments on the standard ZINC (Irwin et al., 2012) dataset. Results show that the training of GraphAF is significantly efficient, which is two times faster than the state-of-theart model GCPN. The generated molecules are 100% valid by incorporating the chemical rules during generation. We are also surprised to find that even without using the chemical rules for valency checking during generation, the percentage of valid molecules generated by GraphAF can be still as high as 68%, which is significantly higher than existing state-of-the-art GCPN. This shows that GraphAF indeed has the high model capability to learn the data distribution of molecule structures. We further fine-tune the generation process with reinforcement learning to optimize the chemical properties of generated molecules. Results show that GraphAF significantly outperforms previous state-of-the-art GCPN on both property optimization and constrained property optimization tasks.

heading: 2 RELATED WORK
text: A variety of deep generative models have been proposed for molecular graph generation recently (Segler et al., 2017; Olivecrona et al., 2017; Samanta et al., 2018; Neil et al., 2018). The RVAE model (Ma et al., 2018) used a variational autoencoder for molecule generation, and proposed a novel regularization framework to ensure semantic validity. Jin et al. (2018) proposed to
represent a molecule as a junction tree of chemical scaffolds and proposed the JT-VAE model for molecule generation. For the VAE-based approaches, the optimization of chemical properties is usually done by searching in the latent space with Bayesian Optimization (Jin et al., 2018). De Cao & Kipf (2018) used Generative Adversarial Networks for molecule generation. The state-of-the-art models are built on autoregressive based approaches (You et al., 2018a; Popova et al., 2019). (You et al., 2018a) formulated the problem as a sequential decision process by dynamically adding new nodes and edges based on current sub-graph structures, and the generation policy network is trained by a reinforcement learning framework. Recently, Popova et al. (2019) proposed an autoregressive model called MolecularRNN to generate new nodes and edges based on the generated nodes and edge sequences. The iterative nature of autoregressive model allows effectively leveraging chemical rules for valency checking during generation and hence the proportion of valid molecules generated by these models is very high. However, due to the sequential generation nature, the training process is usually slow. Our GraphAF approach enjoys the advantage of iterative generation process like autoregressive models (the mapping from latent space to observation space) and meanwhile calculates the exact likelihood corresponding to a feedforward neural network (the mapping from observation space to latent space), which can be implemented efficiently through parallel computation.
Two recent work—Graph Normalizing Flows (GNF) (Liu et al., 2019) and GraphNVP (Madhawa et al., 2019)—are also flow-based approaches for graph generation. However, our work is fundamentally different from their work. GNF defines a normalizing flow from a base distribution to the hidden node representations of a pretrained Graph Autoencoders. The generation scheme is done through two separate stages by first generating the node embeddings with the normalizing flow and then generate the graphs based on the generated node embeddings in the first stage. By contrast, in GraphAF, we define an autoregressive flow from a base distribution directly to the molecular graph structures, which can be trained end-to-end. GraphNVP also defines a normalizing flow from a base distribution to the molecular graph structures. However, the generation process of GraphNVP is one-shot, which cannot effectively capture graph structures and also cannot guarantee the validity of generated molecules. In our GraphAF, we formulate the generation process as a sequential decision process and effectively capture the sub-graph structures via graph neural networks, based on which we define a policy function to generate the nodes and edges. The sequential generation process also allows incorporating the chemical rules. As a result, the validity of the generated molecules can be guaranteed. We summarize existing approaches in Table 1.

heading: 3 PRELIMINARIES

heading: 3.1 AUTOREGRESSIVE FLOW
text: A normalizing flow (Kobyzev et al., 2019) defines a parameterized invertible deterministic transformation from a base distribution E (the latent space, e.g., Gaussian distribution) to real-world observational space Z (e.g. images and speech). Let f : E → Z be an invertible transformation where ∼ pE( ) is the base distribution, then we can compute the density function of real-world data z, i.e., pZ(z), via the change-of-variables formula:
pZ(z) = pE ( f−1θ (z) ) ∣∣∣∣det ∂f−1θ (z)∂z ∣∣∣∣ . (1)
Now considering two key processes of normalizing flows as a generative model: (1) Calculating Data Likelihood: given a datapoint z, the exact density pZ(z) can be calculated by inverting the transformation f , = f−1θ (z); (2) Sampling: z can be sampled from the distribution pZ(z) by first sample ∼ pE( ) and then perform the feedforward transformation z = fθ( ). To efficiently perform the above mentioned operations, fθ is required to be invertible with an easily computable Jacobian determinant. Autoregressive flows (AF), originally proposed in Papamakarios et al. (2017), is a variant that satisfies these criteria, which holds a triangular Jacobian matrix, and the determinant can be computed linearly. Formally, given z ∈ RD (D is the dimension of observation data), the autoregressive conditional probabilities can be parameterized as Gaussian distributions:
p(zd|z1:d−1) = N (zd|µd, (αd)2), where µd = gµ(z1:d−1; θ), αd = gα(z1:d−1; θ), (2) where gµ and gα are unconstrained and positive scalar functions of z1:d−1 respectively to compute the mean and deviation. In practice, these functions can be implemented as neural networks. The
affine transformation of AF can be written as:
fθ( d) = zd = µd + αd · d; f−1θ (zd) = d = zd − µd αd . (3)
The Jacobian matrix in AF is triangular, since ∂zi∂ j is non-zero only for j ≤ i. Therefore, the determinant can be efficiently computed through ∏D d=1 αd. Specifically, to perform density estimation, we can apply all individual scalar affine transformations in parallel to compute the base density, each of which depends on previous variables z1:d−1; to sample z, we can first sample ∈ RD and compute z1 through the affine transformation, and then each subsequent zd can be computed sequentially based on previously observed z1:d−1.

heading: 3.2 GRAPH REPRESENTATION LEARNING
text: Following existing work, we also represent a molecule as a graph G = (A,X), where A is the adjacency tensor and X is the node feature matrix. Assuming there are n nodes in the graph, d and b are the number of different types of nodes and edges respectively, then A ∈ {0, 1}n×n×b and X ∈ {0, 1}n×d. Aijk = 1 if there exists a bond with type k between ith and jth nodes. Graph Convolutional Networks (GCN) (Duvenaud et al., 2015; Gilmer et al., 2017; Kearnes et al., 2016; Kipf & Welling, 2016; Schütt et al., 2017) are a family of neural network architectures for learning representations of graphs. In this paper, we use a variant of Relational GCN (RGCN) (Schlichtkrull et al., 2018) to learn the node representations (i.e., atoms) of graphs with categorical edge types. Let k denote the embedding dimension. We compute the node embeddings H l ∈ Rn×k at the lth layer of R-GCN by aggregating messages from different edge types:
H l = Agg ( ReLU ( {D̃− 1 2
i ẼiD̃ − 12 i H l−1W li } ∣∣i ∈ (1, . . . , b))) , (4)
where Ei = A[:,:,i] denotes the ith slice of edge-conditioned adjacency tensor, Ẽi = Ei + I , and D̃i = ∑ k Ẽi[j, k]. W (l) i is a trainable weight matrix for the i
th edge type. Agg(·) denotes an aggregation function such as mean pooling or summation. The initial hidden node representation H0 is set as the original node feature matrix X . After L message passing layers, we use the the final hidden representation HL as the node representations. Meanwhile, the whole graph representations can be defined by aggregating the whole node representations using a readout function (Hamilton et al., 2017), e.g., summation.

heading: 4 PROPOSED METHOD

heading: 4.1 GRAPHAF FRAMEWORK
text: Similar to existing works like GCPN (You et al., 2018a) and MolecularRNN (Popova et al., 2019), we formalize the problem of molecular graph generation as a sequential decision process. Let G = (A,X) denote a molecular graph structure. Starting from an empty graph G1, in each step a new node Xi is generated based on the current sub-graph structure Gi, i.e., p(Xi|Gi). Afterwards, the edges between this new node and existing nodes are sequentially generated according to the current graph structure, i.e., p(Aij |Gi, Xi, Ai,1:j−1). This process is repeated until all the nodes and edges are generated. An illustrative example is given in Fig. 1(a).
GraphAF is aimed at defining an invertible transformation from a base distribution (e.g. multivariate Gaussian) to a molecular graph structure G = (A,X). Note that we add one additional type of edge between two nodes, which corresponds to no edge between two nodes, i.e., A ∈ {0, 1}n×n×(b+1). Since both the node type Xi and the edge type Aij are discrete, which do not fit into a flow-based model, a standard approach is to use Dequantization technique (Dinh et al., 2016; Kingma & Dhariwal, 2018) to convert discrete data into continuous data by adding real-valued noise. We follow this approach to preprocess a discrete graph G = (A,X) into continuous data z = (zA, zX):
zXi = Xi + u, u ∼ U [0, 1)d; zAij = Aij + u, u ∼ U [0, 1)b+1. (5)
We present further discussions on dequantization techniques in Appendix A. Formally, we define the conditional distributions for the generation as:
p(zXi |Gi) =N (µXi , (αXi )2), (6) where µXi = gµX (Gi), α X i = gαX (Gi),
p(zAij |Gi, Xi, Ai,1:j−1) = N (µAij , (αAij)2), j ∈ {1, 2, . . . , i− 1}, (7) where µAij = gµA(Gi, Xi, Ai,1:j−1), α A ij = gαA(Gi, Xi, Ai,1:j−1),
where gµX , gµA and gαX , gαA are parameterized neural networks for defining the mean and standard deviation of a Gaussian distribution. More specifically, given the current sub-graph structure Gi, we use a L-layer of Relational GCN (defined in Section 3.2) to learn the node embeddingsHLi ∈ Rn×k, and the embedding of entire sub-graph h̃i ∈ Rk, based on which we define the mean and standard deviations of Gaussian distributions to generate the nodes and edges respectively:
R-GCN: HLi = R-GCN(Gi), h̃i = sum(H L i );
Node-MLPs: gµX = mµX (h̃i), gαX = mαX (h̃i);
Edge-MLPs: gµA = mµA(h̃i, H L i,i, H L i,j), gαA = mαA(h̃i, H L i,i, H L i,j),
(8)
where sum denotes the sum-pooling operation, and HLi,j ∈ Rk denotes the embedding of the j-th node in the embeddings HLi . mµX , mαX are Multi-Layer Perceptrons (MLP) that predict the node types according to the current sub-graph embedding. andmµA ,mαA are MLPs that predict the types of edges according to the current sub-graph embedding and node embeddings.
To generate a new node Xi and its edges connected to existing nodes, we just sample random variables i and ij from the base Gaussian distribution and convert it to discrete features. More specifically,
zXi = i αXi + µXi , i ∈ Rd; zAij = ij αAij + µAij , j ∈ {1, 2, . . . , i− 1}, ij ∈ Rb+1,
(9)
where is the element-wise multiplication. In practice, a real molecular graph is generated by taking the argmax of generated continuous vectors, i.e., Xi = vdargmax(zXi ) and Aij = vb+1argmax(zAij) , where vpq denotes a p dimensional one-hot vector with q th dimension equal to 1.
Let = { 1, 2, 21, 3, 31, 32, . . . , n, n1, . . . , n,n−1}, where n is the number of atoms in the given molecule, GraphAF defines an invertible mapping between the base Gaussian distribution
and the molecule structures z = (zA, zX). According to Eq. 9, the inverse process from z = (zA, zX) to can be easily calculated as:
i = ( zXi − µXi ) 1 αXi ; ij = ( zAij − µAij ) 1 αAij , j ∈ {1, 2, . . . , i− 1}, (10)
where 1 αXi and 1 αAij denote element-wise reciprocals of αXi and α A ij respectively.

heading: 4.2 EFFICIENT PARALLEL TRAINING
text: In GraphAF, since f : E → Z is autoregressive, the Jacobian matrix of the inverse process f−1 : Z → E is a triangular matrix, and its determinant can be calculated very efficiently. Given a minibatch of training data G, the exact density of each molecule under a given order can be efficiently computed by the change-of-variables formula in Eq. 1. Our objective is to maximize the likelihood of training data.
During training, we are able to perform parallel computation by defining a feedforward neural network between the input molecule graph G and the output latent variable by using masking. The mask drops out some connections from inputs to ensure that R-GCN is only connected to the sub-graph Gi when inferring the hidden variable of node i, i.e., i, and connected to sub-graph Gi, Xi, Ai,1:j−1 when inferring the hidden variable of edge Aij , i.e., ij . This is similar to the approaches used in MADE (Germain et al., 2015) and MAF (Papamakarios et al., 2017). With the masking technique, GraphAF satisfies the autoregressive property, and at the same time p(G) can be efficiently calculated in just one forward pass by computing all the conditionals in parallel.
To further accelerate the training process, the nodes and edges of a training graph are re-ordered according to the breadth-first search (BFS) order, which is widely adopted by existing approaches for graph generation (You et al., 2018b; Popova et al., 2019). Due to the nature of BFS, bonds can only be present between nodes within the same or consecutive BFS depths. Therefore, the maximum dependency distance between nodes is bounded by the largest number of nodes in a single BFS depth. In our data sets, any single BFS depth contains no more than 12 nodes, which means we only need to model the edges between current atom and the latest generated 12 atoms.
Due to space limitation, we summarize the detailed training algorithm into Appendix B.

heading: 4.3 VALIDITY CONSTRAINED SAMPLING
text: In chemistry, there exist many chemical rules, which can help to generate valid molecules. Thanks to the sequential generation process, GraphAF can leverage these rules in each generation step. Specifically, we can explicitly apply a valency constraint during sampling to check whether current bonds have exceeded the allowed valency, which has been widely adopted in previous models (You et al., 2018a; Popova et al., 2019). Let |Aij | denote the order of the chemical bond Aij . In each edge generation step of Aij , we check the following valency constraint for the ith and jth atoms:∑
j |Aij | ≤ Valency(Xi) and ∑ i |Aij | ≤ Valency(Xj). (11)
If the newly added bond breaks the valency constraint, we just reject the bond Aij , sample a new ij in the latent space and generate another new bond type. The generation process will terminate if one of the following conditions is satisfied: 1) the graph size reaches the max-size n, 2) no bond is generated between the newly generated atom and previous sub-graph. Finally, hydrogens are added to the atoms that have not filled up their valencies.

heading: 4.4 GOAL-DIRECTED MOLECULE GENERATION WITH REINFORCEMENT LEARNING
text: So far, we have introduced how to use GraphAF to model the data density of molecular graph structures and generate valid molecules. Nonetheless, for drug discovery, we also need to optimize the chemical properties of generated molecules. In this part, we introduce how to fine-tune our generation process with reinforcement learning to optimize the properties of generated molecules.
State and Policy Network. The state is the current sub-graph, and the initial state is an empty graph. The policy network is the same as the autoregressive model defined in Section 4.1, which
includes the process of generating a new atom based on the current sub-graph and generating the edges between the new atom and existing atoms, i.e., p (Xi|Gi) and p (Aij |Gi, Xi, Ai,1:j−1). The policy network itself defines a distribution pθ of molecular graphs G. If there are no edges between the newly generated atom and current sub-graph, the generation process terminates. For the state transition dynamics, we also incorporate the valency check constraint.
Reward design. Similar to GCPN You et al. (2018a), we also incorporate both intermediate and final rewards for training the policy network. A small penalization will be introduced as the intermediate reward if the edge predictions violate the valency check. The final rewards include both the score of targeted-properties of generated molecules such as octanol-water partition coefficient (logP) or drug-likeness (QED) (Bickerton et al., 2012) and the chemical validity reward such as penalties for molecules with excessive steric strain and or functional groups that violate ZINC functional group filters (Irwin et al., 2012). The final reward is distributed to all intermediate steps with a discounting factor to stabilize the training.
In practice, we adopt Proximal Policy Optimization (PPO) (Schulman et al., 2017), an advanced policy gradient algorithm to train GraphAF in the above defined environment. Let Gij be the shorthand notation of sub-graph Gi ∪Xi ∪Ai,1:j−1. Formally,
L(θ) =− EG∼pθ { Ei [ min ( ri(θ)V (Gi, Xi), clip (ri(θ), 1− , 1 + )V (Gi, Xi) ) + Ej [ min ( rij(θ)V (Gij , Aij), clip (rij(θ), 1− , 1 + )V (Gij , Aij) )]]} ,
(12)
where ri(θ) = pθ(Xi|Gi) pθold (Xi|Gi) and rij(θ) = pθ(Aij |Gij) pθold (Aij |Gij)
are ratios of probabilities output by old and new policies, and V (state, action) is the estimated advantage function with a moving average baseline to reduce the variance. More specifically, we treat generating a node and all its edges with existing nodes as one step and maintain a moving average baseline for each step. The clipped surrogate objective prevents the policy from being updated to collapse for some extreme rewards.

heading: 5 EXPERIMENTS

heading: 5.1 EXPERIMENT SETUP
text: Evaluation Tasks. Following existing works on molecule generation (Jin et al., 2018; You et al., 2018a; Popova et al., 2019), we conduct experiments by comparing with the state-of-the-art approaches on three standard tasks. Density Modeling and Generation evaluates the model’s capacity to learn the data distribution and generate realistic and diverse molecules. Property Optimization concentrates on generating novel molecules with optimized chemical properties. For this task, we fine-tune our network pretrained from the density modeling task to maximize the desired properties. Constrained Property Optimization is first proposed in Jin et al. (2018), which is aimed at modifying the given molecule to improve desired properties while satisfying a similarity constraint.
Data. We use the ZINC250k molecular dataset (Irwin et al., 2012) for training. The dataset contains 250, 000 drug-like molecules with a maximum atom number of 38. It has 9 atom types and 3 edge types. We use the open-source chemical software RDkit (Landrum, 2016) to preprocess molecules. All molecules are presented in kekulized form with hydrogen removed.
Baselines. We compare GraphAF with the following state-of-the-art approaches for molecule generation. JT-VAE (Jin et al., 2018) is a VAE-based model which generates molecules by first decoding a tree structure of scaffolds and then assembling them into molecules. JT-VAE has been shown to outperform other previous VAE-based models (Kusner et al., 2017; Gómez-Bombarelli et al., 2018; Simonovsky & Komodakis, 2018). GCPN is a state-of-the-art approach which combines reinforcement learning and graph representation learning methods to explore the vast chemical space. MolecularRNN (MRNN), another autoregressive model, uses RNN to generate molecules in a sequential manner. We also compare our model with GraphNVP (Madhawa et al., 2019), a recently proposed flow-based model. Results of baselines are taken from original papers unless stated.
Implementation Details. GraphAF is implemented in PyTorch (Paszke et al., 2017). The R-GCN is implemented with 3 layers, and the embedding dimension is set as 128. The max graph size is set as 48 empirically. For density modeling, we train our model for 10 epochs with a batch size of 32 and a
learning rate of 0.001. For property optimization, we perform a grid search on the hyperparameters and select the best setting according to the chemical scoring performance. We use Adam (Kingma & Ba, 2014) to optimize our model. Full training details can be found in Appendix C.

heading: 5.2 NUMERICAL RESULTS
text: Density Modeling and Generation. We evaluate the ability of the proposed method to model real molecules by utilizing the widely-used metrics: Validity is the percentage of valid molecules among all the generated graphs. Uniqueness is the percentage of unique molecules among all the generated molecules. Novelty is the percentage of generated molecules not appearing in training set. Reconstruction is the percentage of the molecules that can be reconstructed from latent vectors. We calculate the above metrics from 10,000 randomly generated molecules.
Table 2 shows that GraphAF achieves competitive results on all four metrics. As a flow-based model, GraphAF holds perfect reconstruction ability compared with VAE approaches. Our model also achieves a 100% validity rate since we can leverage the valency check during sequential generation. By contrast, the validity rate of another flow-based approach GraphNVP is only 42.60% due to its one-shot sampling process. An interesting result is that even without the valency check during generation, GraphAF can still achieve a validity rate as high as 68%, while previous state-of-the-art approach GCPN only achieves 20%. This indicates the strong flexibility of GraphAF to model the data density and capture the domain knowledge from unsupervised training on the large chemical dataset. We also compare the efficiency of different methods on the same computation environment, a machine with 1 Tesla V100 GPU and 32 CPU cores. To achieve the results in Table 2, JT-VAE and GCPN take around 24 and 8 hours, respectively, while GraphAF only takes 4 hours.
To show that GraphAF is not overfitted to the specific dataset ZINC250k, we also conduct experiments on two other molecule datasets, QM9 (Ramakrishnan et al., 2014) and MOSES (Polykovskiy et al., 2018). QM9 contains 134k molecules with 9 heavy atoms, and MOSES is much larger and more challenging, which contains 1.9M molecules with up to 30 heavy atoms. Table 3 shows that GraphAF can always generate valid and novel molecules even on the more complicated dataset.
Furthermore, though GraphAF is originally designed for molecular graph generation, it is actually very general and can be used to model different types of graphs by simply modifying the node and edge generating functions Edge-MLPs and Node-MLPs (Eq. 8). Following the experimental setup of Graph Normalizing Flows (GNF) (Liu et al., 2019), we test GraphAF on two generic graph datasets: COMMUNITY-SMALL, which is a synthetic data set containing 100 2-community graphs, and EGO-SMALL, which is a set of graphs extracted from Citeseer dataset (Sen et al., 2008). In practice, we use one-hot indicator vectors as node features for R-GCN. We borrow open source scripts from GraphRNN (You et al., 2018b) to generate datasets and evaluate different models. For evaluation, we report the Maximum Mean Discrepancy (MMD) (Gretton et al., 2012) between generated
and training graphs using some specific metrics on graphs proposed by You et al. (2018b). The results in Table 4 demonstrate that when applied to generic graphs, GraphAF can still consistently yield comparable or better results compared with GraphRNN and GNF. We give the visualization of generated generic graphs in Appendix D.
Property Optimization. In this task, we aim at generating molecules with desired properties. Specifically, we choose penalized logP and QED as our target property. The former score is logP score penalized by ring size and synthetic accessibility, while the latter one measures the druglikeness of the molecules. Note that both scores are calculated using empirical prediction models and we adopt the script used in (You et al., 2018a) to make results comparable. To perform this task, we pretrain the GraphAF network for 300 epochs for likelihood modeling, and then apply the RL process described in section 4.4 to fine-tune the network towards desired chemical properties. Detailed reward design and hyper-parameters setting can be found in Appendix C. Following existing works, we report the top-3 scores found by each model.
1The scores reported here are recalculated based on top 3 molecules presented in the original paper (Popova et al., 2019) using GCPN’s script.
As shown in Table 5, GraphAF outperforms all baselines by a large margin for penalized logP score and achieves comparable results for QED. This phenomenon indicates that combined with RL process, GraphAF successfully captures the distribution of desired molecules. Note that we re-evaluate the properties of the top-3 molecules found by MolecularRNN, which turn out to be lower than the results reported in the original paper. Figure 2(a) and 2(b) show the molecules with the highest score discovered by our model. More realistic molecules generated by GraphAF with penalized logP score ranging from 5 to 10 are presented in Figure 6 in Appendix E.
One should note that, as defined in Sec 4.4, our RL process is close to the one used in previous work GCPN (You et al., 2018a). Therefore, the good property optimization performance is believed to come from the flexibility of flow. Compared with the GAN model used in GCPN, which is known to suffer from the mode collapse problem, flow is flexible at modeling complex distribution and generating diverse data (as shown in Table 2 and Table 3). This allows GraphAF to explore a variety of molecule structures in the RL process for molecule properties optimization.
Constrained Property Optimization. The goal of the last task is to modify the given molecule to improve specified property with the constraint that the similarity between the original and modified molecule is above a threshold δ. Following Jin et al. (2018) and You et al. (2018a), we choose to optimize penalized logP for 800 molecules in ZINC250k with the lowest scores and adopt Tanimoto similarity with Morgan fingerprint (Rogers & Hahn, 2010) as the similarity metric.
Similar to the property optimization task, we pretrain GraphAF via density modeling and then finetune the model with RL. During generation, we set the initial states as sub-graphs randomly sampled from 800 molecules to be optimized. For evaluation, we report the mean and standard deviation of the highest improvement and the corresponding similarity between the original and modified molecules in Table 6. Experiment results show that GraphAF significantly outperforms all previous approaches and almost always succeeds in improving the target property. Figure 2(c) visualizes two optimization examples, showing that our model is able to improve the penalized logP score by a large margin while maintaining a high similarity between the original and modified molecule.

heading: 6 CONCLUSION
text: We proposed GraphAF, the first flow-based autoregressive model for generating realistic and diverse molecular graphs. GraphAF is capable to model the complex molecular distribution thanks to the flexibility of normalizing flow, as well as generate novel and 100% valid molecules in empirical experiments. Moreover, the training of GraphAF is very efficient. To optimize the properties of generated molecules, we fine-tuned the generative process with reinforcement learning. Experimental results show that GraphAF outperforms all previous state-of-the-art baselines on the standard tasks. In the future, we plan to train our GraphAF model on larger datasets and also extend it to generate other types of graph structures (e.g., social networks).

heading: ACKNOWLEDGEMENT
text: We would like to thank Min Lin, Meng Qu, Andreea Deac, Laurent Dinh, Louis-Pascal A. C. Xhonneux and Vikas Verma for the extremely helpful discussions and comments. This project is supported by the Natural Sciences and Engineering Research Council of Canada, the Canada CIFAR AI Chair Program, and a collaboration grant between Microsoft Research and Mila. Ming Zhang is supported by National Key Research and Development Program of China with Grant No. 2018AAA0101900/2018AAA0101902 as well as Beijing Municipal Commission of Science and Technology under Grant No. Z181100008918005. Weinan Zhang is supported by National Natural Science Foundation of China (61702327, 61772333, 61632017, 81771937) and Shanghai Sailing Program (17YF1428200).

heading: A DISCCUSIONS ON DEQUANTIZATION TECHNIQUES
text: The dequantization techniques allow mapping the discrete data into the continuous one by adding a small noise to each dimension. By adding noise from U [0, 1), we can ensure that the range of different categories will not overlap. For example, after dequantization, the value of 1-entry in the one-hot vector lies in [1, 2) while the 0-entry lies in [0, 1). Therefore, we can map the dequantized continuous data back to the discrete one-hot data by easily performing the argmax operation in the generation process. Theoretically, as shown in Theis et al. (2016); Ho et al. (2019), training a continuous density model on uniform dequantized data can be interpreted as maximizing a lower bound on the log-likelihood for the original discrete data. Mathematically, this statement holds for both image data and binary/categorical data.
Furthermore, as suggested in Ho et al. (2019), instead of adding random uniform noise to each discrete data for dequantization, a more advanced dequantization technique is to treat the noise as a hidden variable and use variational inference to infer the optimum noise added to each discrete data, which we would like to explore in our future work.

heading: B PARALLEL TRAINING ALGORITHM
text: Algorithm 1 Parallel Training Algorithm of GraphAF Input: η learning rate, M batch size, P maximum dependency distance in BFS, Adam hyperparameters β1, β2, use Prod(·) as the product of elements across dimensions of a tensor Initial: Parameters θ of GraphAF (R-GCN, Node-MLP and Edge-MLP)
1: while θ is not converged do 2: for m = 1, ...,M do 3: Sample a molecule mol from dataset and get the graph size N 4: Convert mol to G = (A,X) with BFS re-ordering 5: for i = 1, ..., N do 6: zXi = Xi + u, u ∼ U [0, 1)d 7: µXi = gµX ( Gi ) , αXi = gαX ( Gi )
8: i = ( zXi − µXi ) 1
αXi
9: LXi = − log(Prod(pE( i)))− log(Prod( 1αXi )) 10: for j = max{1, i− P}, ..., i− 1 do 11: zAij = Aij + u, u ∼ U [0, 1)b+1
12: µAij = gµA ( Gi, Xi, Ai,1:j−1 ) , αAij = gαA ( Gi, Xi, Ai,1:j−1 ) 13: ij = ( zAij − µAij ) 1
αAij
14: LAij = − log(Prod(pE( ij)))− log(Prod( 1αAij )) 15: end for 16: end for 17: LGm = ∑n i=1 ( LXi + ∑P j=1 LAij
) 18: end for 19: θ ← ADAM( 1M ∑m m=1 LGm, θ, η, β1, β2) 20: end while

heading: C EXPERIMENT DETAILS
text: Network architecture. The network architecture is fixed among all three tasks. More specifically, the R-GCN is implemented with 3 layers and the embedding dimension is set as 128. We use batch normalization before graph pooling to accelerate the convergence and choose sum-pooling as
the readout function for graph representations. Both node MLPs and edge MLPs have two fullyconnected layers equipped with tanh non-linearity.
Density Modeling and Generation. To achieve the results in Table 2, we train GraphAF on ZINC250K with a batch size of 32 on 1 Tesla V100 GPU and 32 CPU cores for 10 epochs. We optimize our model with Adam with a fixed learning rate of 0.001.
Property Optimization. For both property optimization and constrained property optimization, we first pretrain a GraphAF network via the density modeling task for 300 epochs, and then finetune the network toward desired molecular distribution through RL process. Following are details about the reward design for property optimization. The reward of each step consists of step-wise validity rewards and the final rewards discounted by a fixed factor γ. The step-wise validity penalty is fixed as -1. The final reward of a moleculem includes both property-targeted reward and chemical validation reward. We adopt the same chemical validation rewards as GCPN. We define propertytargeted reward as follows:
r(m) = t1 ·QED(m)
r(m) = exp
( logPpen(mol)
t2
) (13)
γ is set to 0.97 for QED optimization and 0.9 for penalized logP optimization respectively. We fine-tune the pretrained model for 200 iterations with a fixed batch size of 64 using Adam optimizer. We also adopt a linear learning rate warm-up to stabilize the training. We perform the grid search to determine the optimal hyperparameters according to the chemical scoring performance. The search space is summarised in Table 7.
Constrained Property Optimization. We first introduce the way we sample sub-graphs from 800 ZINC molecules. Given a molecule, we first randomly sample a BFS order and then drop the last m nodes in BFS order as well as edges induced by these nodes, where m is randomly chosen from {0, 1, 2, 3, 4, 5} each time. Finally, we reconstruct the sub-graph from the remaining nodes in the BFS sequence. Note that the final sub-graph is connected due to the nature of BFS order. For reward design, we set it as the improvement of the target score. We fine-tune the pretrained model for 200 iterations with a batch size of 64. We also use Adam with a learning rate of 0.0001 to optimize the model. Finally, each molecule is optimized for 200 times by the tuned model.
D VISUALIZATION OF GENERATED GENERIC GRAPHS
We present visualizations of graphs from both the training set and generated graphs by GraphAF in Figure 3 and Figure 4. The visualizations demonstrate that GraphAF has strong ability to model different graph structures in the generic graph datasets.

heading: E MORE MOLECULE SAMPLES
text: We present more molecule samples generated by GraphAF in the following pages. Figure 5 presents 50 molecules randomly sampled from multivariate Gaussian, which justify the ability of our model to generate novel, realistic and unique molecules. From Figure 6 we can see that our model is able to generate molecules with high and diverse penalized logP scores ranging from 5 to 10. For constrained property optimization of penalized logP score, as shown by Figure 7, our model can either reduce the ring size, remove the big ring or grow carbon chains from the original molecule, improving the penalized logP score by a large margin.

Review summaries:
This paper proposes a generative model architecture for molecular graph generation based on autoregressive flows. The main contribution of this paper is to combine existing techniques (auto-regressive BFS-ordered generation of graphs, normalizing flows, dequantization by Gaussian noise, fine-tuning based on reinforcement learning for molecular property optimization, and validity constrained sampling). Most of these techniques are well-established either for data generation with normalizing flows or for molecular graph generation and the novelty lies in the combination of these building blocks into a framework. Training can be carried out in parallel over the sequential generation process, as no hidden states with sequential dependency are assumed (unlike a regular RNN). Experimental validation is carried out on a standard ZINC molecule generation benchmark (graphs with up to 48 nodes) and the reported metrics are competitive with recent related work.