mlsanityData to 7 Oct 2026

Improving Recall of Large Language Models: A Model Collaboration Approach for Relational Triple Extraction

arXiv 2404.09593 ↗First posted 15 Apr 2024cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

Relation triple extraction, which outputs a set of triples from long sentences, plays a vital role in knowledge acquisition. Large language models can accurately extract triples from simple sentences through few-shot learning or fine-tuning when given appropriate instructions. However, they often miss out when extracting from complex sentences. In this paper, we design an evaluation-filtering framework that integrates large language models with small models for relational triple extraction tasks. The framework includes an evaluation model that can extract related entity pairs with high precision. We propose a simple labeling principle and a deep neural network to build the model, embedding the outputs as prompts into the extraction process of the large model. We conduct extensive experiments to demonstrate that the proposed method can assist large language models in obtaining more accurate extraction results, especially from complex sentences containing multiple relational triples. Our evaluation model can also be embedded into traditional extraction models to enhance their extraction precision from complex sentences.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 27 of its 42 references that are in the map. First posted on arXiv 15 Apr 2024.

Builds on

27 of 42 references.

References · 27

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  6. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  7. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
  8. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
  9. 2023Qwen Technical Reportcited by 3,273
  10. 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
  11. 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
  12. 2023LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusioncited by 550
15 more
  1. 2023ChatIE: Zero-Shot Information Extraction via Chatting with ChatGPTcited by 250
  2. 2023Does Synthetic Data Generation of LLMs Help Clinical Text Mining?cited by 151
  3. 2022ChatGPT Makes Medicine Easy to Swallow: An Exploratory Case Study on Simplified Radiology Reportscited by 100
  4. 2019Entity-Relation Extraction as Multi-Turn Question Answeringcited by 96
  5. 2023Exploring the Feasibility of ChatGPT for Event Extractioncited by 76
  6. 2020TPLinker: Single-stage Joint Extraction of Entities and Relations Through Token Pair Linkingcited by 72
  7. 2023Zero-shot Temporal Relation Extraction with ChatGPTcited by 52
  8. 2018A Hierarchical Framework for Relation Extraction with Reinforcement Learningcited by 49
  9. 2019Joint Extraction of Entities and Relations Based on a Novel Decomposition Strategycited by 41
  10. 2023A Simple Zero-shot Prompt Weighting Technique to Improve Prompt Ensembling in Text-Image Modelscited by 39
  11. 2016CoType: Joint Extraction of Typed Entities and Relations with Knowledge Basescited by 28
  12. 2021Revisiting the Negative Data of Distantly Supervised Relation Extractioncited by 15
  13. 2017Heterogeneous Supervision for Relation Extraction: A Representation Learning Approachcited by 9
  14. 2022ZS4IE: A toolkit for Zero-Shot Information Extraction with simple Verbalizationscited by 7
  15. 2020InSRL: A Multi-view Learning Framework Fusing Multiple Information Sources for Distantly-supervised Relation Extractioncited by 4

Built on by

Cited by year

Citing papers per year: 2024: 2; 2025: 1.

3 papers.