Neural Embeddings of Graphs in Hyperbolic Space
원문 초록
Neural embeddings have been used with great success in Natural Language Processing (NLP). They provide compact representations that encapsulate word similarity and attain state-of-the-art performance in a range of linguistic tasks. The success of neural embeddings has prompted significant amounts of research into applications in domains other than language. One such domain is graph-structured data, where embeddings of vertices can be learned that encapsulate vertex similarity and improve performance on tasks including edge prediction and vertex labelling. For both NLP and graph based tasks, embeddings have been learned in high-dimensional Euclidean spaces. However, recent work has shown that the appropriate isometric space for embedding complex networks is not the flat Euclidean space, but negatively curved, hyperbolic space. We present a new concept that exploits these recent insights and propose learning neural embeddings of graphs in hyperbolic space. We provide experimental evidence that embedding graphs in their natural geometry significantly improves performance on downstream tasks for several real-world public datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Analyzing Continuous Semantic Shifts with Diachronic Word Similarity Matrices
LGDE: Local Graph-based Dictionary Expansion
A Likelihood Ratio Test of Genetic Relationship among Languages
Are ELECTRA's Sentence Embeddings Beyond Repair? The Case of Semantic Textual Similarity
Visual Grounding Helps Learn Word Meanings in Low-Data Regimes
Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold
토론
이 논문과 연결된 포럼 글이 아직 없습니다.