How Expressive are Knowledge Graph Foundation Models?
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918049352777728 |
|---|---|
| author | Huang, Xingyue Barceló, Pablo Bronstein, Michael M. Ceylan, İsmail İlkan Galkin, Mikhail Reutter, Juan L Orth, Miguel Romero |
| author_facet | Huang, Xingyue Barceló, Pablo Bronstein, Michael M. Ceylan, İsmail İlkan Galkin, Mikhail Reutter, Juan L Orth, Miguel Romero |
| contents | Knowledge Graph Foundation Models (KGFMs) are at the frontier for deep learning on knowledge graphs (KGs), as they can generalize to completely novel knowledge graphs with different relational vocabularies. Despite their empirical success, our theoretical understanding of KGFMs remains very limited. In this paper, we conduct a rigorous study of the expressive power of KGFMs. Specifically, we show that the expressive power of KGFMs directly depends on the motifs that are used to learn the relation representations. We then observe that the most typical motifs used in the existing literature are binary, as the representations are learned based on how pairs of relations interact, which limits the model's expressiveness. As part of our study, we design more expressive KGFMs using richer motifs, which necessitate learning relation representations based on, e.g., how triples of relations interact with each other. Finally, we empirically validate our theoretical findings, showing that the use of richer motifs results in better performance on a wide range of datasets drawn from different domains. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_13339 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | How Expressive are Knowledge Graph Foundation Models? Huang, Xingyue Barceló, Pablo Bronstein, Michael M. Ceylan, İsmail İlkan Galkin, Mikhail Reutter, Juan L Orth, Miguel Romero Machine Learning Artificial Intelligence Knowledge Graph Foundation Models (KGFMs) are at the frontier for deep learning on knowledge graphs (KGs), as they can generalize to completely novel knowledge graphs with different relational vocabularies. Despite their empirical success, our theoretical understanding of KGFMs remains very limited. In this paper, we conduct a rigorous study of the expressive power of KGFMs. Specifically, we show that the expressive power of KGFMs directly depends on the motifs that are used to learn the relation representations. We then observe that the most typical motifs used in the existing literature are binary, as the representations are learned based on how pairs of relations interact, which limits the model's expressiveness. As part of our study, we design more expressive KGFMs using richer motifs, which necessitate learning relation representations based on, e.g., how triples of relations interact with each other. Finally, we empirically validate our theoretical findings, showing that the use of richer motifs results in better performance on a wide range of datasets drawn from different domains. |
| title | How Expressive are Knowledge Graph Foundation Models? |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2502.13339 |