Papers › Self-Distillation with Meta Learning for Knowledge Graph Completion

Self-Distillation with Meta Learning for Knowledge Graph Completion

20 May 2023Findings of the Association for Computational Linguistics: EMNLP 2022 2022 12arXiv:2305.12209archive 2025-07-28

Yunshui Li, Junhao Liu, Chengming Li, Min Yang

In this paper, we propose a selfdistillation framework with meta learning(MetaSD) for knowledge graph completion with dynamic pruning, which aims to learn compressed graph embeddings and tackle the longtail samples. Specifically, we first propose a dynamic pruning technique to obtain a small pruned model from a large source model, where the pruning mask of the pruned model could be updated adaptively per epoch after the model weights are updated. The pruned model is supposed to be more sensitive to difficult to memorize samples(e.g., longtail samples) than the source model. Then, we propose a onestep meta selfdistillation method for distilling comprehensive knowledge from the source model to the pruned model, where the two models coevolve in a dynamic manner during training. In particular, we exploit the performance of the pruned model, which is trained alongside the source model in one iteration, to improve the source models knowledge transfer ability for the next iteration via meta learning. Extensive experiments show that MetaSD achieves competitive performance compared to strong baselines, while being 10x smaller than baselines.

PaperPDFConference PDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

pldlgb/MetaSD officialmentioned in paperpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

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

Tasks

Knowledge Graph CompletionMeta-LearningTransfer Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Link Prediction FB15k-237 MetaSD Hits@1 0.300 #4 of 75 Archive leaderboard report
Link Prediction FB15k-237 MetaSD Hits@10 0.571 #4 of 75 Archive leaderboard report
Link Prediction FB15k-237 MetaSD Hits@3 0.428 #4 of 75 Archive leaderboard report
Link Prediction FB15k-237 MetaSD MRR 0.391 #4 of 75 Archive leaderboard report
Link Prediction WN18RR MetaSD Hits@1 0.447 #37 of 75 Archive leaderboard report
Link Prediction WN18RR MetaSD Hits@10 0.570 #37 of 75 Archive leaderboard report
Link Prediction WN18RR MetaSD Hits@3 0.504 #37 of 75 Archive leaderboard report
Link Prediction WN18RR MetaSD MRR 0.491 #37 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

Pruning

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