arXiv Computation and Language

URA-NER: A Unified Retrieval-Augmented Framework with Retrieval Alignment and Uncertainty Reduction for Low-Resource NER

arXiv Computation and Language
Sep 15

Where to Look and What to Use: Retrieve-Localize-Generate for Long-Term Conversational Memory Question Answering

arXiv:2609.07093v2 Announce Type: replace Abstract: Retrieval-augmented generation (RAG) enables large language models (LLMs) to answer questions by accessing external knowledge and has been widely a...

By Yifan Wang, Xinkui Lin, Yongxiu Xu, Shen Gao, Ruochen Yang, Kun Huang, Yubin Wang, Jie Wu, Wei Liu, Jian Luan, Hongbo Xu, Shuo Shang
arXiv AI
Sep 3

NE-R1: Enhancing Named Entity Recognition Model via Reinforcement Learning

NE‑R1 is a framework that improves Named Entity Recognition by using a retrieval‑on‑demand mechanism and a two‑stage training process that includes instruction tuning and reinforcement learning with chain‑of‑thought. It balances the use of internal model parameters and external knowledge through a multi‑dimensional reward that considers accuracy and retrieval benefit. The approach achieves state‑of‑the‑art results, improving in‑domain F1 by 2.52% and zero‑shot cross‑domain F1 by 1.18%.

By Meixuan Chen, Hehan Li, Ruizhi Zhao, Xin Lu, peizhi xu, Liwei Qian, LI Meifang, shuanglong li, Hanmeng Liu, Xin Pei, Yanbiao Ma
arXiv Computation and Language
Aug 31

Select, Don't Train: The Benefits of Modular Entity Disambiguation with LLM-Based Selection

The paper investigates modular entity disambiguation by separating candidate retrieval from entity selection. It compares sparse retrieval (BM25), Web KB search, and a dense retriever, all paired with large language model selectors. Results show that a training‑free BM25 retriever combined with an LLM selector achieves state‑of‑the‑art performance on the ZELDA benchmark, and the modular approach enables abstention when retrieval fails.

By Fina Polat, Daniel Daza, Pengyu Zhang, Klim Zaporojets, Paul Groth
Hugging Face Trending Papers
Jul 27

CONSISTRE: A Unified Consistency-Aware Framework for Document-Level Relation Extraction with Large Language Models

Document-level relation extraction (DocRE) aims to extract relations among multiple entities across extended contexts while maintaining consistency across predicted triples. Although large language models (LLMs) show remarkable reasoning capabilities in information extraction, their predictions are typically generated independently for each candidate triple and may violate fundamental relational constraints such as transitivity, symmetry, and functional uniqueness, leading to contradictory and unreliable outputs.

arXiv AI
Sep 2

KGFR: A Foundation Retriever for Generalized Knowledge Graph Question Answering

KGFR introduces a Knowledge Graph Foundation Retriever that collaborates with large language models to enhance knowledge‑intensive question answering. By encoding relations with LLM‑generated descriptions and initializing entities from question roles, KGFR enables zero‑shot generalization to unseen knowledge graphs. Its Asymmetric Progressive Propagation technique efficiently handles large graphs, while a controllable reasoning loop allows the LLM to request candidate answers, supporting facts, and reasoning paths.

By Yuanning Cui, Zequn Sun, Wei Hu, Zhangjie Fu