Probabilistic Embeddings with Laplacian Graph Priors

Väinö Yrjänäinen, Måns Magnusson

We introduce probabilistic embeddings using Laplacian priors (PELP). The proposed model enables incorporating graph side-information into static word embeddings. We theoretically s…