Papers › Adaptive Convolution for Multi-Relational Learning

Adaptive Convolution for Multi-Relational Learning

1 Jun 2019NAACL 2019 6archive 2025-07-28

Xiaotian Jiang, Quan Wang, Bin Wang

We consider the problem of learning distributed representations for entities and relations of multi-relational data so as to predict missing links therein. Convolutional neural networks have recently shown their superiority for this problem, bringing increased model expressiveness while remaining parameter efficient. Despite the success, previous convolution designs fail to model full interactions between input entities and relations, which potentially limits the performance of link prediction. In this work we introduce ConvR, an adaptive convolutional network designed to maximize entity-relation interactions in a convolutional fashion. ConvR adaptively constructs convolution filters from relation representations, and applies these filters across entity representations to generate convolutional features. As such, ConvR enables rich interactions between entity and relation representations at diverse regions, and all the convolutional features generated will be able to capture such interactions. We evaluate ConvR on multiple benchmark datasets. Experimental results show that: (1) ConvR performs substantially better than competitive baselines in almost all the metrics and on all the datasets; (2) Compared with state-of-the-art convolutional models, ConvR is not only more effective but also more efficient. It offers a 7{\%} increase in MRR and a 6{\%} increase in Hits@10, while saving 12{\%} in parameter storage.

PaperPDF

Code

No code repository is listed for this paper in the archive or in Syntology's graph.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Link PredictionRelational Reasoning

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Link Prediction FB15k ConvR Hits@1 0.720 #11 of 23 Archive leaderboard report
Link Prediction FB15k ConvR Hits@10 0.887 #11 of 23 Archive leaderboard report
Link Prediction FB15k ConvR Hits@3 0.826 #11 of 23 Archive leaderboard report
Link Prediction FB15k ConvR MRR 0.782 #11 of 23 Archive leaderboard report
Link Prediction FB15k-237 ConvR Hits@1 0.261 #29 of 75 Archive leaderboard report
Link Prediction FB15k-237 ConvR Hits@10 0.528 #29 of 75 Archive leaderboard report
Link Prediction FB15k-237 ConvR Hits@3 0.385 #29 of 75 Archive leaderboard report
Link Prediction FB15k-237 ConvR MRR 0.350 #29 of 75 Archive leaderboard report
Link Prediction WN18 ConvR Hits@1 0.947 #12 of 37 Archive leaderboard report
Link Prediction WN18 ConvR Hits@10 0.958 #12 of 37 Archive leaderboard report
Link Prediction WN18 ConvR Hits@3 0.955 #12 of 37 Archive leaderboard report
Link Prediction WN18 ConvR MRR 0.951 #12 of 37 Archive leaderboard report
Link Prediction WN18RR ConvR Hits@1 0.443 #57 of 75 Archive leaderboard report
Link Prediction WN18RR ConvR Hits@10 0.537 #57 of 75 Archive leaderboard report
Link Prediction WN18RR ConvR Hits@3 0.489 #57 of 75 Archive leaderboard report
Link Prediction WN18RR ConvR MRR 0.475 #57 of 75 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Convolution

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections