Neural models of Knowledge Base data have typically employed compositional representations of graph objects: entity and relation embeddings are systematically combined to evaluate the truth of a candidate Knowedge Base entry. Using a model inspired by Harmonic Grammar, we propose to tokenize triplet embeddings by subjecting them to a process of optimization with respect to learned well-formedness conditions on Knowledge Base triplets. The resulting model, known as Gradient Graphs, leads to sizable improvements when implemented as a companion to compositional models. Also, we show that the "supracompositional" triplet token embeddings it produces have interpretable properties that prove helpful in performing inference on the resulting triplet representations.
Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion
School of Artificial Intelligence, Jilin University(吉林大学人工智能学院);Paul G. Allen School of Computer Science & Engineering, University of Washington(华盛顿大学保罗·G·艾伦计算机科学与工程学院);College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院);International Center of Future Science, Jilin University(吉林大学未来科学国际中心)
Retrieval, Reasoning, Re-ranking: A Context-Enriched Framework for Knowledge Graph Completion
IDEA Research, International Digital Economy Academy(IDEA研究室,国际数字经济学院);Department of Computer Science & Engineering, The Chinese University of Hong Kong(计算机科学与工程系,香港中文大学);Artificial Intelligence Thrust, Hong Kong University of Science and Technology (Guangzhou)(人工智能方向,香港科技大学(广州))
Transductive Data Augmentation with Relational Path Rule Mining for Knowledge Graph Embedding
Tokyo Institute of Technology(东京工业大学);Chiba Institute of Technology(千叶工业大学);Riken AIP(日本理化学研究所人工智能项目);Nara Institute of Science & Technology(奈良先端科学技术大学)