Skip to Content

HUGE: Huge Unsupervised Graph Embeddings with TPUs

Posted on One min read
A T-SNE plot of embeddings.
Embeddings of OGB Papers100M learned with HUGE on 64 TPUs.

paper · pdf

TL;DR

TPUs are great for embedding very large graphs.

In this paper:

  • We publish the design of a production-grade graph embedding system used at Google.
  • The system can process multi-billion node graphs with ease, maintainting high embedding quality.
  • We use very fast TPU memory to host the embeddings; this allows for unparalleled scalability.