arXiv AI

Beyond Single-Negative Preference: Multi-Negative DPO for LLM-Centric Historical Entity Linking

The paper introduces Multi-Negative Direct Preference Optimisation (MDPO), a pairwise objective that compares the correct entity with all valid rejected candidates for each mention, extending the single-negative approach used in prior work. MDPO retains the Bradley‑Terry formulation of Direct Preference Optimisation while leveraging the full candidate set through masked, length‑normalised sequence scores. Experiments on French, German, English, Swedish, and Finnish historical newspaper datasets (hipe‑2020 and newseye) show that MDPO outperforms both supervised fine‑tuning and single‑negative DPO, especially for NIL mentions, semantic ambiguity, OCR noise, and historically challenging names, and highlight candidate retrieval as a key bottleneck.

arXiv AI
Sep 3

BioELX: Context-Aware Cross-lingual Biomedical Entity Linking without Task-Specific Supervision

BioELX is a retrieve‑rerank framework for cross‑lingual biomedical entity linking that tackles two key problems: the English‑biased UMLS alias training data and the degradation caused by naïvely adding context. It fine‑tunes SapBERT_multi with Wikidata‑derived cross‑lingual alias supervision to create shared concept neighborhoods, and then reranks candidates using pretrained LLMs with mention‑anchored prompting to focus on the target mention. Experiments demonstrate state‑of‑the‑art performance on four benchmarks, improving Recall@1 by 4.8–18.2 percentage points without task‑specific annotations.

By Yi Wang, Corina Dima, Liangyu Zhong, Steffen Staab
arXiv Computation and Language
Sep 11

Think Before You Link: Rarity, Reasoning, and Retrieval in Multilingual Entity Linking

The paper introduces a new perspective on entity rarity in multimodal entity linking by using knowledge‑graph structural metrics instead of popularity metrics, revealing many rare entities previously overlooked. Experiments show that state‑of‑the‑art models suffer a 15.4–39.9% accuracy drop on these rare‑entity slices. The authors propose a training‑free framework that combines reasoning and retrieval with a vision‑language model, achieving a 6.9% overall accuracy gain and up to 23.3% improvement on rare entities, and release a new benchmark MERLIN‑Rare for focused evaluation.

By Parinthapat Pengpun, Simran Khanuja, Graham Neubig
arXiv AI
6d ago

A Scalable Framework for Automated NER Annotation Correction in Low-Resource Languages

The paper introduces a scalable, multi-step framework designed to improve the quality of Named Entity Recognition (NER) annotations, particularly in low-resource languages. It employs a frequency-based iterative approach that combines self‑training with a dual‑threshold mechanism to increase inference confidence. Experiments on various NER datasets show notable performance gains over the original data, and the study also investigates the use of generative Large Language Models for NER tasks.

By Toqeer Ehsan, Thamar Solorio
arXiv Computation and Language
Sep 1

Error-Type-Aware Loss Reweighting for Robust Named Entity Recognition with Noisy LLM Labels

Large language models (LLMs) are increasingly used to annotate datasets for training smaller, task‑specialized models such as named entity recognition (NER). However, current fine‑tuning processes ignore the annotation noise introduced by LLMs, leading to degraded performance, and existing noise‑robust losses fail to handle the heterogeneous nature of NER noise (e.g., missing mentions vs. type errors). The authors propose error‑type‑aware loss reweighting, which applies separate reweighting rules for different erroneous token types, improving F1 scores by 0.8–2.0 percentage points on average and up to 4.6 points on Wikigold at 24.1% noise.

By Elena Merdjanovska, Jonas Golde, Alan Akbik
arXiv Computation and Language
Sep 10

Multi-Functional Embedding Models for Funder Name Disambiguation in Scientific Publication Records

The paper introduces a multilingual, multi-functional framework for disambiguating funder names in scientific publications, using a training dataset that merges the Research Organization Registry with Web of Science and Crossref Open Funder Registry data. By applying multi-task learning with contrastive and multiple negatives ranking losses, the authors fine‑tune open‑weight embedding models from the Sentence Transformer, Gemma, and Qwen3 families, achieving over 90% accuracy in matching Web of Science funder names to ROR identifiers and surpassing general‑purpose LLMs by more than 0.1. For funders not present in ROR, a similarity network is constructed to identify clusters, and the study discusses challenges related to smaller and non‑English‑speaking funders.

By Kanyao Han, Zhiwen You, Jinseok Kim, Jana Diesner
arXiv Computation and Language
Aug 27

Just Pass Twice: Efficient Token Classification with LLMs for Zero-Shot NER

Just Pass Twice (JPT) is a method that allows causal large language models to perform token classification for zero‑shot named entity recognition by concatenating the input with itself, giving each token full bidirectional context without architectural changes. The approach combines these representations with definition‑guided entity embeddings to enable flexible zero‑shot generalization. JPT achieves state‑of‑the‑art results, outperforming prior methods by an average of +7.9 F1 on CrossNER and MIT benchmarks and running over 20× faster than comparable generative approaches.

By Ahmed Ewais, Ahmed Hashish, Amr Ali