HELEA: Hard-Negative Benchmark and LLM-based Reranking for Robust Entity Alignment

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Jang, Yoonjin, Kim, Junwoo, Ko, Youngjoong
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914608388767744
author Jang, Yoonjin
Kim, Junwoo
Ko, Youngjoong
author_facet Jang, Yoonjin
Kim, Junwoo
Ko, Youngjoong
contents Entity Alignment (EA) is essential for knowledge graph (KG) fusion, but existing benchmarks often allow models to exploit name overlap rather than relational structure. This makes it difficult to evaluate whether models can reject same-name entities that refer to different real-world objects. Our primary contribution is a same-name hard-negative augmentation strategy that simultaneously yields quality-controlled evaluation benchmarks (DW-HN29K, DY-HN27K) and augmented training corpora (DW-Train, DY-Train), by mining same-name but distinct entity pairs from KG name-collision groups. We further introduce HELEA, a two-stage framework integrating (i) entity encoder retrieval trained on hard-negative-augmented training corpora with 1-hop KG context, and (ii) LLM-based reranking without additional training. Experiments show that name-dependent baselines collapse to near-random performance on our hard-negative benchmarks, while HELEA achieves F1 0.967 on DW-HN29K while maintaining Hit@1 0.993 on standard DW-15K.
format Preprint
id arxiv_https___arxiv_org_abs_2605_28308
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle HELEA: Hard-Negative Benchmark and LLM-based Reranking for Robust Entity Alignment
Jang, Yoonjin
Kim, Junwoo
Ko, Youngjoong
Computation and Language
I.2.7; H.2.8
Entity Alignment (EA) is essential for knowledge graph (KG) fusion, but existing benchmarks often allow models to exploit name overlap rather than relational structure. This makes it difficult to evaluate whether models can reject same-name entities that refer to different real-world objects. Our primary contribution is a same-name hard-negative augmentation strategy that simultaneously yields quality-controlled evaluation benchmarks (DW-HN29K, DY-HN27K) and augmented training corpora (DW-Train, DY-Train), by mining same-name but distinct entity pairs from KG name-collision groups. We further introduce HELEA, a two-stage framework integrating (i) entity encoder retrieval trained on hard-negative-augmented training corpora with 1-hop KG context, and (ii) LLM-based reranking without additional training. Experiments show that name-dependent baselines collapse to near-random performance on our hard-negative benchmarks, while HELEA achieves F1 0.967 on DW-HN29K while maintaining Hit@1 0.993 on standard DW-15K.
title HELEA: Hard-Negative Benchmark and LLM-based Reranking for Robust Entity Alignment
topic Computation and Language
I.2.7; H.2.8
url https://arxiv.org/abs/2605.28308