A Compressive Memory-based Retrieval Approach for Event Argument Extraction
Not on the map. Why?
Abstract (arXiv)
Recent works have demonstrated the effectiveness of retrieval augmentation in the Event Argument Extraction (EAE) task. However, existing retrieval-based EAE methods have two main limitations: (1) input length constraints and (2) the gap between the retriever and the inference model. These issues limit the diversity and quality of the retrieved information. In this paper, we propose a Compressive Memory-based Retrieval (CMR) mechanism for EAE, which addresses the two limitations mentioned above. Our compressive memory, designed as a dynamic matrix that effectively caches retrieved information and supports continuous updates, overcomes the limitations of the input length. Additionally, after pre-loading all candidate demonstrations into the compressive memory, the model further retrieves and filters relevant information from memory based on the input query, bridging the gap between the retriever and the inference model. Extensive experiments show that our method achieves new state-of-the-art performance on three public datasets (RAMS, WikiEvents, ACE05), significantly outperforming existing retrieval-based EAE methods.
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 14 Sep 2024.
Builds on
27 of 42 references.
References · 27
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
- 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,061
- 2024How Far Are We to GPT-4V? Closing the Gap to Commercial Multimodal Models with Open-Source Suitescited by 1,033
- 2024RAFT: Adapting Language Model to Domain Specific RAGcited by 258
- 2019Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernelcited by 211
- 2022A Survey on Retrieval-Augmented Text Generationcited by 157
15 more
- 2021Document-Level Event Argument Extraction by Conditional Generationcited by 154
- 2019Multi-Sentence Argument Linkingcited by 80
- 2022Prompt for Extraction? PAIE: Prompting Argument Interaction for Event Argument Extractioncited by 54
- 2023Retrieval-augmented Generation to Improve Math Question-Answering: Trade-offs Between Groundedness and Human Preferencecited by 37
- 2024Time Series Modeling for Heart Rate Prediction: From ARIMA to Transformerscited by 35
- 2022A Thorough Examination on Zero-shot Dense Retrievalcited by 21
- 2024Rectifier: Code Translation with Corrector via LLMscited by 20
- 2023AMPERE: AMR-Aware Prefix for Generation-Based Event Argument Extraction Modelcited by 19
- 2022Retrieval-Augmented Generative Question Answering for Event Argument Extractioncited by 18
- 2022Dynamic Global Memory for Document-level Argument Extractioncited by 11
- 2023BERM: Training the Balanced and Extractable Representation for Matching to Improve Generalization Ability of Dense Retrievalcited by 11
- 2023Revisiting Event Argument Extraction: Can EAE Models Learn Better When Being Aware of Event Co-occurrences?cited by 10
- 2023Enhancing Document-level Event Argument Extraction with Contextual Clues and Role Relevancecited by 10
- 2024L^2GC:Lorentzian Linear Graph Convolutional Networks for Node Classificationcited by 5
- 2023From Simple to Complex: A Progressive Framework for Document-level Informative Argument Extractioncited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.