1 citations · 1 across the 1 of their papers we have counts for
4 papers
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…
Interpretable Word Embeddings via Informative Priors
Miriam Hurtado Bodell, Martin Arvidsson, Måns Magnusson
Word embeddings have demonstrated strong performance on NLP tasks. However, lack of interpretability and the unsupervised nature of word embeddings have limited their use within co…
Bayesian leave-one-out cross-validation for large data
Måns Magnusson, Michael Riis Andersen, Johan Jonasson +1
Model inference, such as model comparison, model checking, and model selection, is an important part of model development. Leave-one-out cross-validation (LOO) is a general approac…
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth
Karl Bringmann, Thore Husfeldt, Måns Magnusson
We show that the eccentricities, diameter, radius, and Wiener index of an undirected -vertex graph with nonnegative edge lengths can be computed in time $O(n\cdot \binom{k+\lcei…