A Crystal Graph Convolutional layer as presented by Xie & Grossman (2018).
Mode: single, disjoint.
This layer expects a sparse adjacency matrix.
This layer computes for each node \mjeqni:
\mjdeqn H_i = X_i + \sum\limits_j \in \mathcalN(i) \sigma \left( z_ij W^(f) + b^(f) \right) \odot g \left( z_ij W^(s) + b^(s) \right)
where \mjeqnz_ij = X_i \| X_j \| E_ij , \mjeqn\sigma is a sigmoid
activation, and \mjeqng is the activation function (defined by the activation
argument).
Input
Node features of shape (N, F)
;
Binary adjacency matrix of shape (N, N)
.
Edge features of shape (num_edges, S)
.
Output
Node features with the same shape of the input, but the last dimension
changed to channels
.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 |
channels |
integer, number of output channels |
activation |
activation function to use |
use_bias |
bool, add a bias vector to the output |
kernel_initializer |
initializer for the weights |
bias_initializer |
initializer for the bias vector |
kernel_regularizer |
regularization applied to the weights |
bias_regularizer |
regularization applied to the bias vector |
activity_regularizer |
regularization applied to the output |
kernel_constraint |
constraint applied to the weights |
bias_constraint |
constraint applied to the bias vector. |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.