Running TODOs

[dmlc]

Running TODOs

[zzhang-cn]

Some thoughts:
[] Extend networkx's dict-of-dict to store tensors
[] Cache adjacency matrix (for the reduce function)
[] Establish scale-testing
[] Think about how to scale out to multiple cards

[jermainewang]

Incorporated ZZ's advices.

[BarclayII]

I have gone through the nvGraph API and I doubt if we can use the SrSPMV function in the reducers. Their graph structure and SrSPMV only operates on scalars.

Also for keeping track of TODOs I recommend Trello. It can set deadlines, assign people and send reminders to mailboxes.

[zzhang-cn]

Also let's re-org the folds and make a more complete listing of examples. We have:

• PageRank
• TreeLSTM
• GAT, GCN, MGCN, GeniePath,
• Line-graph
• Dynamic graph (in the generative_model branch)

I might have missed some. Let's put a readme in the example folder, with links to the appropriate papers.

[jermainewang]

Close as we are using trello to keep track of progress.

[kitaev-chen]

I think "Dynamic graph (in the generative_model branch)" will be a real competitive feature compared with other graph libraries since graph based generative model / gaussian process will be very prevalent .

[mufeili]

Thanks a lot for the suggestion @kitaev-chen . I'm personally a big fan of generative models and yes we are likely to incorporate some more examples on generative models in the future. As this issue is closed now, you may want to instead post your suggestion at #450 . Also let us know if there are some models that you are particularly interested.