Ansgar Scherp

Graph foundation models do not require monolithic backends: routing across lightweight linear GNNs conditioned on embeddings from both small and large language models unlocks robust few-shot transfer across node, link, and graph classification tasks.

LLMs encode hierarchical semantic relations asymmetrically, with hypernymy being far more robust and redundantly represented than hyponymy.