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 article, 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. Furthermore, 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.
- Authors:
-
- Sandia National Lab. (SNL-CA), Livermore, CA (United States)
- Publication Date:
- Research Org.:
- Sandia National Lab. (SNL-CA), Livermore, CA (United States)
- Sponsoring Org.:
- USDOE National Nuclear Security Administration (NNSA)
- OSTI Identifier:
- 1466759
- Report Number(s):
- SAND-2018-8912J
Journal ID: ISSN 2051-1310; 667069
- Grant/Contract Number:
- AC04-94AL85000
- Resource Type:
- Accepted Manuscript
- Journal Name:
- Journal of Complex Networks
- Additional Journal Information:
- Journal Volume: 6; Journal Issue: 3; Journal ID: ISSN 2051-1310
- Publisher:
- Oxford University Press
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING; hyperbolic graph embedding; landmark; embedding
Citation Formats
Chowdhary, Kenny, and Kolda, Tamara G. An improved hyperbolic embedding algorithm. United States: N. p., 2017.
Web. doi:10.1093/comnet/cnx034.
Chowdhary, Kenny, & Kolda, Tamara G. An improved hyperbolic embedding algorithm. United States. https://doi.org/10.1093/comnet/cnx034
Chowdhary, Kenny, and Kolda, Tamara G. Mon .
"An improved hyperbolic embedding algorithm". United States. https://doi.org/10.1093/comnet/cnx034. https://www.osti.gov/servlets/purl/1466759.
@article{osti_1466759,
title = {An improved hyperbolic embedding algorithm},
author = {Chowdhary, Kenny and Kolda, Tamara G.},
abstractNote = {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 article, 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. Furthermore, 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.},
doi = {10.1093/comnet/cnx034},
journal = {Journal of Complex Networks},
number = 3,
volume = 6,
place = {United States},
year = {Mon Dec 11 00:00:00 EST 2017},
month = {Mon Dec 11 00:00:00 EST 2017}
}
Search WorldCat to find libraries that may hold this journalWorks referenced in this record:
Hyperbolic geometry of complex networks
journal, September 2010
- Krioukov, Dmitri; Papadopoulos, Fragkiskos; Kitsak, Maksim
- Physical Review E, Vol. 82, Issue 3
Big-Bang Simulation for Embedding Network Distances in Euclidean Space
journal, December 2004
- Shavitt, Y.; Tankel, T.
- IEEE/ACM Transactions on Networking, Vol. 12, Issue 6
Sustaining the Internet with hyperbolic mapping
journal, September 2010
- Boguñá, Marián; Papadopoulos, Fragkiskos; Krioukov, Dmitri
- Nature Communications, Vol. 1, Issue 1
Popularity versus similarity in growing networks
journal, September 2012
- Papadopoulos, Fragkiskos; Kitsak, Maksim; Serrano, M. Ángeles
- Nature, Vol. 489, Issue 7417
Network Mapping by Replaying Hyperbolic Growth
journal, February 2015
- Papadopoulos, Fragkiskos; Psomas, Constantinos; Krioukov, Dmitri
- IEEE/ACM Transactions on Networking, Vol. 23, Issue 1
Network geometry inference using common neighbors
journal, August 2015
- Papadopoulos, Fragkiskos; Aldecoa, Rodrigo; Krioukov, Dmitri
- Physical Review E, Vol. 92, Issue 2
A Simplex Method for Function Minimization
journal, January 1965
- Nelder, J. A.; Mead, R.
- The Computer Journal, Vol. 7, Issue 4
Updating quasi-Newton matrices with limited storage
journal, September 1980
- Nocedal, Jorge
- Mathematics of Computation, Vol. 35, Issue 151
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
journal, January 2003
- Kolda, Tamara G.; Lewis, Robert Michael; Torczon, Virginia
- SIAM Review, Vol. 45, Issue 3
Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
journal, January 1998
- McKinnon, K. I. M.
- SIAM Journal on Optimization, Vol. 9, Issue 1
On the limited memory BFGS method for large scale optimization
journal, August 1989
- Liu, Dong C.; Nocedal, Jorge
- Mathematical Programming, Vol. 45, Issue 1-3
An Algorithm for Path Connections and Its Applications
journal, September 1961
- Lee, C. Y.
- IEEE Transactions on Electronic Computers, Vol. EC-10, Issue 3
Works referencing / citing this record:
Hydra: a method for strain-minimizing hyperbolic embedding of network- and distance-based data
journal, February 2020
- Keller-Ressel, Martin; Nargang, Stephanie
- Journal of Complex Networks, Vol. 8, Issue 1