Preprint · 2018 · Open access

Skip-gram word embeddings in hyperbolic space

Matthias Leimeister, Benjamin J. Wilson

arXiv (Cornell University) · Published 30 August 2018 · DOI 10.48550/arxiv.1809.01498

Open PDFView at the publisherCite this paper

In brief

“Skip-gram word embeddings in hyperbolic space” is a 2018 preprint by Matthias Leimeister and Benjamin J. Wilson, published in arXiv (Cornell University). OpenAlex counts 55 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
55
Most cited in
2019 (9)
References
31
Authors
2

Abstract

Recent work has demonstrated that embeddings of tree-like graphs in hyperbolic space surpass their Euclidean counterparts in performance by a large margin. Inspired by these results and scale-free structure in the word co-occurrence graph, we present an algorithm for learning word embeddings in hyperbolic space from free text. An objective function based on the hyperbolic distance is derived and included in the skip-gram negative-sampling architecture of word2vec. The hyperbolic word embeddings are then evaluated on word similarity and analogy benchmarks. The results demonstrate the potential of hyperbolic word embeddings, particularly in low dimensions, though without clear superiority over their Euclidean counterparts. We further discuss subtleties in the formulation of the analogy task in curved spaces.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Leimeister, M., & Wilson, B. J. (2018). Skip-gram word embeddings in hyperbolic space. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1809.01498

MLA 9

Leimeister, Matthias, and Benjamin J. Wilson. “Skip-gram word embeddings in hyperbolic space.” arXiv (Cornell University), 2018. https://doi.org/10.48550/arxiv.1809.01498.

Chicago

Leimeister, Matthias and Benjamin J. Wilson. 2018. “Skip-gram word embeddings in hyperbolic space.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1809.01498.

Harvard

Leimeister, M. and Wilson, B. J. (2018) ‘Skip-gram word embeddings in hyperbolic space’, arXiv (Cornell University). doi:10.48550/arxiv.1809.01498.

IEEE

M. Leimeister and B. J. Wilson, “Skip-gram word embeddings in hyperbolic space,” arXiv (Cornell University), 2018, doi: 10.48550/arxiv.1809.01498.

BibTeX

@misc{leimeister2018skip,
  title     = {{Skip-gram word embeddings in hyperbolic space}},
  author    = {Leimeister, Matthias and Wilson, Benjamin J.},
  howpublished = {arXiv (Cornell University)},
  year      = {2018},
  doi       = {10.48550/arxiv.1809.01498},
  url       = {https://doi.org/10.48550/arxiv.1809.01498}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201822
201999
202077
202188
202277
202344
202488
202566
202644

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling

  • skip-gram
  • Word2Vec
  • hyperbolic distance
  • word co-occurrence graph
  • scale-free networks
  • word analogy
  • word similarity
  • negative sampling

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Leimeister, M., & Wilson, B. J. (2018). Skip-gram word embeddings in hyperbolic space. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1809.01498

How many times has this paper been cited?

55 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Matthias Leimeister, Benjamin J. Wilson.

What is the DOI of this paper?

10.48550/arxiv.1809.01498, permanently at https://doi.org/10.48550/arxiv.1809.01498. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.