StarSpace: Embed All The Things!
read the original abstract
We present StarSpace, a general-purpose neural embedding model that can solve a wide variety of problems: labeling tasks such as text classification, ranking tasks such as information retrieval/web search, collaborative filtering-based or content-based recommendation, embedding of multi-relational graphs, and learning word, sentence or document level embeddings. In each case the model works by embedding those entities comprised of discrete features and comparing them against each other -- learning similarities dependent on the task. Empirical results on a number of tasks show that StarSpace is highly competitive with existing methods, whilst also being generally applicable to new cases where those methods are not.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Graph Embeddings at Scale
Presents a distributed infrastructure for scaling skip-gram graph embeddings to 68M-vertex networks by avoiding partitioning, using dynamic size-constrained graphs, and efficient indexing for updates.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.