Missing functionality compared to DGL

[CarloLucibello]

Checklist of stuff we miss compared to Deep Graph Library. PRs are welcome!

Conv Layers

• [x] GraphConv (called GCNConv here)
• [ ] EdgeWeightNorm
• [ ] RelGraphConv
• [ ] TAGConv
• [x] GATConv
• [x] EdgeConv
• [x] SAGEConv
• [ ] SGConv
• [ ] APPNPConv
• [x] GINConv
• [x] GatedGraphConv
• [x] GMMConv (#147)
• [x] ChebConv
• [x] AGNNConv
• [x] NNConv
• [ ] AtomicConv
• [ ] CFConv
• [ ] DotGatConv
• [ ] TWIRLSConv
• [ ] TWIRLSUnfoldingAndAttention
• [ ] GCN2Conv

Dense Conv Layers

• [ ] DenseGraphConv
• [ ] DenseSAGEConv
• [ ] DenseChebConv

Global Pooling Layers

• [x] SumPooling (GlobalPooling(+) here)
• [x] AvgPooling (GlobalPooling(mean) here)
• [x] MaxPooling (GlobalPooling(max) here)
• [ ] SortPooling
• [ ] WeightAndSum
• [x] GlobalAttentionPooling
• [x] Set2Set
• [ ] SetTransformerEncoder
• [ ] SetTransformerDecoder

Batching and Reading Out Ops

https://docs.dgl.ai/en/0.6.x/api/python/dgl.html#batching-and-reading-out-ops

• [x] batch. Use Flux.batch or SparseArrays.blockdiag
• [x] unbatch
• [x] readout_nodes (called reduce_nodes here)
• [x] readout_edges (called reduce_edges here)
• [x] sum_nodes # use reduce_nodes(+, g, x)
• [x] sum_edges # use reduce_edges(+, g, x)
• [x] mean_nodes
• [x] mean_edges
• [x] max_nodes
• [x] max_edges
• [x] softmax_nodes
• [x] softmax_edges
• [x] broadcast_nodes
• [x] broadcast_edges
• [ ] topk_nodes
• [ ] topk_edges

Adjacency Related Utilities

• [x] khop_adj
• [x] laplacian_lambda_max

nn.functional

https://docs.dgl.ai/api/python/nn.functional.html

• [x] edge_softmax (softmax_edge_neighbors here)

optim

https://docs.dgl.ai/api/python/dgl.optim.html

• [ ] Sparse Adam
• [ ] Sparse AdaGrad

nn Utility Modules

• [x] Sequential (GNNChain here)
• [ ] WeightBasis
• [x] KNNGraph
• [ ] SegmentedKNNGraph

nn NodeEmbedding Module

• [ ] NodeEmbedding

Sampling and Stochastic training

.....

Distributed Training

....

[oysteinsolheim]

Would it be possible to also have a list of wished-for-algorithms, included or not in DGL? :-) For example I'd love to see edge-featured-based algorithms in general, and maybe more specifically the "Exploiting Edge Features in Graph Neural Networks" from .https://arxiv.org/abs/1809.02709

[CarloLucibello]

Of course! You can file a separate issue for each feature request and I'll try to get to them as soon as I can spare some time if no one beats me to it. For instance, "Exploiting Edge Features in Graph Neural Networks" seems to be cited enough that it is worth having, so you are welcome to open a new issue.

[oysteinsolheim]

Perfect! :-)