Skip to Content

InstantEmbedding: Efficient Local Node Representations

Instant node embeddings
Our model produces an embedding for a single node locally, without looking at embeddings of other nodes.

paper · pdf · code coming soon


Can we embed a subset of nodes in a graph?

In this paper:

  • We introduce a novel problem of local node embedding.
  • We present our novel solution, InstantEmbedding, and provide theoretical guarantees on its locality and global embedding consistency.
  • We empirically prove that our method scales to industrial-scale (1.8 billion edges) graphs.