Abstract: Aspects of the present disclosure relate to knowledge graph compression. An input knowledge graph (KG) can be received. The input KG can be encoded to receive a first set of node embeddings. The input KG can be compressed into an output KG. The output KG can be encoded to receive a second set of node embeddings. A model for KG compression can be trained using optimal transport based on a distance matrix between the first set of node embeddings and the second set of node embeddings.