R1-RE: Cross-Domain Relation Extraction with RLVR

Runpeng Dai, Tong Zheng, Run Yang, Kaixian Yu, Hongtu Zhu
7/7/2025
cs.CL

No official code found. Best implementation: RunpengDai/R1_RE (2 stars, last commit 2026-04-18).

Abstract

Relation extraction (RE) is a core task in natural language processing. Traditional approaches typically frame RE as a supervised learning problem, directly mapping context to labels-an approach that often suffers from poor out-of-domain (OOD) generalization. Inspired by the workflow of human annotators, we reframe RE as a reasoning task guided by annotation guidelines and introduce R1-RE, the first reinforcement learning with verifiable reward (RLVR) framework for RE tasks. Our method elicits the reasoning abilities of small language models for annotation tasks, resulting in significantly improved OOD robustness. We evaluate our approach on the public Sem-2010 dataset and a private MDKG dataset. The R1-RE-7B model attains an average OOD accuracy of approximately 70%, on par with leading proprietary models such as GPT-4o. Additionally, our comprehensive analysis provides novel insights into the training dynamics and emergent reasoning behaviors of the RLVR paradigm for RE.

View on arXivView PDF

Code Implementations(1)

RunpengDai/R1_RECommunity61%

Official implementation of R1_RE: Cross-domain Relation Extraction with RLVR

20Shell, PythonDec 30, 20256 months ago

Similar Papers

Cite this paper

@article{dai2025rre,
  title  = {R1-RE: Cross-Domain Relation Extraction with RLVR},
  author = {Runpeng Dai and Tong Zheng and Run Yang and Kaixian Yu and Hongtu Zhu},
  year   = {2025},
  eprint = {2507.04642},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.04642v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.04642.svg)](https://codeofpaper.com/paper/2507.04642)

Discussion