Graph Machine Learning

How random are peer reviews? A new paper came out about the quality of the reviews at peer-review conferences that analyzed submissions at ICLR's OpenReview for the last 4 years. Here is what I found the most interesting. * If an accepted paper were reviewed anew, would it be accepted a second time? This is called reproducibility of reviews. In 2020, it's 66% which means 1 out of 3 times you'd get a reject even if your paper deserves acceptance. More to it, even if you increase the number of reviewers reproducibility will be around the same ~70%. * Do final paper score correlates with how many citations it gets? Yes, higher ranked papers get more citations. What's more interesting is how many more citations a paper gets just due to an exposure at the conference: the correlation doubles just because of the exposure at the venue. * Is there a bias of affiliation, author reputation, or ArXiv in reviewers' scores? Yes, but very small. For example, papers at Cornell get 0.58 boost of the score (out of 10). For Google and DeepMind there is no correlation between their score and acceptance rate compared to other papers. Same can be said about ArXiv availability of a paper or h-index of the authors.

Fresh picks from ArXiv Today at ArXiv: learning logic and simulations with GNN and a new practical guide to GNNs. If I forgot to mention your paper, please shoot me a message and I will update the post. Conferences - Lightweight, Dynamic Graph Convolutional Networks for AMR-to-Text Generation EMNLP 2020 - Learning to Represent Image and Text with Denotation Graph EMNLP 2020 - TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion EMNLP 2020 with William L. Hamilton - Embedding Words in Non-Vector Space with Unsupervised Graph Learning EMNLP 2020 - Unsupervised Joint k-node Graph Representations with Compositional Energy-Based Models with Bruno Ribeiro, NeurIPS 2020 - Dirichlet Graph Variational Autoencoder NeurIPS 2020 - RatE: Relation-Adaptive Translating Embedding for Knowledge Graph Completion COLING 2020 GNN - Graph Convolutional Value Decomposition in Multi-Agent Reinforcement Learning - High-Order Relation Construction and Mining for Graph Matching - RNNLogic: Learning Logic Rules for Reasoning on Knowledge Graphs with Yoshua Bengio and Jian Tang - Learning Mesh-Based Simulation with Graph Networks with Peter W. Battaglia - Directional Graph Networks with William L. Hamilton - Simplicial Neural Networks Survey - A Practical Guide to Graph Neural Networks

NeurIPS 2020 Graph Papers I counted 123 graph papers (attached) at NeurIPS 2020, which is 6.5% of all accepted papers. This repo provides a good categorization of graph papers into topics such as oversmoothing, adversarial attacks, expressive power, etc. Also the plot shows number of accepted papers per "graph" authors, i.e. authors that at least have one graph paper at NeurIPS 2020.

Graph Machine Learning research groups: Tina Eliassi-Rad I do a series of posts on the groups in graph research, previous post is here. The 16th is Tina Eliassi-Rad, coauthor of Cora datasets that are still widely used in node classification benchmarks. Tina Eliassi-Rad (~1974) - Affiliation: Northeastern University - Education: Ph.D. at University of Wisconsin-Madison in 2001 (advisor: Jude Shavlik) - h-index 32 - Awards: best paper awards ICDM, CIKM; ISI fellow - Interests: graph mining, anomaly detection, graph algorithms

GML Newsletter Issue #3 The third issue of GML newsletter is available! Blog posts, videos, past and future events.

DataStart Conference 2020 There is a russian-speaking event DataStart (20 Oct) that includes presentations from the leading experts in the industry and academy in Russia. The speakers include Anton Tsitsulin who will talk about unsupervised graph embeddings and Valentin Malykh who will describe how you can use knowledge graphs for visualization in NLP.

RAPIDS cuGraph adds NetworkX and DiGraph Compatibility Very exciting update to running graph algorithms on GPU. Huge speedups for typical algorithms (PageRank, SCC, etc.) and new algorithms (Louvain, Leiden, etc.) for graphs with thousands of vertices. The migration from networkx seems very smooth, so worth giving it a shot.

Fresh picks from ArXiv Today at ArXiv: GNNs rescue NLP, power of random initialization, and a survey on computation of GNNs 🏭 If I forgot to mention your paper, please shoot me a message and I will update the post. Conferences - Towards Interpretable Reasoning over Paragraph Effects in Situation EMNLP 2020 - Double Graph Based Reasoning for Document-level Relation Extraction EMNLP 2020 - Neural Topic Modeling by Incorporating Document Relationship Graph EMNLP 2020 - GraphDialog: Integrating Graph Knowledge into End-to-End Task-Oriented Dialogue Systems EMNLP 2020 - Knowledge-Enhanced Personalized Review Generation with Capsule Graph Neural Network CIKM 2020 - Knowledge Graph Embeddings in Geometric Algebras COLING 2020 - TeRo: A Time-aware Knowledge Graph Embedding via Temporal Rotation COLING 2020 GNNs - The Surprising Power of Graph Neural Networks with Random Node Initialization - Interpreting Graph Neural Networks for NLP With Differentiable Edge Masking with Ivan Titov - Direct Multi-hop Attention based Graph Neural Network with Jure Leskovec - Graph Neural Networks with Heterophily with Danai Koutra - My Body is a Cage: the Role of Morphology in Graph-Based Incompatible Control with Shimon Whiteson Survey - Computing Graph Neural Networks: A Survey from Algorithms to Accelerators