An Improved Hyperbolic Embedding Algorithm

Abstract

Because hyperbolic space has properties that make it amenable to graph representations, there is significant interest in scalable hyperbolic-space embedding methods. These embeddings enable constant-time approximation of shortest-path distances, and so are significantly more efficient than full shortest-path computations. In this paper we improve on existing landmark-based hyperbolic embedding algorithms for large-scale graphs. Whereas previous methods compute the embedding by using the derivative-free Nelder-Mead simplex optimization method, our approach uses the limited-memory BFGS (LBFGS) method, which is quasi-Newton optimization, with analytic gradients. Our method is not only significantly faster but also produces higher-quality embeddings. Moreover, we are able to include the hyperbolic curvature as a variable in the optimization. We compare our hyperbolic embedding method implementation in Python (called Hypy) against the best publicly available software, Rigel. Our method is an order of magnitude faster and shows significant improvements in the accuracy of the shortest path distance calculations. Tests are performed on a variety of real-world networks, and we show the scalability of our method by embedding a graph with 1.8 billion edges and 65 million nodes.

Publication
Journal of Complex Networks
Date
Tags
Citation
K. Chowdhary, T. G. Kolda. An Improved Hyperbolic Embedding Algorithm. Journal of Complex Networks, 2017. https://doi.org/10.1093/comnet/cnx034

Keywords

hyperbolic graph embedding, landmark embedding

Comments

Free access link (same as URL): https://academic.oup.com/comnet/advance-article/doi/10.1093/comnet/cnx034/4727184?guestAccessKey=1b9bfcb0-d371-4741-98d4-92827aaf6d1c

BibTeX

@article{ChKo17,  
author = {Kenny Chowdhary and Tamara G. Kolda}, 
title = {An Improved Hyperbolic Embedding Algorithm}, 
journal = {Journal of Complex Networks}, 
month = {December}, 
year = {2017},
doi = {https://doi.org/10.1093/comnet/cnx034},	
url = {https://academic.oup.com/comnet/advance-article/doi/10.1093/comnet/cnx034/4727184?guestAccessKey=1b9bfcb0-d371-4741-98d4-92827aaf6d1c},
}