Adaptive Reinforcement Learning Planning: Harnessing Large Language Models for Complex Information Extraction
Not on the map. Why?
Abstract (arXiv)
Existing research on large language models (LLMs) shows that they can solve information extraction tasks through multi-step planning. However, their extraction behavior on complex sentences and tasks is unstable, emerging issues such as false positives and missing elements. We observe that decomposing complex extraction tasks and extracting them step by step can effectively improve LLMs' performance, and the extraction orders of entities significantly affect the final results of LLMs. This paper proposes a two-stage multi-step method for LLM-based information extraction and adopts the RL framework to execute the multi-step planning. We regard sequential extraction as a Markov decision process, build an LLM-based extraction environment, design a decision module to adaptively provide the optimal order for sequential entity extraction on different sentences, and utilize the DDQN algorithm to train the decision model. We also design the rewards and evaluation metrics suitable for the extraction results of LLMs. We conduct extensive experiments on multiple public datasets to demonstrate the effectiveness of our method in improving the information extraction capabilities of LLMs.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 42 references that are in the map. First posted on arXiv 17 Jun 2024.
Builds on
28 of 42 references.
References · 28
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
- 2023Qwen Technical Reportcited by 3,273
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2019Entity, Relation, and Event Extraction with Contextualized Span Representationscited by 261
- 2024Personal LLM Agents: Insights and Survey about the Capability, Efficiency and Securitycited by 257
- 2018FewRel: A Large-Scale Supervised Few-Shot Relation Classification Dataset with State-of-the-Art Evaluationcited by 254
16 more
- 2023ChatIE: Zero-Shot Information Extraction via Chatting with ChatGPTcited by 250
- 2022Unified Structure Generation for Universal Information Extractioncited by 220
- 2023Does Synthetic Data Generation of LLMs Help Clinical Text Mining?cited by 151
- 2023Large Language Model Is Not a Good Few-shot Information Extractor, but a Good Reranker for Hard Samples!cited by 119
- 2022ChatGPT Makes Medicine Easy to Swallow: An Exploratory Case Study on Simplified Radiology Reportscited by 100
- 2021DEGREE: A Data-Efficient Generation-Based Event Extraction Modelcited by 82
- 2023Exploring the Feasibility of ChatGPT for Event Extractioncited by 76
- 2019OpenNRE: An Open and Extensible Toolkit for Neural Relation Extractioncited by 62
- 2018A Hierarchical Framework for Relation Extraction with Reinforcement Learningcited by 49
- 2020Contrastive Triple Extraction with Generative Transformercited by 44
- 2024Tokenization Matters! Degrading Large Language Models through Challenging Their Tokenizationcited by 32
- 2024AutoScraper: A Progressive Understanding Web Agent for Web Scraper Generationcited by 18
- 2016Improving Information Extraction by Acquiring External Evidence with Reinforcement Learningcited by 16
- 2021Revisiting the Negative Data of Distantly Supervised Relation Extractioncited by 15
- 2021Efficient Document-level Event Extraction via Pseudo-Trigger-aware Pruned Complete Graphcited by 13
- 2024Improving Recall of Large Language Models: A Model Collaboration Approach for Relational Triple Extractioncited by 3
Built on by
Citing papers per year: 2025: 2.
2 papers.