This paper, by contrast, investigates the potential of using very simple constraints to improve the KG embedding task.
we examine two types of constraints: (i) non-negativity constraints on entity representations and (ii) approximate entailment constraints over relation representations.