Pith. sign in

REVIEW

DynaSemble: Dynamic Ensembling of Textual and Structure-Based Models for Knowledge Graph Completion

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.03780 v2 pith:VLC7AEDG submitted 2023-11-07 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords modelstextualapproachesdynasemblegraphknowledgestructure-basedanswer
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We consider two popular approaches to Knowledge Graph Completion (KGC): textual models that rely on textual entity descriptions, and structure-based models that exploit the connectivity structure of the Knowledge Graph (KG). Preliminary experiments show that these approaches have complementary strengths: structure-based models perform exceptionally well when the gold answer is easily reachable from the query head in the KG, while textual models exploit descriptions to give good performance even when the gold answer is not easily reachable. In response, we propose DynaSemble, a novel method for learning query-dependent ensemble weights to combine these approaches by using the distributions of scores assigned by the models in the ensemble to all candidate entities. DynaSemble achieves state-of-the-art results on three standard KGC datasets, with up to 6.8 pt MRR and 8.3 pt Hits@1 gains over the best baseline model for the WN18RR dataset.

Discussion (0). Sign in to comment.

Pith tools