This video provides an overview of Graph Embeddings and how PyTorch-BigGraph enables learning graph embeddings for very large graphs. The key challenge with this is you would need a lot of memory to store the vectors for each node in a large graph. To solve this, BigGraph uses novel partitioning, distributed execution, and negative sampling algorithms. I hope this is a decent introduction to graph embeddings and PyTorch-BigGraph, really excited about the upcoming release of the Wikidata Weaviate web demo!
PyTorch-BigGraph (blog post) -
PyTorch-BigGraph (paper) -
Paperswithdata (graph filter) -
12 views
2
0
3 years ago 00:25:40 12
Graph Embeddings and PyTorch-BigGraph
3 years ago 00:41:10 13
QMIX / Graph Attention Networks with Positional Embeddings