Hence, given a data set D = {(m i , r i ), i = 1, ... , |D|} consisting of (mention, relationship) training pairs, one could learn the embeddings using constraints of the form: where 1 is the margin.
we want the relation that (weakly) labels a given mention to be scored higher than other relation by a margin of 1.