English

Low-rank approximations of hyperbolic embeddings

Machine Learning 2019-03-19 v1 Optimization and Control Machine Learning

Abstract

The hyperbolic manifold is a smooth manifold of negative constant curvature. While the hyperbolic manifold is well-studied in the literature, it has gained interest in the machine learning and natural language processing communities lately due to its usefulness in modeling continuous hierarchies. Tasks with hierarchical structures are ubiquitous in those fields and there is a general interest to learning hyperbolic representations or embeddings of such tasks. Additionally, these embeddings of related tasks may also share a low-rank subspace. In this work, we propose to learn hyperbolic embeddings such that they also lie in a low-dimensional subspace. In particular, we consider the problem of learning a low-rank factorization of hyperbolic embeddings. We cast these problems as manifold optimization problems and propose computationally efficient algorithms. Empirical results illustrate the efficacy of the proposed approach.

Keywords

Cite

@article{arxiv.1903.07307,
  title  = {Low-rank approximations of hyperbolic embeddings},
  author = {Pratik Jawanpuria and Mayank Meghwanshi and Bamdev Mishra},
  journal= {arXiv preprint arXiv:1903.07307},
  year   = {2019}
}

Comments

Technical report

R2 v1 2026-06-23T08:11:05.971Z