Bernoulli Embeddings for Graphs
Just as semantic hashing can accelerate information retrieval, binary valued embeddings can significantly reduce latency in the retrieval of graphical data. We introduce a simple but effective model for learning such binary vectors for nodes in a graph. By imagining the embeddings as independent coin flips of varying bias, continuous optimization techniques can be applied to the approximate expected loss. Embeddings optimized in this fashion consistently outperform the quantization of both spectral graph embeddings and various learned real-valued embeddings, on both ranking and pre-ranking tasks for a variety of datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
Information RetrievalQuantizationRetrievalSimilar Papers 제목 키워드 기반
Understanding Transformer Encoder-Decoder Representations through Bernoulli Dropout
We study Transformer overparameterization through the lens of angular similarity in high-dimensional encoder-decoder embeddings. We apply Bernoulli dropout between the encoder and the decoder, varying the keep probabilit…
Multivariate Bernoulli distribution
In this paper, we consider the multivariate Bernoulli distribution as a model to estimate the structure of graphs with binary nodes. This distribution is discussed in the framework of the exponential family, and its stat…
Variable SelectionDirichlet-Bernoulli Alignment: A Generative Model for Multi-Class Multi-Label Multi-Instance Corpora
We propose Dirichlet-Bernoulli Alignment (DBA), a generative model for corpora in which each pattern (e.g., a document) contains a set of instances (e.g., paragraphs in the document) and belongs to multiple classes. By c…
ClassificationEntity DisambiguationGeneral Classificationtext-classification+1Simple and Interpretable Probabilistic Classifiers for Knowledge Graphs
Tackling the problem of learning probabilistic classifiers from incomplete data in the context of Knowledge Graphs expressed in Description Logics, we describe an inductive approach based on learning simple belief networ…
Knowledge GraphsLearning dynamic word embeddings with drift regularisation
Word usage, meaning and connotation change throughout time. Diachronic word embeddings are used to grasp these changes in an unsupervised way. In this paper, we use variants of the Dynamic Bernoulli Embeddings model to l…
ArticlesDiachronic Word EmbeddingsWord Embeddings