Dynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning
arXiv:1909.11334
Abstract
We propose Dynamically Pruned Message Passing Networks (DPMPN) for large-scale knowledge graph reasoning. In contrast to existing models, embedding-based or path-based, we learn an input-dependent subgraph to explicitly model reasoning process. Subgraphs are dynamically constructed and expanded by applying graphical attention mechanism conditioned on input queries. In this way, we not only construct graph-structured explanations but also enable message passing designed in Graph Neural Networks (GNNs) to scale with graph sizes. We take the inspiration from the consciousness prior proposed by and develop a two-GNN framework to simultaneously encode input-agnostic full graph representation and learn input-dependent local one coordinated by an attention module. Experiments demonstrate the reasoning capability of our model that is to provide clear graphical explanations as well as deliver accurate predictions, outperforming most state-of-the-art methods in knowledge base completion tasks.
arXiv commentICLR2020
References in corpus (13)
- Semi-Supervised Classification with Graph Convolutional Networks
- Neural Message Passing for Quantum Chemistry
- Geometric deep learning: going beyond Euclidean data
- Molecular Graph Convolutions: Moving Beyond Fingerprints
- A Structured Self-attentive Sentence Embedding
- Deep Convolutional Networks on Graph-Structured Data
- A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network
- A simple neural network module for relational reasoning
- Go for a Walk and Arrive at the Answer: Reasoning Over Paths in Knowledge Bases using Reinforcement Learning
- The Consciousness Prior
- TensorLog: A Differentiable Deductive Database
- M-Walk: Learning to Walk over Graphs using Monte Carlo Tree Search
- Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervision