ReFactor GNNs: Revisiting Factorisation-based Models from a Message-Passing Perspective
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909457230856192 |
|---|---|
| author | Chen, Yihong Mishra, Pushkar Franceschi, Luca Minervini, Pasquale Stenetorp, Pontus Riedel, Sebastian |
| author_facet | Chen, Yihong Mishra, Pushkar Franceschi, Luca Minervini, Pasquale Stenetorp, Pontus Riedel, Sebastian |
| contents | Factorisation-based Models (FMs), such as DistMult, have enjoyed enduring success for Knowledge Graph Completion (KGC) tasks, often outperforming Graph Neural Networks (GNNs). However, unlike GNNs, FMs struggle to incorporate node features and generalise to unseen nodes in inductive settings. Our work bridges the gap between FMs and GNNs by proposing ReFactor GNNs. This new architecture draws upon both modelling paradigms, which previously were largely thought of as disjoint. Concretely, using a message-passing formalism, we show how FMs can be cast as GNNs by reformulating the gradient descent procedure as message-passing operations, which forms the basis of our ReFactor GNNs. Across a multitude of well-established KGC benchmarks, our ReFactor GNNs achieve comparable transductive performance to FMs, and state-of-the-art inductive performance while using an order of magnitude fewer parameters. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2207_09980 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | ReFactor GNNs: Revisiting Factorisation-based Models from a Message-Passing Perspective Chen, Yihong Mishra, Pushkar Franceschi, Luca Minervini, Pasquale Stenetorp, Pontus Riedel, Sebastian Machine Learning Artificial Intelligence Computation and Language 68T05, 68T07, 68T50 I.2.7; I.2.6 Factorisation-based Models (FMs), such as DistMult, have enjoyed enduring success for Knowledge Graph Completion (KGC) tasks, often outperforming Graph Neural Networks (GNNs). However, unlike GNNs, FMs struggle to incorporate node features and generalise to unseen nodes in inductive settings. Our work bridges the gap between FMs and GNNs by proposing ReFactor GNNs. This new architecture draws upon both modelling paradigms, which previously were largely thought of as disjoint. Concretely, using a message-passing formalism, we show how FMs can be cast as GNNs by reformulating the gradient descent procedure as message-passing operations, which forms the basis of our ReFactor GNNs. Across a multitude of well-established KGC benchmarks, our ReFactor GNNs achieve comparable transductive performance to FMs, and state-of-the-art inductive performance while using an order of magnitude fewer parameters. |
| title | ReFactor GNNs: Revisiting Factorisation-based Models from a Message-Passing Perspective |
| topic | Machine Learning Artificial Intelligence Computation and Language 68T05, 68T07, 68T50 I.2.7; I.2.6 |
| url | https://arxiv.org/abs/2207.09980 |