Emile will present our work on Knowledge Graph Embeddings at Eurips' Salon des Refusés on Friday! We show how linearity prevent KGEs from scaling to larger graphs + propose a simple solution using a Mixture of Softmaxes (see LLM literature) to break the limitations at a low parameter cost. 🔨
And finally #3 🔨 Rank bottlenecks in KGEs: At Friday's "Salon des Refuses" I will present @sbadredd.bsky.social 's new work on how rank bottlenecks limit knowledge graph embeddings arxiv.org/abs/2506.22271