Low-Rank Approximations of Hyperbolic Embeddings. Jawanpuria, P., Meghwanshi, M., & Mishra, B.
Low-Rank Approximations of Hyperbolic Embeddings [link]Paper  abstract   bibtex   
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.
@article{jawanpuriaLowrankApproximationsHyperbolic2019,
  archivePrefix = {arXiv},
  eprinttype = {arxiv},
  eprint = {1903.07307},
  primaryClass = {cs, math, stat},
  title = {Low-Rank Approximations of Hyperbolic Embeddings},
  url = {http://arxiv.org/abs/1903.07307},
  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.},
  urldate = {2019-03-19},
  date = {2019-03-18},
  keywords = {Statistics - Machine Learning,Computer Science - Machine Learning,Mathematics - Optimization and Control},
  author = {Jawanpuria, Pratik and Meghwanshi, Mayank and Mishra, Bamdev},
  file = {/home/dimitri/Nextcloud/Zotero/storage/HSJ9EB3M/Jawanpuria et al. - 2019 - Low-rank approximations of hyperbolic embeddings.pdf;/home/dimitri/Nextcloud/Zotero/storage/88FXB97C/1903.html}
}
Downloads: 0