Efficient Relation-aware Scoring Function Search for Knowledge Graph Embedding

04/22/2021
by   Shimin Di, et al.
0

The scoring function, which measures the plausibility of triplets in knowledge graphs (KGs), is the key to ensure the excellent performance of KG embedding, and its design is also an important problem in the literature. Automated machine learning (AutoML) techniques have recently been introduced into KG to design task-aware scoring functions, which achieve state-of-the-art performance in KG embedding. However, the effectiveness of searched scoring functions is still not as good as desired. In this paper, observing that existing scoring functions can exhibit distinct performance on different semantic patterns, we are motivated to explore such semantics by searching relation-aware scoring functions. But the relation-aware search requires a much larger search space than the previous one. Hence, we propose to encode the space as a supernet and propose an efficient alternative minimization algorithm to search through the supernet in a one-shot manner. Finally, experimental results on benchmark datasets demonstrate that the proposed method can efficiently search relation-aware scoring functions, and achieve better embedding performance than state-of-the-art methods.

READ FULL TEXT
research
07/01/2021

AutoSF+: Towards Automatic Scoring Function Design for Knowledge Graph Embedding

Scoring functions, which measure the plausibility of triples, have becom...
research
04/26/2019

AutoKGE: Searching Scoring Functions for Knowledge Graph Embedding

Knowledge graph embedding (KGE) aims to find low dimensional vector repr...
research
05/26/2023

Prompt- and Trait Relation-aware Cross-prompt Essay Trait Scoring

Automated essay scoring (AES) aims to score essays written for a given p...
research
07/24/2022

AutoWeird: Weird Translational Scoring Function Identified by Random Search

Scoring function (SF) measures the plausibility of triplets in knowledge...
research
06/29/2022

ComDensE : Combined Dense Embedding of Relation-aware and Common Features for Knowledge Graph Completion

Real-world knowledge graphs (KG) are mostly incomplete. The problem of r...
research
11/15/2017

Revisiting Simple Neural Networks for Learning Representations of Knowledge Graphs

We address the problem of learning vector representations for entities a...
research
11/06/2019

Searching to Exploit Memorization Effect in Learning from Corrupted Labels

Sample-selection approaches, which attempt to pick up clean instances fr...

Please sign up or login with your details

Forgot password? Click here to reset