D IRECTED A CYCLIC G RAPH N EURAL N ETWORKS
Anonymous authors
Paper under double-blind review
A BSTRACT
Graph-structured data ubiquitously appears in science and engineering.
Graph neural networks (GNNs) are designed to exploit the relational inductive bias exhibited in graphs; they have been shown to outperform other forms of neural networks in scenarios where structure information supplements node features.
The most common GNN architecture aggregates information from neighborhoods based on message passing.
Its generality has made it broadly applicable.
In this paper, we focus on a special, yet widely used, type of graphs—DAGs—and inject a stronger inductive bias—partial ordering—into the neural network design.
We propose the directed acyclic graph neural network , DAGNN, an architecture that processes information according to the ﬂow deﬁned by the partial order.
DAGNN can be considered a framework that entails earlier works as special cases (e.g., models for trees and models updating node representations recurrently), but we identify several crucial components that prior architectures lack.
We perform comprehensive experiments, including ablation studies, on representative DAG datasets (i.e., source code, neural architectures, and probabilistic graphical models) and demonstrate the superiority of DAGNN over simpler DAG architectures as well as general graph architectures.
I NTRODUCTION
Graph-structured data is ubiquitous across various disciplines (Gilmer et al., 2017; Zitnik et al., 2018; Sanchez-Gonzalez et al., 2020).
Graph neural networks (GNNs) use both the graph structure and node features to produce a vectorial representation, which can be used for classiﬁcation, regression (Hu et al., 2020), and graph decoding (Li et al., 2018; Zhang et al., 2019).
Most popular
GNNs update node representations through iterative message passing between neighboring nodes, followed by pooling (either ﬂat or hierarchical (Lee et al., 2019; Ranjan et al., 2020)), to produce a graph representation (Li et al., 2016; Kipf & Welling, 2017; Gilmer et al., 2017;
Veli ˇ ckovi ´ c et al., 2018; Xu et al., 2019).
The relational inductive bias (Santoro et al., 2017; Battaglia et al., 2018;
Xu et al.
, 2020)—neighborhood aggregation—empowers GNNs to outperform graph-agnostic neural networks.
To facilitate subsequent discussions, we formalize a message-passing neural network (MPNN) architecture, which computes representations h (cid:96)v for all nodes v in a graph G in every layer (cid:96) and a ﬁnal graph representation h G , as (Gilmer et al., 2017):
[Equation]
where h 0 v is the input feature of v , N ( v ) denotes a neighborhood of node v (sometimes including v itself), V denotes the node set of G , L is the number of layers, and AGGREGATE (cid:96) , COMBINE (cid:96) , and READOUT are parameterized neural networks.
For notational simplicity, we omit edge attributes; but they can be straightforwardly incorporated into the framework (1)–(2).
Directed acyclic graphs (DAGs) are a special type of graphs, yet broadly seen across domains.
Examples include parsing results of source code (Allamanis et al., 2018), logical formulas (Crouse et al., 2019), and natural language sentences, as well as probabilistic graphical models (Zhang et al., 2019), neural architectures (Zhang et al., 2019), and automated planning problems (Ma et al., 2020).
A directed graph is a DAG if and only if the edges deﬁne a partial ordering over the nodes.
The partial order is an additionally strong inductive bias one naturally desires to incorporate into the neural network.
For example, a neural architecture seen as a DAG deﬁnes the acyclic dependency of computation, an important piece of information when comparing architectures and predicting their performance.
Hence, this information should be incorporated into the architecture representation for higher predictive power.
In this work, we propose DAGNNs—directed acyclic graph neural networks—that produce a representation for a DAG driven by the partial order.
In particular, the order allows for updating node representations based on those of all their predecessors sequentially, such that nodes without successors digest the information of the entire graph.
Such a processing manner substantially differs from that of MPNNs where the information landed on a node is limited by a multi-hop local neighborhood and thus restricted by the depth L of the network.
Modulo details to be elaborated in sections that follow, the DAGNN framework reads
[Equation]
where P ( v ) denotes the set of direct predecessors of v , T denotes the set of nodes without (direct) successors, and G (cid:96) , F (cid:96) , and R are parameterized neural networks that play similar roles to
AGGREGATE (cid:96) , COMBINE (cid:96) , and READOUT, respectively.
A notable difference between (3)–(4) and (1)–(2) is that the superscript (cid:96) − 1 inside the underlined part of (1) is advanced to (cid:96) in the counterpart in (3).
In other words, MPNN aggregates neighborhood information from the past layer, whereas DAGNN uses the information in the current layer.
An advantage is that DAGNN always uses more recent information to update node representations.
Equations (3)–(4) outline several other subtle but important differences between DAGNN and
MPNNs, such as the use of only direct predecessors for aggregation and the pooling on only nodes without successors.
All these differences are unique to the special structure a DAG enjoys.
Exploiting this structure properly should yield a more favorable vectorial representation of the graph.
In Section 2, we will elaborate the speciﬁcs of (3)–(4).
The technical details include (i) attention for node aggregation, (i) multiple layers for expressivity, and (iii) topological batching for efﬁcient implementation, all of which yield an instantiation of the DAGNN framework that is state of the art.
For theoretical contributions, we study topological batching and justify that this technique yields maximal parallel concurrency in processing DAGs.
Furthermore, we show that the mapping deﬁned by DAGNN is invariant to node permutation and injective under mild assumptions.
This result reassures that the graph representation extracted by DAGNN is discriminative.
Because DAGs appear in many different ﬁelds, neural architectures for DAGs or special cases (e.g., trees) are scattered around the literature over the years.
Generally, they are less explored compared to MPNNs; and some are rather application-speciﬁc.
In Section 3, we unify several representative architectures as special cases of the framework (3)–(4).
We compare the proposed architecture to them and point out the differences that lead to its superior performance.
In Section 4, we detail our comprehensive, empirical evaluation on datasets from three domains: (i) source code parsed to DAGs (Hu et al., 2020); (ii) neural architecture search (Zhang et al., 2019), where each architecture is a DAG; and (iii) score-based Bayesian network learning (Zhang et al., 2019).
We show that DAGNN outperforms many representative DAG architectures and MPNNs.
Overall, this work contributes a specialized graph neural network, a theoretical study of its properties, a topological batching technique for enhancing parallel concurrency, a framework interpretation that encompasses prior DAG architectures, and comprehensive evaluations.
Supported code is available at https://github.com/anonyma2020/DAGNN .
T HE DAGNN M ODEL 2. P RELIMINARIES
A DAG is a directed graph without cycles.
Denote by G =
( V , E ) a DAG, where V and E ⊂ V × V are the node set and the edge set, respectively.
A (strong) partial order over a set S is a binary relation ≤ that is transitive and asymmetric.
Some authors use reﬂexivity versus irreﬂexivity to distinguish weak partial order over strong partial order .
To unify concepts, we forbid self-loops (which otherwise are considered cycles) in the DAG and mean strong partial order throughout.
A set S with partial order ≤ is called a poset and denoted by a tuple ( S, ≤ ) .
A DAG ( V , E ) and a poset ( S, ≤ ) are closely related.
For any DAG, one can deﬁne a unique partial order ≤ on the node set V , such that for all pairs of elements u, v ∈ V , u ≤ v if
and only if there is a directed path from u to v .
On the other hand, for any poset ( S, ≤ ) , there exists (possibly more than) one DAG that uses S as the node set and that admits a directed path from u to v whenever u ≤ v .
In a DAG, all nodes without (direct) predecessors are called sources and we collect them in the set
S .
Similarly, all nodes without (direct) successors are called targets and we collect them in the set
T .
Additionally, we let X = { h 0 v , v ∈ V} be the set of input node features.
2. M ODEL
The main idea of DAGNN is to process nodes according to the partial order deﬁned by the DAG.
Using the language of MPNN, at every node v , we “aggregate” information from its neighbors and “combine” this aggregated information (the “message”) with v ’s information to update the representation of v .
The main differences to MPNN are that (i) we use the current-layer, rather than the past-layer, information to compute the current-layer representation of v and that (ii) we aggregate from the direct-predecessor set P ( v ) only, rather than the entire (or randomly sampled) neighborhood N ( v ) .
They lead to a straightforward difference in the ﬁnal “readout” also.
In the following, we propose an instantiation of Equations (3)–(4).
See Figure 1 for an illustration of the architecture.
One layer.
We use the attention mechanism to instantiate the aggregate operator G (cid:96) .
For a node v at the (cid:96) -th layer, the output message m (cid:96)v computed by G (cid:96) is a weighted combination of h (cid:96)u for all nodes u ∈ P ( v ) at the same layer (cid:96) :
[Equation]
The weighting coefﬁcients α (cid:96)vu follow the query-key design in usual attention mechanisms, whereby the representation of v in the past layer, h (cid:96) − 1 v , serves as the query.
Speciﬁcally, we deﬁne
[Equation]
where w (cid:96) 1 and w (cid:96) 2 are model parameters.
We use the additive form, as opposed to the usual dotproduct form, since it involves fewer parameters.
An additional advantage is that it is straightforward to incorporate edge attributes into the model, as will be discussed soon.
The combine operator F (cid:96) combines the message m (cid:96)v with the previous representation of v , h (cid:96) − 1 v , and produces an updated representation h (cid:96)v .
We employ a recurrent architecture, which is usually used for processing data in sequential order but similarly suits processing in partial order:
[Equation]
[Equation]
where h (cid:96) − 1 v , m (cid:96)v , and h (cid:96)v are treated as the input, past state, and updated state/output of a GRU, respectively.
This design differs from most MPNNs that use simple summation or concatenation to combine the representations.
It further differs from GG-NN (Li et al., 2016) (which also employs a
GRU), wherein the roles of the two arguments are switched.
In GG-NN, the message is treated as the input and the node representation is treated as the state.
In contrast, we start from node features and naturally use them as inputs.
The message tracks the processed part of the graph and serves better the role of a hidden state, being recurrently updated.
By convention, we deﬁne G (cid:96) ( ∅ , · ) =
for the aggregator so that for nodes with an empty directpredecessor set, the message (or, equivalently, the initial state of the GRU) is zero.
Bidirectional processing.
Just like in sequence models where a sequence may be processed by either the natural order or the reversed order, we optionally invert the directions of the edges in G to create a reverse DAG (cid:101) G .
We will use the tilde notation for all terms related to the reverse DAG.
For example, the representation of node v in (cid:101) G at the (cid:96) -th layer is denoted by (cid:101) h (cid:96)v .
Readout.
After L layers of (bidirectional) processing, we use the computed node representations to produce the graph representation.
We follow a common practice—concatenate the representations across layers, perform a max-pooling across nodes, and apply a fully-connected layer to produce the output.
Different from the usual practice, however, we pull across only the target nodes and concatenate the pooling results from the two directions.
Recall that the target nodes contain information of the entire graph following the partial order.
Mathematically, the readout R produces
[Equation]
Note that the target set (cid:101) T of (cid:101) G is the same as the source set S of G .
If the processing is unidirectional, the right pooling in (8) is dropped.
Edge attributes.
The instantiation of the framework so far has not considered edge attributes.
It is in fact simple to incorporate them.
Let τ ( u, v ) be the type of an edge ( u, v ) and let y τ be a representation of edges of type τ .
We insert this information during message calculation in the aggregator.
Speciﬁcally, we replace the attention weights α (cid:96)vu deﬁned in (6) by α
[Equation]
In practice, we experiment with slightly fewer parameters by setting w (cid:96) 3 = w (cid:96) 1 and ﬁnd that the model performs equally well.
The edge representations y τ are trainable embeddings of the model.
Alternatively, if input edge features are provided, y τ ( u,v ) can be replaced by a neural networktransformed embedding for the edge ( u, v ) .
2. T OPOLOGICAL B ATCHING
A key difference to MPNN is that DAGNN processes nodes sequentially owing to the nature of the aggregator G (cid:96) , obeying the partial order.
Thus, for computational efﬁciency, it is important to maximally exploit concurrency so as to better leverage parallel computing resources (e.g., GPUs).
One observation is that nodes without dependency may be grouped together and processed concurrently, if their predecessors have all been processed.
See Figure 2 for an illustration.
To materialize this idea, we consider topological batching , which partitions the node set V into ordered batches {B i } i ≥
so that (i) the B i ’s are disjoint and their union is V ; (ii) for every pair of nodes u, v ∈ B i for some i , there is not a directed path from u to v or from v to u ; (iii) for every i > 0 , there exists one node in B i such that it is the tail of an edge whose head is in B i − 1 .
A similar concept appears in Crouse et al.
(2019); in what follows, we derive several properties that legitimizes its use in our setting.
First, topological batching produces the minimum number of sequential batches such that all nodes in each batch can be processed in parallel.
Theorem 1.
The number of batches from a partitioning that satisﬁes (i)–(iii) described in the preceding paragraph is equal to the number of nodes in the longest path of the DAG.
As a consequence, this partitioning produces the minimum number of ordered batches such that for all u ≤ v , if u ∈ B i and v ∈ B j , then i < j .
Note that the partial order ≤ is deﬁned in Section 2.1.
The partitioning procedure may be as follows.
All nodes without direct predecessors, S , form the initial batch.
Iteratively, remove the batch just formed from the graph, as well as the edges emitting from these nodes.
The nodes without direct predecessors in the remaining graph form the next batch.
Remark 1 .
To satisfy Properties (i)–(iii), it is not necessary that B 0 = S ; but the above procedure achieves so.
Applying this procedure on the reverse DAG (cid:101) G , we obtain (cid:101) B 0 = T .
Note that the last batch for G may not be the same as T ; and the last batch for (cid:101) G may not be the same as S either.
Remark 2 .
Topological batching can be straightforwardly extended to multiple graphs for better parallel concurrency: one merges the B i for the same i across graphs into a single batch.
This is equivalent to treating the multiple DAGs as a single (albeit disconnected)
DAG and applying topological batching on it.
2. P ROPERTIES
In the following, we summarize properties of the DAGNN model; they are consistent with the corresponding results for MPNNs.
To formalize these results, we let M : V × E ×
X
→ h G denote the mapping deﬁned by Equations (3)–(4).
For notational consistency, we omit bidirectional processing, and thus ignore the tilde term in (8).
The ﬁrst results state that DAGNN produces the same graph representation invariant to node permutation.
Theorem 2.
The graph representation h G is invariant to node indexing if all G (cid:96) , F (cid:96) , and R are so.
Corollary 3.
The functions G (cid:96) , F (cid:96) , and R deﬁned in (5) – (8) are invariant to node indexing.
Hence, the resulting graph representation h G is, too.
The next result states that the framework will not produce the same graph representation for different graphs (i.e., non-isomorphic graphs), under a common condition.
Theorem 4.
The mapping M is injective if G (cid:96) , F (cid:96) , and R , considered as multiset functions, are so.
The condition required by Theorem 4 is not restrictive.
There exist (inﬁnitely many) injective multiset functions G (cid:96) , F (cid:96) , and R , although the ones instantiated by (5)–(8) are not necessarily injective.
The modiﬁcation to injection can be done by using the (cid:15) -trick applied in GIN (Xu et al., 2019), but, similar to the referenced work, the (cid:15) that ensures injection is unknown.
In practice, it is either set as zero or treated as a tunable hyperparameter.
C OMPARISON TO R ELATED M ODELS
In this section, we compare to the most closely related architectures for DAGs, including trees.
Natural language processing is a major source of these architectures, since semantic parsing forms a rooted tree or a DAG.
Recently, D-VAE (Zhang et al., 2019) has been suggested as a generalpurpose autoencoder for DAGs.
Its encoder architecture is the most similar one to ours, but we highlight notable differences that support the improvement DAGNN gains over the D-VAE encoder.
All the models we compare with may be considered as restricted cases of the framework (3)–(4).
Rooted trees do usually not come with directed edges, because either direction (top-down or bottomup) is sensible.
Hence, we use the terminology “parent” and “child” instead.
Uniﬁed under our framework, recursive neural networks tailored to trees (Socher et al., 2011; 2012; 2013; Ebrahimi &
Dou, 2015) are applied to a ﬁxed number of children when the aggregator acts on a concatenation of the child representations.
Moreover, they assume that internal nodes do not come with input representations and hence the combine operator misses the ﬁrst argument.
Tree-LSTM (Tai et al., 2015; Zhu et al., 2015; Zhang et al., 2016; Kiperwasser & Goldberg, 2016) and DAG-RNN (Shuai et al., 2016), like DAGNN, employ a recurrent architecture as the combine operator, but the message (hidden state) therein is a naive sum or element-wise product of child representations.
In a variant of Tree-LSTM, the naive sum is replaced by a sum of child representations multiplied by separate weight matrices.
A limitation of this variant is that the number of children must be the same and the children must be ordered.
Another limitation is that both architectures assume that there is a single terminal node (in which case a readout is not invoked).
The most similar architecture to DAGNN is the encoder of D-VAE.
There are two notable differences.
First, D-VAE uses the gated sum as aggregator but we use attention which leverages the information of not only the summands ( h (cid:96)u ) but also that of the node under consideration ( h (cid:96) − 1 v ).
This additional source of information enables attention driven by external factors and improves over self attention.
Second, similar to all the aforementioned models, D-VAE does not come with a layer notion.
On the contrary, we use multiple layers, which are more natural and powerful in the light of ﬁndings about general GNNs.
Our empirical results described in the following section conﬁrm so.
E VALUATION
In this section, we demonstrate the effectiveness of DAGNN on multiple datasets and tasks over a comprehensive list of baselines.
We compare timing and show that the training cost of DAGNN is comparable with that of other DAG architectures.
We also conduct ablation studies to verify the importance of its components, which prior DAG architectures lack.
4. D ATASETS , T ASKS , M ETRICS , AND B ASELINES
The OGBG-CODE dataset (Hu et al., 2020) contains 452,741 Python functions parsed into DAGs.
We consider the TOK task, predicting the tokens that form the function name; it is included in the
Open Graph Benchmark (OGB).
Additionally, we introduce the LP task, predicting the length of the longest path of the DAG.
The metric for TOK is the F1 score and that for LP is accuracy.
Because of the vast size, we also create a 15% training subset, OGBG-CODE-15 , for similar experiments.
For this dataset, we consider three basic baselines and several GNN models for comparison.
For the
TOK task, the Node2Token baseline predicts tokens from the attributes of the second graph node, while the TargetInGraph baseline predicts tokens that appear in both the ground truth and in the attributes of some graph node.
These baselines exploit the fact that the tokens form node attributes and that the second node’s attribute contains the function name if it is part of the vocabulary.
For the LP task, the MajorityInValid baseline constantly predicts the majority length seen from the validation set.
The considered GNN models include four from OGB: GCN (Kipf & Welling, 2017),
GIN (Xu et al., 2019), GCN-VN , GIN-VN (where -VN means adding a virtual node connecting all existing nodes); two using attention/gated-sum mechanisms: GAT (Veliˇckovi´c et al., 2018), GG-NN (Li et al., 2016) pooling approaches attention: SAGPool (Lee et al., 2019)
ASAP (Ranjan al
[Table] [Table]
The NA dataset (Zhang et al., 2019) contains 19,020 neural architectures generated by the ENAS software.
The task is to predict the architecture performance on CIFAR-10 under the weight-sharing scheme.
Since it is a regression task, the metrics are RMSE and Pearson’s r .
To gauge performance with Zhang et al.
(2019), we similarly train (unsupervised) autoencoders and use sparse Gaussian process regression on the latent representation to predict the architecture performance.
DAGNN serves as the encoder and we pair it with an adaptation of the D-VAE decoder (see Appendix D)
[Table]
We compare to D-VAE and all the autoencoders compared therein: S-VAE (Bowman et al., 2016),
GraphRNN (You et al., 2018), GCN (Zhang et al., 2019), and DeepGMG (Li et al., 2018).
The BN dataset (Zhang et al., 2019) contains 200,000 Bayesian networks generated by using the R package bnlearn.
The task is to predict the BIC score that measures how well a BN ﬁts the Asia dataset (Lauritzen & Spiegelhalter, 1988).
We use the same metrics and baselines as for NA.
R ESULTS AND D ISCUSSION
Prediction performance, token prediction (TOK), Table 1.
The general trend is the same across the full dataset and the 15% subset.
DAGNN performs the best.
GAT achieves the second best result, surprisingly outperforming D-VAE (the third best).
Hence, using attention as aggregator during message passing beneﬁts this task.
On the 15% subset, only DAGNN, GAT, and D-VAE match or surpass the TargetInGraph baseline.
Note that not all ground-truth tokens are in the vocabulary and thus the best achievable F1 is 90.99.
Even so, all methods are far from reaching this ceiling performance.
Furthermore, although most of the MPNN models (middle section of the table) use as many as ﬁve layers for message passing, the generally good performance of DAGNN and D-VAE indicates that DAG architectures not restricted by the network depth beneﬁt from the inductive bias.
Prediction performance, length of longest path (LP), Table 1.
This analytical task interestingly reveals that many of the ﬁndings for the TOK task do not directly carry over.
DAGNN still performs
[Figure] [Figure]
[Table]
the best
[Table]
but the second place is achieved by D-VAE while GAT lags far behind.
The unsatisfactory performance of GAT indicates that attention alone is insufﬁcient for DAG representation learning.
The hierarchical pooling methods also perform disappointingly, showing that ignoring nodes may modify important properties of the graph (in this case, the longest path).
It is worth noting that
DAGNN and D-VAE achieve nearly perfect accuracy.
This result corroborates the theory of Xu et al.
(2020), who state that when the inductive bias is aligned with the reasoning algorithm (in this case, path tracing), the model learns to reason more easily and achieves better sample efﬁciency.
Prediction performance, scoring the DAG, Table 2.
On NA and BN, DAGNN also outperforms
D-VAE, which in turn outperforms the other four baselines (among them, DeepGMG works the best on NA and S-VAE works the best on BN, consistent with the ﬁndings of Zhang et al.
While
D-VAE demonstrates the beneﬁt of incorporating the DAG bias, DAGNN proves the superiority of its architectural components, as will be further veriﬁed in the subsequent ablation study.
Time cost, Figure 3.
The added expressivity of DAGNN comes with a tradeoff: the sequential processing of the topological batches requires more time than does the concurrent processing of all graph nodes, as in MPNNs.
Figure 3 shows that such a trade-off is innate to DAG architectures, including the D-VAE encoder.
Moreover, the ﬁgure shows that, when used as a component of a larger architecture (autoencoder), the overhead of DAGNN may not even be essential.
For example, in this particular experiment, DeepGMG (paired with the S-VAE encoder) takes an order of magnitude more time than does DAGNN (paired with the D-VAE decoder).
Most importantly, not reﬂected in the ﬁgure is that DAGNN learns better and faster at larger learning rates, leading to fewer learning epochs.
For example, DAGNN reaches the best performance at epoch 45, while D-VAE at around 200.
Ablation study, Table 3.
While the D-VAE encoder performs competitively owing similarly to the incorporation of the DAG bias, what distinguishes our proposal are several architecture components that gain further performance improvement.
In Table 3, we summarize results under the following cases: replacing attention in the aggregator by gated sum; reducing the multiple layers to one; replacing the GRUs by fully connected layers; modifying the readout by pooling over all nodes; and removing the edge attributes.
One observes that replacing attention generally leads to the highest degradation in performance, while modifying other components yields losses too.
There are two exceptions.
One occurs on LP-15, where gated-sum aggregation surprisingly outperforms attention by a tight margin, considering the standard deviation.
The other occurs on the modiﬁcation of the readout for the BN dataset.
In this case, a Bayesian network factorizes the joint distribution
[Table]
of all variables (nodes) it includes.
Even though the DAG structure characterizes the conditional independence of the variables, they play equal roles to the BIC score and thus it is possible that emphasis of the target nodes adversely affects the predictive performance.
In this case, pooling over all nodes appears to correct the overemphasis.
[Figure]
Sensitivity analysis, Table 4 and Figure 4.
It is well known that MPNNs often achieve best performance with a small number of layers, a curious behavior distinct from other neural networks.
It is important to see if such a behavior extends to
DAGNN.
In Table 4, we list the results for up to four layers.
One observes that indeed the best performance occurs at either two or three layers.
In other words, one layer is insufﬁcient (as already demonstrated in the ablation study) and more than three layers offer no advantage.
We further extend the experimentation on TOK-15 with additional layers and plot the results in Figure 4.
The trend corroborates that the most significant improvement occurs when going beyond a single layer.
It is also interesting to see that a single layer yields the highest variance subject to randomization.
Structure learning, Figure 5. For an application of DAGNN, we extend the use of the BN dataset to learn the Bayesian network for the Asia data. In particular, we take the Bayesian optimization approach and optimize the BIC score over the latent space of DAGs. We use the graphs in BN as pivots and encode every graph by using DAGNN.
The optimization yields a DAG with BIC score − 11107 .
29 (see Figure 5).
This DAG is almost the same as the ground truth (see Figure 2 of Lauritzen & Spiegelhalter (1988)), except that it does not include the edge from “visit to A sia?”
to “ T uberculosis?”.
It is interesting to note that the identiﬁed DAG has a higher BIC score than that of the ground truth, − 11109 .
Furthermore, the BIC score is also much higher than that found by using the D-VAE encoder, − 11125 .
75 (Zhang et al., 2019).
This encouraging result corroborates the superior encoding quality of DAGNN and the effective use of it in downstream tasks.
C ONCLUSIONS
We have developed DAGNN, a GNN model for a special yet widely used class of graphs—DAGs.
It incorporates the partial ordering entailed by DAGs as a strong inductive bias towards representation learning.
With the blessing of this inductive bias, we demonstrate that DAGNNs outperform
MPNNs on several representative datasets and tasks.
Through ablation studies, we also show that the
DAGNN model is well designed, with several components serving as crucial contributors to the performance gain over other models that also incorporate the DAG bias, notably, D-VAE.
Furthermore, we theoretically study a batching technique that yields maximal parallel concurrency in processing
DAGs and prove that DAGNN is permutation invariant and injective.
A P ROOFS
Proof of Theorem 1.
Let ( v 1 , v 2 , . .
. , v d ) be a longest path of the DAG.
The number of batches must be at least d , because otherwise there exists a batch that contains at least two nodes on this path, violating Property (ii).
On the other hand, given the partitioning, according to Property (iii), one may trace a directed path, one node from each batch, starting from the last one.
The longest path must be at least that long.
In other words, the number of batches must be at most the number of nodes on the longest path.
Hence, these two numbers are equal.
The consequence stated by the theorem straightforwardly follows.
Proof of Theorem 2.
We ﬁrst show that h (cid:96)v is invairant to the indexing of v by double induction on (cid:96) and v .
The base case is (cid:96) = 1 and v ∈ B 0 .
In this case, m 1 v =
G 1 ( ∅ , h 0 v ) = 0 is invairant to the indexing of v .
Then, h 1 v = F 1 ( h 0 v , m 1 v ) is, too.
In the induction, if for all (cid:96) (cid:48) < (cid:96) and all v (cid:48) , and for (cid:96) (cid:48) = (cid:96) and v (cid:48) ∈ B 0 ∪ · · · ∪ B i − 1 , h (cid:96) (cid:48) v (cid:48) is invairant to the indexing of v (cid:48) , then for (cid:96) (cid:48)
=
(cid:96) and v ∈ B i , m (cid:96)v = G (cid:96) ( { h (cid:96)u | u ∈ P ( v ) } , h (cid:96) − 1 v ) and h (cid:96)v = F (cid:96) ( h (cid:96)v , m (cid:96)v ) are both invairant to the indexing of v .
Thus, by induction, for all (cid:96) (cid:48) = (cid:96) and all v , h (cid:96) (cid:48) v is invairant to the indexing of v .
Then, by an outer induction, for all (cid:96) and all v , h (cid:96)v is invairant to the indexing of v .
Therefore, h G = R ( { h (cid:96)v , (cid:96) = 0 , 1 , . . .
, L, v ∈ T } ) is invairant to the indexing of the nodes in T and thus of the entire node set.
Proof of Corollary 3.
The function G (cid:96) is invariant to node indexing because it is a weighted sum of the elements in its ﬁrst argument, { h (cid:96)u } , whereas the weights are parameterized by using the same parameter w (cid:96) 2 for these elements.
The function F (cid:96) is invariant to node indexing because its two arguments are clearly distinguished.
The function R is invariant to node indexing because the FC layer applies to the pooling result of h (cid:96)v for a ﬁxed set of v .
Proof of Theorem 4.
Suppose two graphs G and G (cid:48) have the same representation h G =
h
G (cid:48) .
Then, from the function R , they must have the same target set T and same node representations h (cid:96)v for all nodes v ∈ T and all layers (cid:96) .
In particular, for the last layer (cid:96) =
L , from the functions F L and G L , each of these nodes, v , from the two graphs must have the same set of direct predecessors P ( v ) , each element u of which have the same representation h
Lu across graphs.
By backward induction, the two graphs must have the same node set V and edge set E .
Moreover, for each node v ∈ V , the last-layer representation h
Lv must be the same.
Furthermore, from the injection property of F (cid:96) , if a node v shares the same node representation h (cid:96)v across graphs, then its past-layer representation h (cid:96) − 1 v must also be the same across graphs.
A backward reduction traces back to the initial representation h 0 v , which concludes that the two graphs must have the same set of input node features X .
B D ATASET D ETAILS
OGBG-CODE.
The OGBG-CODE dataset was recently included in the Open Graph Benchmark (OGB)
(Hu et al., 2020, Section 6.3).
It contains 452,741 Python method deﬁnitions extracted from thousands of popular Github repositories.
The method deﬁnitions are represented as DAGs by augmenting the abstract syntax trees with edges connecting the sequence of source code tokens.
Hence, there are two types of edges.
The min/avg/max numbers of nodes in the graphs are 11/125/36123, respectively.
We use the node features provided by the dataset, including node type, attributes, depth in the AST, and pre-order traversal index.
The task suggested by Hu et al.
(2020) is to predict the sub-tokens forming the method name, also known as “code summarization”.
The task is considered a proxy measure of how well a model captures the code semantics (Allamanis et al., 2018).
We additionally consider the task of predicting the length of the longest path in the graph.
We treat it as a 275-way classiﬁcation because the maximum length is 275.
The distribution of the lengths/classes is shown in Appendix E. To avoid triviality, for this task we remove the AST depth from the node feature set.
We adopt OGB’s project split , whose training set consists of Github projects not seen in the validation and test sets.
We also experiment with a subset of the data, OGBG-CODE-15, which contains only randomly chosen 15% of the OGBG-CODE training data.
Validation and test sets remain the same.
In addition to OGBG-CODE, we further experiment with two DAG datasets, NA and BN, used by
Zhang et al.
for evaluating their model D-VAE.
To compare with the results reported in the referenced work, we focus on the predictive performance of the latent representations of the DAGs obtained from autoencoders.
We adopt the given 90/10 splits.
Neural architectures (NA).
This dataset is created in the context of neural architecture search.
It contains 19,020 neural architectures generated from the ENAS software (Pham et al., 2018).
Each neural architecture has 6 layers (i.e., nodes) sampled from 6 different types of components, plus an input and output layer.
The input node vectors are one-hot encodings of the component types.
The weight-sharing accuracy (Pham et al., 2018) (a proxy of the true accuracy) on CIFAR-
(Krizhevsky, 2009) is taken as performance measure.
Details about the generation process can be found in Zhang et al.
(2019, Appendix H).
Bayesian networks (BN).
This dataset contains 200,000 random 8-node Bayesian networks generated by using the R package bnlearn (Scutari, 2010).
The Bayesian Information Criterion (BIC) score is used to measure how well the DAG structure ﬁts the Asia dataset (Lauritzen & Spiegelhalter, 1988).
The input node vectors are one-hot encodings of the node indices according to topological sort.
See Zhang et al.
(2019, Appendix I) for further details.
C B ASELINE D ETAILS
Baselines for OGBG-CODE.
We use three basic measures to set up baseline performance, two for token prediction and one for the longest path task.
(1) Node2Token :
This method uses the attribute of the second node of the graph as prediction.
We observe that the second node either contains the function name, if the token occurs in the vocabulary (which is not always the case because some function names consist of multiple words), or contains “None”.
(2) TargetInGraph : This method pretends that it knows the ground-truth tokens but predicts only those occurring in the graph.
One would expect that a learning model may be able to outperform this method if it learns the associations of tokens outside the current graph.
(3) MajorityInValid : This method always predicts the majority length seen in the validation set.
Additionally, we compare with multiple GNN models.
Some of them are the GNN implementations offered by OGB: GCN , GIN , GCN-VN , and GIN-VN .
The latter two are extensions of the ﬁrst two by including a virtual node (i.e., an additional node that is connected to all nodes in the graph).
Note that the implementations do not strictly follow the architectures described in the original papers (Kipf & Welling, 2017; Xu et al., 2019).
In particular, edge types are incorporated and inverse edges are added for bidirectional message passing.
Since our model features attention mechanisms, we include GAT (Veliˇckovi´c et al., 2018) and GGNN (Li et al., 2016) for comparison.
We also include two representative hierarchical pooling approaches, which use attention to determine node pooling: SAGPool (Lee et al., 2019) and ASAP (Ranjan et al., 2020).
Lastly, we compare with the encoder of D-VAE (Zhang et al., 2019, Appendix
E, F).
Baselines for NA and BN.
Over NA and BN, we consider D-VAE and the baselines in Zhang et al.
(2019, Appendix J).
S-VAE (Bowman et al., 2016) applies a standard GRU-based RNN variational autoencoder to the topologically sorted node sequence, with node features augmented by the information of incoming edges, and decodes the graph by generating an adjacency matrix.
GraphRNN (You et al., 2018) by itself serves as a decoder; we pair it with S-VAE encoder.
GCN uses a GCN encoder while takes the decoder of D-VAE.
DeepGMG (Li et al., 2018) similarly uses a GNN-based encoder but employs its own decoder (which is similar to the one in D-VAE).
Note that all these baselines are autoencoders and our objective is to compare the performance of the latent representations.
D M ODEL C ONFIGURATIONS AND T RAINING D. E XPERIMENT P ROTOCOL AND H YPERPARAMETER T UNING
Our evaluation protocols and procedures closely follow those of Hu et al.
; Zhang et al.
For OGBG-CODE, we only changed the following.
We used 5-fold cross validation due to the size of the dataset and the number of baselines for comparison.
Since we compared with vast kinds of models in addition to the OGB baselines, we swept over a large range of learning rates and, for each model, picked the best from the set { 1e-4, 5e-4, 1e-3, 1.5e-3, 2e-3, 1e-2, 1.5e-2 } based on performance on OGBG-CODE-15.
We stopped training when the validation metric did not improve further under a patience of 20 epochs, for all models but D-VAE and DAGNN.
For the latter two, we used a patience of 10.
Moreover, for these two models we used gradient clipping (at 0.25) due to the recurrent layers and a batch size of 80.
Note that OGB uses 10-fold cross validation with a ﬁxed learning rate of 1e-3, a ﬁxed epoch number 30, and a batch size 128.
For NA and BN, we followed the exact training settings of Zhang et al.
(2019, Appendix K).
For
DAGNN, we started the learning rate scheduler at 1e-3 (instead of 1e-4) and stopped at a maximum number of epochs, 100 for NA and 50 for BN (instead of 300 and 100, respectively).
We also trained a sparse Gaussian process (SGP) (Snelson & Ghahramani, 2005) as the predictive model, as described in Zhang et al.
(2019, Appendix L), to evaluate the performance of the latent representations.
The prediction results were averaged over 10 folds.
For the Bayesian network learning experiment we similarly took over the settings of Zhang et al.
(2019), running ten rounds of Bayesian optimization.
D. B ASELINE M ODELS
All models were implemented in PyTorch (Paszke et al., 2019).
For OGBG-CODE, we used the
GCN and GIN models provided by the benchmark.
We implemented a GAT model as described in
Veli ˇ ckovi ´ c et al.
and GG-NN in Li et al.
We used the SAGPool implementation of Lee et al.
(2019) and ASAP from the Pytorch Geometric Benchmark Suite https://github.com/ rusty1s/pytorch_geometric/tree/master/benchmark .
All these models were implemented using PyTorch Geometric (Fey & Lenssen, 2019).
We used the parameters suggested in
OGB (e.g., 5 GNN layers, with embedding and hidden dimension 300), with the exception of ASAP where we used 3 instead of 5 layers due to memory constraints.
Since the D-VAE implementation does not support topological batching as we do, and also because of other miscellaneous restrictions (e.g., a single source node and target node), we reimplement
D-VAE by using our DAGNN codebase.
The reimplementation reproduces the results reported by
Zhang et al.
See Appendix F for more details.
D. DAGNN I MPLEMENTATION
For DAGNN, we used hidden dimension 300.
As suggested by OGB, we used independent linear classiﬁers to predict sub-tokens at each position of the sub-token sequence.
Similarly, we used a linear classiﬁer to predict the length of the longest path.
For the NA and BN datasets, we took the baseline implementations as well as training and evaluation procedures from Zhang et al.
In particular, we used the corresponding conﬁguration of DVAE for the BN dataset.
For DAGNN, we used the same hidden dimension 501 and adapted the decoder of D-VAE (by replacing the use of D-VAE encoder in part of the decoding process with our encoder).
Additionally, we used bidirectional processing for token prediction over OGBG-CODE and for the experiment over BN.
Since it did not offer improvement in performance for the longest path length prediction and for the experiment over NA but consumed too much time, for these cases we used unidirectional processing.
E D ETAILS ON THE L ONGEST P ATH E XPERIMENT
We observe that for the MPNN baselines, the longest path results shown in Table 1 are much worse on the 15% subset than on the full dataset.
We speculate whether the poorer performance is caused by purely the size of training data, or additionally by the discrepancy of data distributions.
Figureshows that the data distributions are rather similar.
Hence, we conclude that the degrading performance of MPNNs on a smaller training set is due to their low sample efﬁciency, in contrast to DAG architectures (D-VAE and DAGNN) that perform similarly on both the full set and the subset.
F R EIMPLEMENTATION OF D-VAE
The original D-VAE implementation processes nodes sequentially and thus is time consuming.
Therefore, we reimplement D-VAE by using our DAGNN codebase, in particular supporting topological batching.
Table 5 shows that our reimplementation reproduces closely the results obtained by the original D-VAE implementation.
[Table]
G A DDITIONAL A BLATION R ESULTS
As mentioend in the main text, bidirectional processing is optional; it does not necessarily improve over unidirectional.
Indeed, Table 6 shows that bidirectional works better on TOK-15 and BN, but unidirectional works better on LP-15 and NA.
However, either way, DAGNN outperforms all baselines reported in Table 1 and 2, with only one exception: on LP-15, D-VAE performs worse than unidirectional but better than bidirectional.
[Table]